Sciweavers

192 search results - page 22 / 39
» Efficient Mining of Dissociation Rules
Sort
View
WEBNET
2000
13 years 9 months ago
Mining the Most Interesting Web Access Associations
: Web access patterns can provide valuable information for website designers in making website-based communication more efficient. To extract interesting or useful web access patte...
Li Shen, Ling Cheng, James Ford, Fillia Makedon, V...
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...
CINQ
2004
Springer
125views Database» more  CINQ 2004»
14 years 1 months ago
The Hows, Whys, and Whens of Constraints in Itemset and Rule Discovery
Many researchers in our community (this author included) regularly emphasize the role constraints play in improving performance of data-mining algorithms. This emphasis has led to ...
Roberto J. Bayardo
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 8 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
DAWAK
2010
Springer
13 years 8 months ago
Mining Closed Itemsets in Data Stream Using Formal Concept Analysis
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
Anamika Gupta, Vasudha Bhatnagar, Naveen Kumar