Affiliation:
1. Universitat Politècnica de Catalunya
Abstract
Some existing notions of redundancy among association rules allow for a logical-style characterization and lead to irredundant bases of absolutely minimum size. We push the intuition of redundancy further to find an intuitive notion of novelty of an association rule, with respect to other rules. Namely, an irredundant rule is so because its confidence is higher than what the rest of the rules would suggest; then, one can ask: how much higher?
We propose to measure such a sort of novelty through the
confidence boost
of a rule. Acting as a complement to confidence and support, the confidence boost helps to obtain small and crisp sets of mined association rules and solves the well-known problem that, in certain cases, rules of negative correlation may pass the confidence bound. We analyze the properties of two versions of the notion of confidence boost, one of them a natural generalization of the other. We develop algorithms to filter rules according to their confidence boost, compare the concept to some similar notions in the literature, and describe the results of some experimentation employing the new notions on standard benchmark datasets. We describe an open source association mining tool that embodies one of our variants of confidence boost in such a way that the data mining process does not require the user to select any value for any parameter.
Funder
Ministerio de Ciencia e Innovación
Pascal-2 Network of the European Union
Publisher
Association for Computing Machinery (ACM)
Reference53 articles.
1. A new approach to online generation of association rules
2. Agrawal R. Mannila H. Srikant R. Toivonen H. and Verkamo A. I. 1996. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press 307--328. Agrawal R. Mannila H. Srikant R. Toivonen H. and Verkamo A. I. 1996. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press 307--328.
3. Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献