<em>M</em>-ary Rank Classifier Combination: A Binary Linear Programming Problem

<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...

Full description

Bibliographic Details
Main Authors: Vincent Vigneron, Hichem Maaref
Format: Article
Language:English
Published: MDPI AG 2019-04-01
Series:Entropy
Subjects:
classifier combination
rank
aggregation
total order
independence
data fusion
mutual information
plurality voting
binary linear programming
cervical cancer
HPV
Online Access:https://www.mdpi.com/1099-4300/21/5/440

Internet

https://www.mdpi.com/1099-4300/21/5/440

Similar Items