Sciweavers

46 search results - page 4 / 10
» Discovering of Frequent Itemsets with CP-mine Algorithm
Sort
View
CORR
2010
Springer
173views Education» more  CORR 2010»
14 years 7 months ago
Mining Multi-Level Frequent Itemsets under Constraints
Mining association rules is a task of data mining, which extracts knowledge in the form of significant implication relation of useful items (objects) from a database. Mining multi...
Mohamed Salah Gouider, Amine Farhat
FIMI
2003
146views Data Mining» more  FIMI 2003»
14 years 11 months ago
Mining Frequent Itemsets using Patricia Tries
We present a depth-first algorithm, PatriciaMine, that discovers all frequent itemsets in a dataset, for a given support threshold. The algorithm is main-memory based and employs...
Andrea Pietracaprina, Dario Zandolin
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
15 years 10 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
91
Voted
KDD
2007
ACM
170views Data Mining» more  KDD 2007»
15 years 10 months ago
From frequent itemsets to semantically meaningful visual patterns
Data mining techniques that are successful in transaction and text data may not be simply applied to image data that contain high-dimensional features and have spatial structures....
Junsong Yuan, Ying Wu, Ming Yang
FIMI
2004
161views Data Mining» more  FIMI 2004»
14 years 11 months ago
ABS: Adaptive Borders Search of frequent itemsets
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
Frédéric Flouvat, Fabien De Marchi, ...