155 search results - page 9 / 31 » An efficient algorithm for mining closed inter-transaction i... |
DKE
2007
14 years 9 months ago
2007
A well-known problem that limits the practical usage of association rule mining algorithms is the extremely large number of rules generated. Such a large number of rules makes the...
ISCI
2008
14 years 9 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
81
Voted
DAWAK
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We present an information-theoretic framework for mining dependencies between itemsets in binary data. The problem of closure-based redundancy in this context is theoreti...
72
Voted
KDD
2004
ACM
15 years 9 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...
PAKDD
2010
ACM
14 years 11 months ago
2010
ACM
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...