7150 search results - page 629 / 1430 » Graph-Based Data Mining |
199
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
169
click to vote
ICDM
2002
IEEE
16 years 4 days ago
2002
IEEE
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
219
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
Feature selection is an important task in effective data mining. A new challenge to feature selection is the so-called “small labeled-sample problem” in which labeled data is...
173
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
In many applications, association rules will only be interesting if they represent non-trivial correlations between all constituent items. Numerous techniques have been developed ...
182
click to vote
KDD
2004
ACM
16 years 7 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...