2010 International Conference on Data Storage and Data Engineering 2010
DOI: 10.1109/dsde.2010.32
|View full text |Cite
|
Sign up to set email alerts
|

A Survey of Algorithms in FCIM

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2012
2012
2013
2013

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 6 publications
0
3
0
Order By: Relevance
“…Recent surveys on frequent-closed-itemset mining of associating rules can be found in [157,184]. For the second phase, condensed representations for association rules can be generated from frequent closed itemsets and generators, which further reduces the processing time of association rule generation.…”
Section: Closed-itemset Frameworkmentioning
confidence: 99%
“…Recent surveys on frequent-closed-itemset mining of associating rules can be found in [157,184]. For the second phase, condensed representations for association rules can be generated from frequent closed itemsets and generators, which further reduces the processing time of association rule generation.…”
Section: Closed-itemset Frameworkmentioning
confidence: 99%
“…The precise definition of closed item set, however, is based on Relations (1) and (2). Let us consider T, y and then respectively…”
Section: Problem Developmentmentioning
confidence: 99%
“…In addition, it decreases redundant rules and increases mining efficiency. Many algorithms have been presented for mining frequent closed item sets [2], and A-close proved to be a fundamental one [3].…”
Section: Introductionmentioning
confidence: 99%