Rule induction with CN2: some recent improvements
EWSL-91 Proceedings of the European working session on learning on Machine learning
C4.5: programs for machine learning
C4.5: programs for machine learning
Machine Learning
A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Data preparation for data mining
Data preparation for data mining
Classification by pairwise coupling
NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
Separate-and-Conquer Rule Learning
Artificial Intelligence Review
A simple, fast, and effective rule learner
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Data mining: practical machine learning tools and techniques with Java implementations
Data mining: practical machine learning tools and techniques with Java implementations
Improved Boosting Algorithms Using Confidence-rated Predictions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
A Simple Approach to Ordinal Classification
EMCL '01 Proceedings of the 12th European Conference on Machine Learning
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Using output codes to boost multiclass learning problems
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
On the Decomposition of Polychotomies into Dichotomies
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Winning the KDD99 classification cup: bagged boosting
ACM SIGKDD Explorations Newsletter
Reducing multiclass to binary: a unifying approach for margin classifiers
The Journal of Machine Learning Research
The Journal of Machine Learning Research
Solving multiclass learning problems via error-correcting output codes
Journal of Artificial Intelligence Research
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A comparison of methods for multiclass support vector machines
IEEE Transactions on Neural Networks
MIR '03 Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval
Evaluating indirect and direct classification techniques for network intrusion detection
Intelligent Data Analysis
Intelligent Data Analysis
Comparing Combination Rules of Pairwise Neural Networks Classifiers
Neural Processing Letters
Troika - An improved stacking schema for classification tasks
Information Sciences: an International Journal
Does SVM really scale up to large bag of words feature spaces?
IDA'07 Proceedings of the 7th international conference on Intelligent data analysis
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
Classification by cluster analysis: a new meta-learning based approach
MCS'11 Proceedings of the 10th international conference on Multiple classifier systems
Time-Space ensemble strategies for automatic music genre classification
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Ensemble learning based on multi-task class labels
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
On the behavior of SVM and some older algorithms in binary text classification tasks
TSD'06 Proceedings of the 9th international conference on Text, Speech and Dialogue
Hi-index | 0.00 |
In this paper we investigate the performance of pairwise (or round robin) classification, originally a technique for turning multi-class problems into two-class problems, as a general ensemble technique. In particular, we show that the use of round robin ensembles will also increase the classification performance of decision tree learners, even though they can directly handle multi-class problems. The performance gain is not as large as for bagging and boosting, but on the other hand round robin ensembles have a clearly defined semantics. Furthermore, we show that the advantage of pairwise classification over direct multi-class classification and one-against-all binarization increases with the number of classes, and that round robin ensembles form an interesting alternative for problems with ordered class values.