Automatic Classifier Selection Based on Classification Complexity
Pages 292 - 303
Abstract
Choosing a proper classifier for one specific data set is important in practical application. Automatic classifier selection (CS) aims to recommend the most suitable classifiers to a new data set based on the similarity with the historical data sets. The key step of CS is the extraction of data set feature. This paper proposes a novel data set feature that characterizes the classification complexity of problems, which has a close connection with the performance of classifiers. We highlight two contributions of our work: firstly, our feature can be computed in a low time complexity; secondly, we theoretically show that our feature has connection with generalization errors of some classifiers. Empirical results indicate that our feature is more effective and efficient than the existing data set features.
References
[1]
Wolpert DH The lack of a priori distinction between learning algorithms Neural Comput. 1996 8 7 1341-1390
[2]
Maciá N, Bernadó-Mansilla E, Orriols-Puig A, and Kam HT Learner excellence biased by data set selection: a case for data characterisation and artificial data sets Pattern Recogn. 2013 46 3 1054-1066
[3]
Cernadas E and Amorim D Do we need hundreds of classifiers to solve real world classification problems? J. Mach. Learn. Res. 2014 15 1 3133-3181
[4]
Bernado-Mansilla E and Ho TK Domain of competence of XCS classifier system in complexity measurement space IEEE Trans. Evol. Comput. 2008 9 1 82-104
[5]
Peng Y, Flach PA, Soares C, and Brazdil P Lange S, Satoh K, and Smith CH Improved dataset characterisation for meta-learning Discovery Science 2002 Heidelberg Springer 141-152
[6]
Pfahringer, B., Bensusan, H., Giraud-Carrier, C.G.: Meta-learning by landmarking various learning algorithms. In: Seventeenth International Conference on Machine Learning, vol. 11, no. 9, pp. 743–750. Morgan Kaufmann Publishers Inc. (2000)
[7]
Song Q, Wang G, and Wang C Automatic recommendation of classification algorithms based on data set characteristics Pattern Recogn. 2012 45 7 2672-2689
[8]
Wang G, Song Q, and Zhu X An improved data characterization method and its application in classification algorithm recommendation Appl. Intell. 2015 43 4 892-912
[9]
Kotthoff L Bessiere C, De Raedt L, Kotthoff L, Nijssen S, O’Sullivan B, and Pedreschi D Algorithm selection for combinatorial search problems: a survey Data Mining and Constraint Programming 2016 Cham Springer 149-190
[10]
Kalousis A and Theoharis T NOEMON: design, implementation and performance results of an intelligent assistant for classifier selection Intell. Data Anal. 1999 3 5 319-337
[11]
Ho TK and Basu M Complexity measures of supervised classification problems IEEE Trans. Pattern Anal. Mach. Intell. 2002 24 3 289-300
[12]
Cano JR Analysis of data complexity measures for classification Expert Syst. Appl. 2013 40 12 4820-4831
[13]
Cortes C, Mohri M, and Rostamizadeh A Algorithms for learning kernels based on centered alignment J. Mach. Learn. Res. 2012 13 2 795-828
[14]
Nguyen CH and Tu BH An efficient kernel matrix evaluation measure Pattern Recogn. 2008 41 11 3366-3372
[15]
Chudzian P Evaluation measures for kernel optimization Pattern Recogn. Lett. 2012 33 9 1108-1116
[16]
Demšar J Statistical comparisons of classifiers over multiple data sets J. Mach. Learn. Res. 2006 7 1 1-30
Recommendations
Classifier selection using geometry preserving feature
AbstractThe selection of proper classifiers for a given data set is full of challenges. The critical problem of classifier selection is how to extract feature from data sets. This paper proposes a new method for feature extraction of a data set. Our ...
An efficient ensemble classification method based on novel classifier selection technique
WIMS '12: Proceedings of the 2nd International Conference on Web Intelligence, Mining and SemanticsIndividual classification models have recently been challenged by ensemble of classifiers, also known as multiple classifier system, which often shows better classification accuracy. In terms of merging the outputs of an ensemble of classifiers, ...
Chinese text classification by the Naïve Bayes Classifier and the associative classifier with multiple confidence threshold values
Each type of classifier has its own advantages as well as certain shortcomings. In this paper, we take the advantages of the associative classifier and the Naive Bayes Classifier to make up the shortcomings of each other, thus improving the accuracy of ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Nov 2018
611 pages
ISBN:978-3-030-03337-8
DOI:10.1007/978-3-030-03338-5
© Springer Nature Switzerland AG 2018.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 23 November 2018
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Nov 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in