263 search results - page 12 / 53 » kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets |
KDD
2004
ACM
15 years 10 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...
103
click to vote
PKDD
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
HICSS
2006
IEEE
15 years 3 months ago
2006
IEEE
Real-time frequent pattern mining for business intelligence systems are currently in the focal area of research. In a number of areas of doing business, especially in the arena of...
ICDM
2007
IEEE
15 years 3 months ago
2007
IEEE
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...