{"language":[{"iso":"eng"}],"publication":"Machine Learning","type":"journal_article","date_updated":"2022-01-06T06:59:14Z","year":"2018","status":"public","author":[{"full_name":"Melnikov, Vitalik","last_name":"Melnikov","first_name":"Vitalik"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"publication_identifier":{"issn":["1573-0565"]},"department":[{"_id":"355"}],"title":"On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis","_id":"3402","citation":{"ieee":"V. Melnikov and E. Hüllermeier, “On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis,” <i>Machine Learning</i>, 2018.","ama":"Melnikov V, Hüllermeier E. On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis. <i>Machine Learning</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s10994-018-5733-1\">10.1007/s10994-018-5733-1</a>","mla":"Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics for Learning Nested Dichotomies: An Empirical Analysis.” <i>Machine Learning</i>, 2018, doi:<a href=\"https://doi.org/10.1007/s10994-018-5733-1\">10.1007/s10994-018-5733-1</a>.","apa":"Melnikov, V., &#38; Hüllermeier, E. (2018). On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis. <i>Machine Learning</i>. <a href=\"https://doi.org/10.1007/s10994-018-5733-1\">https://doi.org/10.1007/s10994-018-5733-1</a>","bibtex":"@article{Melnikov_Hüllermeier_2018, title={On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis}, DOI={<a href=\"https://doi.org/10.1007/s10994-018-5733-1\">10.1007/s10994-018-5733-1</a>}, journal={Machine Learning}, author={Melnikov, Vitalik and Hüllermeier, Eyke}, year={2018} }","chicago":"Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics for Learning Nested Dichotomies: An Empirical Analysis.” <i>Machine Learning</i>, 2018. <a href=\"https://doi.org/10.1007/s10994-018-5733-1\">https://doi.org/10.1007/s10994-018-5733-1</a>.","short":"V. Melnikov, E. Hüllermeier, Machine Learning (2018)."},"user_id":"15504","ddc":["000"],"doi":"10.1007/s10994-018-5733-1","file":[{"relation":"main_file","access_level":"closed","content_type":"application/pdf","file_size":1482882,"creator":"ups","date_created":"2018-11-02T15:30:57Z","date_updated":"2018-11-02T15:30:57Z","success":1,"file_name":"OnTheEffectivenessOfHeuristics.pdf","file_id":"5305"}],"project":[{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901","_id":"1"}],"has_accepted_license":"1","abstract":[{"text":"In machine learning, so-called nested dichotomies are utilized as a reduction technique, i.e., to decompose a multi-class classification problem into a set of binary problems, which are solved using a simple binary classifier as a base learner. The performance of the (multi-class) classifier thus produced strongly depends on the structure of the decomposition. In this paper, we conduct an empirical study, in which we compare existing heuristics for selecting a suitable structure in the form of a nested dichotomy. Moreover, we propose two additional heuristics as natural completions. One of them is the Best-of-K heuristic, which picks the (presumably) best among K randomly generated nested dichotomies. Surprisingly, and in spite of its simplicity, it turns out to outperform the state of the art.","lang":"eng"}],"file_date_updated":"2018-11-02T15:30:57Z","date_created":"2018-06-29T07:44:26Z"}