TY  - JOUR
T1  - Learning Classification Rules under Multiple Costs
AU - , Ni Ailing AU - , Shujie Yang AU - , Xiaofeng Zhu AU - , Shichao Zhang 
JO  - Asian Journal of Information Technology
VL  - 4
IS  - 11
SP  - 1080
EP  - 1085
PY  - 2005
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2005.1080.1085
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2005.1080.1085
KW  - Classification rules
KW  -absent data
KW  -selecting attributes
AB  - Fully taking into account the hints possibly hidden in the absent data, this paper proposes a new criterion when selecting attributes for splitting to build a decision tree for a given dataset. In our approach, it must pay a certain cost to obtain an attribute value. We also consider discounts in test costs when groups of attributes are tested together. When consumer offers finite resources, we can make the best use of the resources as well as optimal results obtained by the tree. In addition, we also put forward advice about whether it is worthy of increasing resources or not.
ER  -