Sciweavers

156 search results - page 19 / 32
» Mining Frequent Itemsets from Secondary Memory
Sort
View
ICCS
2004
Springer
14 years 24 days ago
Iceberg Query Lattices for Datalog
In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension...
Gerd Stumme
KDD
1999
ACM
237views Data Mining» more  KDD 1999»
13 years 11 months ago
Using Association Rules for Product Assortment Decisions: A Case Study
It has been claimed that the discovery of association rules is well-suited for applications of market basket analysis to reveal regularities in the purchase behaviour of customers...
Tom Brijs, Gilbert Swinnen, Koen Vanhoof, Geert We...
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
14 years 7 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
FIMI
2003
88views Data Mining» more  FIMI 2003»
13 years 8 months ago
A fast APRIORI implementation
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
Ferenc Bodon
PAKDD
2005
ACM
128views Data Mining» more  PAKDD 2005»
14 years 27 days ago
A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...
Ying Liu, Wei-keng Liao, Alok N. Choudhary