Sciweavers

739 search results - page 119 / 148
» Approximate Association Rule Mining
Sort
View
SEMCO
2008
IEEE
14 years 2 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 1 months 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...
SEDE
2007
13 years 9 months ago
Self-organizing map based web pages clustering using web logs
A Web-based business always wants to have the ability to track users’ browsing behavior history. This ability can be achieved by using Web log mining technologies. In this paper...
Dehu Qi, Chung-Chih Li