Sciweavers

694 search results - page 117 / 139
» An Associative Memory for Association Rule Mining
Sort
View
KDD
2003
ACM
160views Data Mining» more  KDD 2003»
14 years 8 months ago
Playing hide-and-seek with correlations
We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method cons...
Chris Jermaine
SEMCO
2008
IEEE
14 years 1 months ago
A Comparative Study of Feature Extraction Algorithms in Customer Reviews
The paper systematically compares two feature extraction algorithms to mine product features commented on in customer reviews. The first approach [17] identifies candidate featu...
Liliana Ferreira, Niklas Jakob, Iryna Gurevych
KES
2004
Springer
14 years 28 days ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
13 years 12 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
DIS
2008
Springer
13 years 9 months ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...