Sciweavers

113 search results - page 13 / 23
» Efficient Discovery of Frequent Approximate Sequential Patte...
Sort
View
SDM
2003
SIAM
110views Data Mining» more  SDM 2003»
13 years 9 months ago
Mixture Models and Frequent Sets: Combining Global and Local Methods for 0-1 Data
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
Jaakko Hollmén, Jouni K. Seppänen, Hei...
KDD
2005
ACM
170views Data Mining» more  KDD 2005»
14 years 8 months ago
Parallel mining of closed sequential patterns
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...
Shengnan Cong, Jiawei Han, David A. Padua
KDD
2004
ACM
144views Data Mining» more  KDD 2004»
14 years 8 months ago
IncSpan: incremental mining of sequential patterns in large database
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
Hong Cheng, Xifeng Yan, Jiawei Han
ECCV
2008
Springer
14 years 9 months ago
Deformed Lattice Discovery Via Efficient Mean-Shift Belief Propagation
We introduce a novel framework for automatic detection of repeated patterns in real images. The novelty of our work is to formulate the extraction of an underlying deformed lattice...
Minwoo Park, Robert T. Collins, Yanxi Liu
ENC
2004
IEEE
13 years 11 months ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...