2014 Seventh International Conference on Contemporary Computing (IC3) 2014
DOI: 10.1109/ic3.2014.6897166
|View full text |Cite
|
Sign up to set email alerts
|

Proposed algorithm for frequent item set generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…In recent years, massive data mining problem is researched hot by researchers, Patil et al [9] give contribution to improved apriori algorithm by hiding sensitive association rules which are generated by applying improved apriori algorithm on supermarket database. Singh and Agarwal [10] propose a new optimized algorithm and to compare its performance with the existing data mining algorithms. Prasanna and Seetha [11] present a method for generating association rules from large high dimensional data, which can obtain more rapid computing speed and sententious rules.…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, massive data mining problem is researched hot by researchers, Patil et al [9] give contribution to improved apriori algorithm by hiding sensitive association rules which are generated by applying improved apriori algorithm on supermarket database. Singh and Agarwal [10] propose a new optimized algorithm and to compare its performance with the existing data mining algorithms. Prasanna and Seetha [11] present a method for generating association rules from large high dimensional data, which can obtain more rapid computing speed and sententious rules.…”
Section: Introductionmentioning
confidence: 99%
“…Fang and Qizhi [3] proposed an improved Apriori algorithm with better in performance than previous one and performing less scan with generating less number of candidate sets to improve algorithm efficiency. Singh and Agarwal [4] proposed the optimized algorithm i.e. FI generator with fewer numbers of database scans.…”
Section: Related Work On Frequent Pattern Miningmentioning
confidence: 99%