38 search results - page 3 / 8 » Mining Association Rules in Graphs Based on Frequent Cohesiv... |
KDD
2004
ACM
14 years 6 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...
KAIS
2006
13 years 6 months ago
2006
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
DAWAK
2010
Springer
13 years 7 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
DSS
2006
13 years 6 months ago
2006
Classification is one of the key issues in the fields of decision sciences and knowledge discovery. This paper presents a new approach for constructing a classifier, based on an e...
KDD
1997
ACM
13 years 9 months ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...