252 search results - page 9 / 51 » Mining Frequent Patterns without Candidate Generation |
SAC
2008
ACM
13 years 7 months ago
2008
ACM
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We propose a novel representative based subgraph mining model. A series of standards and methods are proposed to select invariants. Patterns are mapped into invariant vectors in...
HICSS
2003
IEEE
14 years 1 months ago
2003
IEEE
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
In constrained data mining, users can specify constraints that can be used to prune the search space to avoid mining uninteresting knowledge. Since it is difficult to determine th...