Sciweavers

111 search results - page 1 / 23
» COFI approach for mining frequent itemsets revisited
Sort
View
DMKD
2004
ACM
139views Data Mining» more  DMKD 2004»
13 years 10 months ago
COFI approach for mining frequent itemsets revisited
Mohammad El-Hajj, Osmar R. Zaïane
FIMI
2003
210views Data Mining» more  FIMI 2003»
13 years 6 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
13 years 8 months ago
Frequent regular itemset mining
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
Salvatore Ruggieri
PKDD
2007
Springer
147views Data Mining» more  PKDD 2007»
13 years 11 months ago
MINI: Mining Informative Non-redundant Itemsets
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
Arianna Gallo, Tijl De Bie, Nello Cristianini
KDD
2009
ACM
193views Data Mining» more  KDD 2009»
14 years 5 months ago
Probabilistic frequent itemset mining in uncertain databases
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
Andreas Züfle, Florian Verhein, Hans-Peter Kr...