A unified view of rank-based decision combination

Date

2000-12-01

Author

Saranlı, Afşar
Demirekler, Mübeccel

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

39
views

0
downloads

Cite This

This study presents a theoretical investigation of the rank-based multiple classifier decision problem for closed-set pattern classification. The case with classifier raw outputs in the form of candidate class rankings is considered and formulated as a discrete optimization problem with the objective function being the total probability of correct decision. The problem has a global optimum solution but is of prohibitive dimensionality. We present a partitioning formalism under which this dimensionality can be reduced by incorporating our prior knowledge about the problem domain and the structure of the training data. The formalism can effectively explain a number of rank-based combination approaches successfully used in the literature one of which is discussed. © 2000 IEEE.

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=34147184491&origin=inward
https://hdl.handle.net/11511/112575

Collections

Department of Electrical and Electronics Engineering, Article