Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Potharst, Rob | Bioch, Jan C.
Affiliations: Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands
Abstract: In many classification problems the domains of the attributes and the classes are linearly ordered. For such problems the classification rule often needs to be order-preserving or monotonic as we call it. Since the known decision tree methods generate non-monotonic trees, these methods are not suitable for monotonic classification problems. We provide an order-preserving tree-generation algorithm for multi-attribute classification problems with k linearly ordered classes, and an algorithm for repairing non-monotonic decision trees. The performance of these algorithms is tested on a real-world financial dataset and on random monotonic datasets.
Keywords: classification, ordinal data, decision tree
DOI: 10.3233/IDA-2000-4202
Journal: Intelligent Data Analysis, vol. 4, no. 2, pp. 97-111, 2000
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]