732 search results - page 13 / 147 » Efficient Frequent Pattern Mining in Relational Databases |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Research in relational data mining has two major directions: finding global models of a relational database and the discovery of local relational patterns within a database. While...
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
Multi-core processors are proliferated across different domains in recent years. In this paper, we study the performance of frequent pattern mining on a modern multi-core machine....
KDD
2002
ACM
14 years 8 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
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...