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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Entropy (Basel, Switzerland) Ročník 21; číslo 5; s. 440
Hlavní autori:	Vigneron, Vincent, Maaref, Hichem
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel MDPI AG 01.05.2019 MDPI
Predmet:	aggregation Algorithms binary linear programming cervical cancer classifier combination Classifiers Cytology data fusion Decision making Decision theory Decisions Engineering Sciences HPV independence Linear programming mutual information Optimization plurality voting Probability rank Ranking Signal and Image processing total order Aggregation Plurality voting Classifier combination Binary linear programming Total order Independence Data fusion Rank Mutual information Cervical cancer HPV
ISSN:	1099-4300, 1099-4300
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!