Sciweavers

23 search results - page 4 / 5
» DCI Closed: A Fast and Memory Efficient Algorithm to Mine Fr...
Sort
View
CIKM
2009
Springer
13 years 8 months ago
Efficient itemset generator discovery over a stream sliding window
Mining generator patterns has raised great research interest in recent years. The main purpose of mining itemset generators is that they can form equivalence classes together with...
Chuancong Gao, Jianyong Wang
ICDM
2010
IEEE
201views Data Mining» more  ICDM 2010»
13 years 2 months ago
Mining Closed Strict Episodes
Discovering patterns in a sequence is an important aspect of data mining. One popular choice of such patterns are episodes, patterns in sequential data describing events that often...
Nikolaj Tatti, Boris Cule
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 4 months ago
Faster Algorithms for Constructing a Concept (Galois) Lattice
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
Vicky Choi
KAIS
2008
114views more  KAIS 2008»
13 years 4 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
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