Back to Search
Start Over
Integration of Decision Trees Using Distance to Centroid and to Decision Boundary
- Source :
- Journal of Universal Computer Science, Vol 26, Iss 6, Pp 720-733 (2020), JUCS-Journal of Universal Computer Science 26(6): 720-733
- Publication Year :
- 2020
- Publisher :
- Graz University of Technology, 2020.
-
Abstract
- Plethora of ensemble techniques have been implemented and studied in order to achieve better classification results than base classifiers. In this paper an algorithm for integration of decision trees is proposed, which means that homogeneous base classifiers will be used. The novelty of the presented approach is the usage of the simultaneous distance of the object from the decision boundary and the center of mass of objects belonging to one class label in order to determine the score functions of base classifiers. This means that the score function assigned to the class label by each classifier depends on the distance of the classified object from the decision boundary and from the centroid. The algorithm was evaluated using an open-source benchmarking dataset. The results indicate an improvement in the classification quality in comparison to the referential method - majority voting method.
- Subjects :
- classifier integration
General Computer Science
Computer science
Decision tree
Centroid
QA75.5-76.95
computer.software_genre
classifier integrat
Theoretical Computer Science
ComputingMethodologies_PATTERNRECOGNITION
ensemble of classifiers
Electronic computers. Computer science
Decision boundary
Data mining
computer
distance to decision boundary
Subjects
Details
- Language :
- English
- ISSN :
- 09486968
- Volume :
- 26
- Issue :
- 6
- Database :
- OpenAIRE
- Journal :
- Journal of Universal Computer Science
- Accession number :
- edsair.doi.dedup.....ef28e3f759b63d2cc4efedc5508fada7