# On classification, ranking, and probability estimation

 Title On classification, ranking, and probability estimation Publication Type Books Year of Publication 2008 Authors Flach P, Matsubara ET, De Raedt L, Dietterich T, Getoor L, Kersting K, Muggleton SH Publisher Internationales Begegnungs- und Forschungszentrum fur Informatik (IBFI), Schloss Dagstuhl, Germany Abstract Given a binary classification task, a ranker is an algorithm that can sort a set of instances from highest to lowest expectation that the instance is positive. In contrast to a classifier, a ranker does not output class predictions Ã¢â‚¬â€œ although it can be turned into a classifier with help of an additional procedure to split the ranked list into two. A straightforward way to compute rankings is to train a scoring classifier to assign numerical scores to instances, for example the predicted odds that an instance is positive. However, rankings can be computed without scores, as we demonstrate in this paper. We propose a lexicographic ranker, LexRank , whose rankings are derived not from scores, but from a simple ranking of attribute values obtained from the training data. Although various metrics can be used, we show that by using the odds ratio to rank the attribute values we obtain a ranker that is conceptually close to the naive Bayes classifier, in the sense that for every instance of LexRank there exists an instance of naive Bayes that achieves the same ranking. However, the reverse is not true, which means that LexRank is more biased than naive Bayes. We systematically develop the relationships and differences between classification, ranking, and probability estimation, which leads to a novel connection between the Brier score and ROC curves. Combining LexRank with isotonic regression, which derives probability estimates from the ROC convex hull, results in the lexicographic probability estimator LexProb.
{"ft_lang_label":"__label__en","ft_lang_prob":0.8794367,"math_prob":0.8121523,"size":1925,"snap":"2020-45-2020-50","text_gpt3_token_len":401,"char_repetition_ratio":0.12961999,"word_repetition_ratio":0.0068965517,"special_character_ratio":0.18337663,"punctuation_ratio":0.11411411,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96362174,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-25T10:51:45Z\",\"WARC-Record-ID\":\"<urn:uuid:c9da337a-0f60-4f3b-81ce-4b642dbc4092>\",\"Content-Length\":\"24316\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b71251df-8fbf-433b-83b9-884ed75734fb>\",\"WARC-Concurrent-To\":\"<urn:uuid:bdaa38ef-c549-4725-8ded-fe37258762e4>\",\"WARC-IP-Address\":\"128.8.120.33\",\"WARC-Target-URI\":\"https://www.umiacs.umd.edu/publications/classification-ranking-and-probability-estimation\",\"WARC-Payload-Digest\":\"sha1:V3IXF4E4QNFGKKBACIFS3XVRWKA4QRBI\",\"WARC-Block-Digest\":\"sha1:3EMIUD7MTTMDUYLIBMDDK5FDPJDMGPR5\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107888931.67_warc_CC-MAIN-20201025100059-20201025130059-00513.warc.gz\"}"}