Sciweavers

Share
DAWAK
2010
Springer

Mining Non-redundant Information-Theoretic Dependencies between Itemsets

8 years 9 months ago
Mining Non-redundant Information-Theoretic Dependencies between Itemsets
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 theoretically investigated, and we present both lossless and lossy pruning techniques. An efficient and scalable algorithm is proposed, which exploits the inclusion-exclusion principle for fast entropy computation. This algorithm is empirically evaluated through experiments on synthetic and real-world data.
Michael Mampaey
Added 10 Feb 2011
Updated 10 Feb 2011
Type Journal
Year 2010
Where DAWAK
Authors Michael Mampaey
Comments (0)
books