Learning Decision Tree Classifiers from Attribute Value Taxonomies and Partially Specified Data

Proceedings, Twentieth International Conference on Machine Learning

Volumn 2, Issue , 2003, Pages 880-887

  Zhang, Jun ^a   Honavar, Vasant ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; COLOR; DATA MINING; DECISION THEORY; LEARNING SYSTEMS; PROBLEM SOLVING; TREES (MATHEMATICS);

DECISION TREE; PARTIALLY MISSING VALUES; PARTIALLY SPECIFIED DATA; TAXONOMY;

COMPUTER SCIENCE;

EID: 1942451927     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Almuallim H., Akiba, Y. & Kaneda, S. (1995). On Handling Tree-Structured Attributes. In: Proceedings of the Twelfth International Conference on Machine Learning, pp. 12-20. Morgan Kaufmann.
2. Chen, A.L.P. & Tseng, F.S.C. (1996). Evaluating aggregate operations over imprecise data. IEEE Transactions on Knowledge and Data Engineering, 8, 273-284.
3. Chen, J., Shapcott, M., McClean, S.I. & Adamson, K. (2002). Learning with Concept Hierarchies in Probabilistic Relational Data Mining. In: Proceedings of the Third International Conference on Web Age Information Management. Lecture Notes in Artificial Intelligence 2419: 104-115. Springer-Verlag.
4. Cheung D., Hwang, H.Y., Fu, A. & Han, J. (2000). An Efficient Rule-based Attribute-Oriented Induction for Data Mining. J. Intelligent Information Systems 15: 175-200
5. Cohen, W. (1996). Learning Trees and Rules with Set-valued Features. In. Proceedings of the Thirteenth National Conference on Artificial Intelligence, pp. 709-716. AAAI Press.
6. DeMichiel, L.G. (1989). Resolving database incompatibility: an approach to performing relational operations over mismatched domains. IEEE Transactions on Knowledge and Data Engineering, 4, 485-493.
7. desJardins, M., Getoor, L. & Koller, D. (2000). Using Feature Hierarchies in Bayesian Network Learning. In: Proceedings of the Symposium on Abstraction, Reformulation, Approximation. Lecture Notes in Artificial Intelligence 1864: 260-270. Springer-Verlag
8. Dhar, V. & Tuzhilin, A. (1993). Abstract-Driven Pattern Discovery in Databases. IEEE Transactions on Knowledge and Data Engineering 5: 926-938.
9. Duda, R., Hart, P. & Stork, D. (2000). Pattern Classification New York: Wiley.
10. Han, J. & Fu, Y. (1996). Exploration of the Power of Attribute-Oriented Induction in Data Mining. U.M. Fayyad, et. al. (eds.), Advances in Knowledge Discovery and Data Mining. MIT Press.
11. McClean, S.I., Scotney, B.W. & Shapcott, M. (2001). Aggregation of Imprecise and Uncertain Information in Databases. IEEE Transcactions on Knowledge and Data Engineering 13: 902-912
12. Núñez, M. (1991). The Use of Background Knowledge in Decision Tree Induction. Machine Learning 6:231-250.
13. Pereira, F., Tishby, N. & Lee, L. (1993). Distributional clustering of English words. In: Proceedings of the Thirty-first Annual Meeting of the Association for Computational Linguistics, pp. 183-190.
14. Quinlan, J. R. (1992). C4.5: Programs for machine learning. San Mateo, CA: Morgan Kaufmann (1992)
15. Taylor, M., Stoffel, K. & Hendler, J. (1997). Ontology-based Induction of High Level Classification Rules. In: SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery.
16. Yamazaki, T., Pazzani, M. & Merz, C. (1995). Learning Hierarchies from Ambiguous Natural Language Data. In: Proceedings of the Twelfth International Conference on Machine Learning, pp. 329-342. Morgan-Kaufmann.
17. Zhang, J., Silvescu, A. & Honavar, V. (2002). Ontology-Driven Induction of Decision Trees at Multiple Levels of Abstraction. In: Proceedings of the Symposium on Abstraction, Reformulation, and Approximation. Lecture Notes in Artificial Intelligence 2371: 316-323 Springer-Verlag.