Model trees for classification of hybrid data types

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the task of classification, most learning methods are suitable only for certain data types. For the hybrid dataset consists of nominal and numeric attributes, to apply the learning algorithms, some attributes must be transformed into the appropriate types. This procedure could damage the nature of dataset. We propose a model tree approach to integrate several characteristically different learning methods to solve the classification problem. We employ the decision tree as the classification framework and incorporate support vector machines into the tree construction process. This design removes the discretization procedure usually necessary for tree construction while decision tree induction itself can deal with nominal attributes which may not be handled well by e.g., SVM methods. Experiments show that our purposed method has better performance than that of other competing learning methods. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Pao, H. K., Chang, S. C., & Lee, Y. J. (2005). Model trees for classification of hybrid data types. In Lecture Notes in Computer Science (Vol. 3578, pp. 32–39). Springer Verlag. https://doi.org/10.1007/11508069_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free