Mixed Group Ranks is a parametric method for combining rank based classifiers that is effective for many-class problems. Its parametric structure combines qualities of voting methods with best rank approaches. In [1] the parameters of MGR were estimated using a logistic loss function. In this paper we describe how MGR can be cast as a probability model. In particular we show that using an exponential probability model, an algorithm for efficient maximum likelihood estimation of its parameters can be devised. While casting MGR as an exponential probability model offers provable asymptotic properties (consistency), the interpretability of probabilities allows for flexiblity and natural integration of MGR mixture models. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Melnik, O., Vardi, Y., & Zhang, C. H. (2005). A probability model for combining ranks. In Lecture Notes in Computer Science (Vol. 3541, pp. 64–73). Springer Verlag. https://doi.org/10.1007/11494683_7
Mendeley helps you to discover research relevant for your work.