Sciweavers

4 search results - page 1 / 1
» Finding Good Itemsets by Packing Data
Sort
View
ICDM
2008
IEEE
99views Data Mining» more  ICDM 2008»
13 years 11 months ago
Finding Good Itemsets by Packing Data
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
Nikolaj Tatti, Jilles Vreeken
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
13 years 11 months ago
Finding Maximal Fully-Correlated Itemsets in Large Databases
—Finding the most interesting correlations among items is essential for problems in many commercial, medical, and scientific domains. Much previous research focuses on finding ...
Lian Duan, William Nick Street
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
13 years 6 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
13 years 8 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong