<em>M</em>-ary Rank Classifier Combination: A Binary Linear Programming Problem
The goal of classifier combination can be briefly stated as combining the decisions of individual classifiers to obtain a better classifier. In this paper, we propose a method based on the combination of weak rank classifiers because rankings contain more information than unique choices for a many-c...
Main Authors: | Vincent Vigneron, Hichem Maaref |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-04-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/21/5/440 |
Similar Items
-
Approval voting /
by: 186826 Brams, Steven J., et al.
Published: (2007) -
Editor’s Introduction: The Promise and Peril of Ranked Choice Voting
by: Caroline J. Tolbert, et al.
Published: (2021-06-01) -
Adaptive Combinational Web Ranking Algorithm Using Coarse-grained and Fine-grained Features
by: Ali Mohammad Zareh Bidoki, et al.
Published: (2009-12-01) -
Sensor Failure Tolerable Machine Learning-Based Food Quality Prediction Model
by: Aydin Kaya, et al.
Published: (2020-06-01) -
Automatic Sleep Stages Detection Based on EEG Signals Using Combination of Classifiers
by: R. Kianzad, et al.
Published: (2013-07-01)