Sciweavers

352 search results - page 1 / 71
» Non-derivable itemset mining
Sort
View
72
Voted
DMIN
2007
90views Data Mining» more  DMIN 2007»
15 years 11 days ago
On Minimal Infrequent Itemset Mining
—A new algorithm for minimal infrequent itemset mining is presented. Potential applications of finding infrequent itemsets include statistical disclosure risk assessment, bioinf...
David J. Haglin, Anna M. Manning
87
Voted
PKDD
2007
Springer
147views Data Mining» more  PKDD 2007»
15 years 5 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
82
Voted
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 2 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
89
Voted
FIMI
2004
239views Data Mining» more  FIMI 2004»
15 years 9 days ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
KDD
2009
ACM
193views Data Mining» more  KDD 2009»
15 years 11 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...