CSDL Home IEEE Transactions on Knowledge & Data Engineering 1999 vol.11 Issue No.05 - September/October
Issue No.05 - September/October (1999 vol.11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.806938
<p><b>Abstract</b>—In most data-mining applications where induction is used as the primary tool for knowledge extraction from real-world databases, it is difficult to precisely identify a complete set of relevant attributes. This paper introduces a new rule induction algorithm called Rule Induction Two In One (RITIO), which eliminates attributes in the order of decreasing irrelevancy. Like ID3-like decision tree construction algorithms, RITIO makes use of the entropy measure as a means of constraining the hypothesis search space; but, unlike ID3-like algorithms, the hypotheses language is the rule structure and RITIO generates rules without constructing decision trees. The final concept description produced by RITIO is shown to be largely based on only the most relevant attributes. Experimental results confirm that, even on noisy, industrial databases, RITIO achieves high levels of predictive accuracy.</p>
Data mining, rule induction, attribute selection, information entropy.
Xindong Wu, David Urpani, "Induction By Attribute Elimination", IEEE Transactions on Knowledge & Data Engineering, vol.11, no. 5, pp. 805-812, September/October 1999, doi:10.1109/69.806938