121 search results - page 13 / 25 » An Efficient Frequent Pattern Mining Method and its Parallel... |
ICDM
2002
IEEE
14 years 17 days ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
KDD
2007
ACM
14 years 1 months ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
SPAA
1997
ACM
13 years 11 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
HICSS
2003
IEEE
14 years 27 days 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, ...