Abstract
This paper presents a new family of decision list induction algorithms based on ideas from the association rule mining context. ART, which stands for 'Association Rule Tree', builds decision lists that can be viewed as degenerate, polythetic decision trees. Our method is a generalized "Separate and Conquer" algorithm suitable for Data Mining applications because it makes use of efficient and scalable association rule mining techniques.
Original language | English |
---|---|
Pages (from-to) | 67-92 |
Number of pages | 26 |
Journal | Machine Learning |
Volume | 54 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jan 2004 |
Externally published | Yes |
Keywords
- Association rules
- Classification
- Data Mining
- Decision lists
- Decision trees
- Supervised learning