[{"language":[{"iso":"eng"}],"oa":"1","doi":"10.1145/3205455.3205562","date_updated":"2022-01-06T06:54:45Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"publication_status":"published","department":[{"_id":"355"}],"title":"Ensembles of Evolved Nested Dichotomies for Classification","place":"Kyoto, Japan","type":"conference","year":"2018","citation":{"chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Ensembles of Evolved Nested Dichotomies for Classification.” In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018. Kyoto, Japan: ACM, 2018. https://doi.org/10.1145/3205455.3205562.","ama":"Wever MD, Mohr F, Hüllermeier E. Ensembles of Evolved Nested Dichotomies for Classification. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018. Kyoto, Japan: ACM; 2018. doi:10.1145/3205455.3205562","apa":"Wever, M. D., Mohr, F., & Hüllermeier, E. (2018). Ensembles of Evolved Nested Dichotomies for Classification. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018. Kyoto, Japan: ACM. https://doi.org/10.1145/3205455.3205562","bibtex":"@inproceedings{Wever_Mohr_Hüllermeier_2018, place={Kyoto, Japan}, title={Ensembles of Evolved Nested Dichotomies for Classification}, DOI={10.1145/3205455.3205562}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018}, publisher={ACM}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }","mla":"Wever, Marcel Dominik, et al. “Ensembles of Evolved Nested Dichotomies for Classification.” Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, ACM, 2018, doi:10.1145/3205455.3205562.","short":"M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, ACM, Kyoto, Japan, 2018.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Ensembles of Evolved Nested Dichotomies for Classification,” in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, Kyoto, Japan, 2018."},"main_file_link":[{"url":"https://dl.acm.org/citation.cfm?doid=3205455.3205562","open_access":"1"}],"_id":"2109","conference":{"end_date":"2018-07-19","name":"GECCO 2018","start_date":"2018-07-15","location":"Kyoto, Japan"},"status":"public","has_accepted_license":"1","date_created":"2018-03-31T13:51:23Z","file":[{"file_size":875404,"creator":"ups","file_id":"5275","date_updated":"2018-11-02T14:33:54Z","content_type":"application/pdf","relation":"main_file","success":1,"file_name":"p561-wever.pdf","date_created":"2018-11-02T14:33:54Z","access_level":"closed"}],"author":[{"last_name":"Wever","id":"33176","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik"},{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"}],"publisher":"ACM","keyword":["Classification","Hierarchical Decomposition","Indirect Encoding"],"file_date_updated":"2018-11-02T14:33:54Z","publication":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018","user_id":"33176","ddc":["000"],"abstract":[{"lang":"eng","text":"In multinomial classification, reduction techniques are commonly used to decompose the original learning problem into several simpler problems. For example, by recursively bisecting the original set of classes, so-called nested dichotomies define a set of binary classification problems that are organized in the structure of a binary tree. In contrast to the existing one-shot heuristics for constructing nested dichotomies and motivated by recent work on algorithm configuration, we propose a genetic algorithm for optimizing the structure of such dichotomies. A key component of this approach is the proposed genetic representation that facilitates the application of standard genetic operators, while still supporting the exchange of partial solutions under recombination. We evaluate the approach in an extensive experimental study, showing that it yields classifiers with superior generalization performance."}]},{"year":"2018","type":"preprint","citation":{"ama":"Wever MD, Mohr F, Hüllermeier E. Automated Multi-Label Classification based on ML-Plan. Published online 2018.","apa":"Wever, M. D., Mohr, F., & Hüllermeier, E. (2018). Automated Multi-Label Classification based on ML-Plan. Arxiv.","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Automated Multi-Label Classification Based on ML-Plan.” Arxiv, 2018.","bibtex":"@article{Wever_Mohr_Hüllermeier_2018, title={Automated Multi-Label Classification based on ML-Plan}, publisher={Arxiv}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }","mla":"Wever, Marcel Dominik, et al. Automated Multi-Label Classification Based on ML-Plan. Arxiv, 2018.","short":"M.D. Wever, F. Mohr, E. Hüllermeier, (2018).","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Automated Multi-Label Classification based on ML-Plan.” Arxiv, 2018."},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/1811.04060.pdf"}],"oa":"1","_id":"17713","date_updated":"2022-01-06T06:53:17Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"date_created":"2020-08-07T11:38:10Z","status":"public","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"author":[{"first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","last_name":"Wever","id":"33176"},{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"}],"publisher":"Arxiv","title":"Automated Multi-Label Classification based on ML-Plan","user_id":"5786"},{"oa":"1","date_updated":"2022-01-06T06:53:17Z","_id":"17714","year":"2018","citation":{"mla":"Mohr, Felix, et al. Automated Machine Learning Service Composition. 2018.","bibtex":"@article{Mohr_Wever_Hüllermeier_2018, title={Automated machine learning service composition}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018} }","apa":"Mohr, F., Wever, M. D., & Hüllermeier, E. (2018). Automated machine learning service composition.","ama":"Mohr F, Wever MD, Hüllermeier E. Automated machine learning service composition. Published online 2018.","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “Automated Machine Learning Service Composition,” 2018.","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “Automated machine learning service composition.” 2018.","short":"F. Mohr, M.D. Wever, E. Hüllermeier, (2018)."},"type":"preprint","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/pdf/1809.00486.pdf","open_access":"1"}],"title":"Automated machine learning service composition","user_id":"5786","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"date_created":"2020-08-07T11:40:13Z","status":"public","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"author":[{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","last_name":"Wever","id":"33176"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"}]},{"user_id":"33176","title":"Ranking of Classification Algorithms in AutoML","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"date_created":"2018-11-15T08:06:41Z","status":"public","department":[{"_id":"355"}],"publisher":"Universität Paderborn","author":[{"full_name":"Graf, Helena","first_name":"Helena","id":"52640","last_name":"Graf"}],"date_updated":"2022-01-06T07:02:35Z","_id":"5693","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"}],"citation":{"apa":"Graf, H. (2018). Ranking of Classification Algorithms in AutoML. Universität Paderborn.","ama":"Graf H. Ranking of Classification Algorithms in AutoML. Universität Paderborn; 2018.","chicago":"Graf, Helena. Ranking of Classification Algorithms in AutoML. Universität Paderborn, 2018.","mla":"Graf, Helena. Ranking of Classification Algorithms in AutoML. Universität Paderborn, 2018.","bibtex":"@book{Graf_2018, title={Ranking of Classification Algorithms in AutoML}, publisher={Universität Paderborn}, author={Graf, Helena}, year={2018} }","short":"H. Graf, Ranking of Classification Algorithms in AutoML, Universität Paderborn, 2018.","ieee":"H. Graf, Ranking of Classification Algorithms in AutoML. Universität Paderborn, 2018."},"type":"bachelorsthesis","year":"2018"},{"_id":"5936","date_updated":"2022-01-06T07:02:47Z","citation":{"short":"M. Scheibl, Learning about Learning Curves from Dataset Properties, Universität Paderborn, 2018.","ieee":"M. Scheibl, Learning about learning curves from dataset properties. Universität Paderborn, 2018.","apa":"Scheibl, M. (2018). Learning about learning curves from dataset properties. Universität Paderborn.","ama":"Scheibl M. Learning about Learning Curves from Dataset Properties. Universität Paderborn; 2018.","chicago":"Scheibl, Manuel. Learning about Learning Curves from Dataset Properties. Universität Paderborn, 2018.","bibtex":"@book{Scheibl_2018, title={Learning about learning curves from dataset properties}, publisher={Universität Paderborn}, author={Scheibl, Manuel}, year={2018} }","mla":"Scheibl, Manuel. Learning about Learning Curves from Dataset Properties. Universität Paderborn, 2018."},"year":"2018","type":"bachelorsthesis","language":[{"iso":"eng"}],"supervisor":[{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"title":"Learning about learning curves from dataset properties","user_id":"477","department":[{"_id":"355"}],"author":[{"last_name":"Scheibl","first_name":"Manuel","full_name":"Scheibl, Manuel"}],"publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"date_created":"2018-11-28T10:29:53Z","status":"public"},{"title":"Preference-Based Reinforcement Learning Using Dyad Ranking","place":"Cham","publication_status":"published","publication_identifier":{"isbn":["9783030017705","9783030017712"],"issn":["0302-9743","1611-3349"]},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"department":[{"_id":"355"}],"doi":"10.1007/978-3-030-01771-2_11","date_updated":"2022-01-06T07:03:04Z","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"49109","date_created":"2018-12-20T15:52:03Z","has_accepted_license":"1","status":"public","publication":"Discovery Science","file_date_updated":"2019-01-11T11:03:50Z","author":[{"last_name":"Schäfer","first_name":"Dirk","full_name":"Schäfer, Dirk"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"}],"publisher":"Springer International Publishing","file":[{"date_created":"2019-01-11T11:03:50Z","file_name":"Schäfer-Hüllermeier2018_Chapter_Preference-BasedReinforcementL.pdf","access_level":"closed","file_size":458972,"file_id":"6623","creator":"ups","date_updated":"2019-01-11T11:03:50Z","content_type":"application/pdf","relation":"main_file","success":1}],"_id":"6423","page":"161-175","year":"2018","citation":{"ieee":"D. Schäfer and E. Hüllermeier, “Preference-Based Reinforcement Learning Using Dyad Ranking,” in Discovery Science, Cham: Springer International Publishing, 2018, pp. 161–175.","short":"D. Schäfer, E. Hüllermeier, in: Discovery Science, Springer International Publishing, Cham, 2018, pp. 161–175.","mla":"Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning Using Dyad Ranking.” Discovery Science, Springer International Publishing, 2018, pp. 161–75, doi:10.1007/978-3-030-01771-2_11.","bibtex":"@inbook{Schäfer_Hüllermeier_2018, place={Cham}, title={Preference-Based Reinforcement Learning Using Dyad Ranking}, DOI={10.1007/978-3-030-01771-2_11}, booktitle={Discovery Science}, publisher={Springer International Publishing}, author={Schäfer, Dirk and Hüllermeier, Eyke}, year={2018}, pages={161–175} }","chicago":"Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning Using Dyad Ranking.” In Discovery Science, 161–75. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-030-01771-2_11.","ama":"Schäfer D, Hüllermeier E. Preference-Based Reinforcement Learning Using Dyad Ranking. In: Discovery Science. Cham: Springer International Publishing; 2018:161-175. doi:10.1007/978-3-030-01771-2_11","apa":"Schäfer, D., & Hüllermeier, E. (2018). Preference-Based Reinforcement Learning Using Dyad Ranking. In Discovery Science (pp. 161–175). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-030-01771-2_11"},"type":"book_chapter"},{"type":"conference_editor","citation":{"short":"S. Abiteboul, M. Arenas, P. Barceló, M. Bienvenu, D. Calvanese, C. David, R. Hull, E. Hüllermeier, B. Kimelfeld, L. Libkin, W. Martens, T. Milo, F. Murlak, F. Neven, M. Ortiz, T. Schwentick, J. Stoyanovich, J. Su, D. Suciu, V. Vianu, K. Yi, eds., Research Directions for Principles of Data Management, 2018.","ieee":"S. Abiteboul et al., Eds., Research Directions for Principles of Data Management, vol. 7, no. 1. 2018, pp. 1–29.","chicago":"Abiteboul, S., M. Arenas, P. Barceló, M. Bienvenu, D. Calvanese, C. David, R. Hull, et al., eds. Research Directions for Principles of Data Management. Vol. 7, 2018.","ama":"Abiteboul S, Arenas M, Barceló P, et al., eds. Research Directions for Principles of Data Management. Vol 7.; 2018:1-29.","apa":"Abiteboul, S., Arenas, M., Barceló, P., Bienvenu, M., Calvanese, D., David, C., … Yi, K. (Eds.). (2018). Research Directions for Principles of Data Management (Vol. 7, pp. 1–29).","mla":"Abiteboul, S., et al., editors. Research Directions for Principles of Data Management. Vol. 7, no. 1, 2018, pp. 1–29.","bibtex":"@book{Abiteboul_Arenas_Barceló_Bienvenu_Calvanese_David_Hull_Hüllermeier_Kimelfeld_Libkin_et al._2018, title={Research Directions for Principles of Data Management}, volume={7}, number={1}, year={2018}, pages={1–29} }"},"year":"2018","page":"1-29","language":[{"iso":"eng"}],"issue":"1","_id":"10591","intvolume":" 7","date_updated":"2022-01-06T06:50:45Z","editor":[{"full_name":"Abiteboul, S.","first_name":"S.","last_name":"Abiteboul"},{"full_name":"Arenas, M.","first_name":"M.","last_name":"Arenas"},{"last_name":"Barceló","first_name":"P.","full_name":"Barceló, P."},{"last_name":"Bienvenu","first_name":"M.","full_name":"Bienvenu, M."},{"full_name":"Calvanese, D.","first_name":"D.","last_name":"Calvanese"},{"last_name":"David","first_name":"C.","full_name":"David, C."},{"first_name":"R.","full_name":"Hull, R.","last_name":"Hull"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"last_name":"Kimelfeld","full_name":"Kimelfeld, B.","first_name":"B."},{"first_name":"L.","full_name":"Libkin, L.","last_name":"Libkin"},{"last_name":"Martens","first_name":"W.","full_name":"Martens, W."},{"last_name":"Milo","full_name":"Milo, T.","first_name":"T."},{"first_name":"F.","full_name":"Murlak, F.","last_name":"Murlak"},{"first_name":"F.","full_name":"Neven, F.","last_name":"Neven"},{"full_name":"Ortiz, M.","first_name":"M.","last_name":"Ortiz"},{"last_name":"Schwentick","first_name":"T.","full_name":"Schwentick, T."},{"last_name":"Stoyanovich","first_name":"J.","full_name":"Stoyanovich, J."},{"last_name":"Su","full_name":"Su, J.","first_name":"J."},{"first_name":"D.","full_name":"Suciu, D.","last_name":"Suciu"},{"first_name":"V.","full_name":"Vianu, V.","last_name":"Vianu"},{"first_name":"K.","full_name":"Yi, K.","last_name":"Yi"}],"alternative_title":["Manifesto from Dagstuhl Perspectives Workshop 16151"],"volume":7,"status":"public","date_created":"2019-07-09T15:58:12Z","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"title":"Research Directions for Principles of Data Management","user_id":"49109"},{"title":"Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators","user_id":"49109","editor":[{"last_name":"Mostaghim","full_name":"Mostaghim, Sanaz","first_name":"Sanaz"},{"first_name":"Andreas","full_name":"Nürnberger, Andreas","last_name":"Nürnberger"},{"first_name":"Christian","full_name":"Borgelt, Christian","last_name":"Borgelt"}],"status":"public","date_created":"2019-07-10T15:39:00Z","publisher":"Springer","author":[{"full_name":"Couso, Ines","first_name":"Ines","last_name":"Couso"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"publication":"Frontiers in Computational Intelligence","date_updated":"2022-01-06T06:50:50Z","_id":"10783","year":"2018","type":"book_chapter","citation":{"chicago":"Couso, Ines, and Eyke Hüllermeier. “Statistical Inference for Incomplete Ranking Data: A Comparison of Two Likelihood-Based Estimators.” In Frontiers in Computational Intelligence, edited by Sanaz Mostaghim, Andreas Nürnberger, and Christian Borgelt, 31–46. Springer, 2018.","ama":"Couso I, Hüllermeier E. Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators. In: Mostaghim S, Nürnberger A, Borgelt C, eds. Frontiers in Computational Intelligence. Springer; 2018:31-46.","apa":"Couso, I., & Hüllermeier, E. (2018). Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators. In S. Mostaghim, A. Nürnberger, & C. Borgelt (Eds.), Frontiers in Computational Intelligence (pp. 31–46). Springer.","bibtex":"@inbook{Couso_Hüllermeier_2018, title={Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators}, booktitle={Frontiers in Computational Intelligence}, publisher={Springer}, author={Couso, Ines and Hüllermeier, Eyke}, editor={Mostaghim, Sanaz and Nürnberger, Andreas and Borgelt, ChristianEditors}, year={2018}, pages={31–46} }","mla":"Couso, Ines, and Eyke Hüllermeier. “Statistical Inference for Incomplete Ranking Data: A Comparison of Two Likelihood-Based Estimators.” Frontiers in Computational Intelligence, edited by Sanaz Mostaghim et al., Springer, 2018, pp. 31–46.","short":"I. Couso, E. Hüllermeier, in: S. Mostaghim, A. Nürnberger, C. Borgelt (Eds.), Frontiers in Computational Intelligence, Springer, 2018, pp. 31–46.","ieee":"I. Couso and E. Hüllermeier, “Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators,” in Frontiers in Computational Intelligence, S. Mostaghim, A. Nürnberger, and C. Borgelt, Eds. Springer, 2018, pp. 31–46."},"page":"31-46","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"year":"2018","citation":{"ama":"Schäfer D, Hüllermeier E. Dyad ranking using Plackett-Luce models based on joint feature representations. Machine Learning. 2018;107(5):903-941.","apa":"Schäfer, D., & Hüllermeier, E. (2018). Dyad ranking using Plackett-Luce models based on joint feature representations. Machine Learning, 107(5), 903–941.","chicago":"Schäfer, D., and Eyke Hüllermeier. “Dyad Ranking Using Plackett-Luce Models Based on Joint Feature Representations.” Machine Learning 107, no. 5 (2018): 903–41.","bibtex":"@article{Schäfer_Hüllermeier_2018, title={Dyad ranking using Plackett-Luce models based on joint feature representations}, volume={107}, number={5}, journal={Machine Learning}, author={Schäfer, D. and Hüllermeier, Eyke}, year={2018}, pages={903–941} }","mla":"Schäfer, D., and Eyke Hüllermeier. “Dyad Ranking Using Plackett-Luce Models Based on Joint Feature Representations.” Machine Learning, vol. 107, no. 5, 2018, pp. 903–41.","short":"D. Schäfer, E. Hüllermeier, Machine Learning 107 (2018) 903–941.","ieee":"D. Schäfer and E. Hüllermeier, “Dyad ranking using Plackett-Luce models based on joint feature representations,” Machine Learning, vol. 107, no. 5, pp. 903–941, 2018."},"type":"journal_article","page":"903-941","issue":"5","date_updated":"2022-01-06T06:52:42Z","_id":"16038","intvolume":" 107","status":"public","date_created":"2020-02-24T15:59:19Z","volume":107,"author":[{"full_name":"Schäfer, D.","first_name":"D.","last_name":"Schäfer"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"publication":"Machine Learning","user_id":"49109","title":"Dyad ranking using Plackett-Luce models based on joint feature representations"},{"status":"public","date_created":"2019-06-07T08:49:33Z","author":[{"first_name":"Mohsen","full_name":"Ahmadi Fahandar, Mohsen","last_name":"Ahmadi Fahandar"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"publication":"Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI)","user_id":"49109","title":"Learning to Rank Based on Analogical Reasoning","language":[{"iso":"eng"}],"citation":{"ieee":"M. Ahmadi Fahandar and E. Hüllermeier, “Learning to Rank Based on Analogical Reasoning,” in Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI), 2018, pp. 2951–2958.","short":"M. Ahmadi Fahandar, E. Hüllermeier, in: Proc. 32 Nd AAAI Conference on Artificial Intelligence (AAAI), 2018, pp. 2951–2958.","mla":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Learning to Rank Based on Analogical Reasoning.” Proc. 32 Nd AAAI Conference on Artificial Intelligence (AAAI), 2018, pp. 2951–58.","bibtex":"@inproceedings{Ahmadi Fahandar_Hüllermeier_2018, title={Learning to Rank Based on Analogical Reasoning}, booktitle={Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI)}, author={Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}, year={2018}, pages={2951–2958} }","apa":"Ahmadi Fahandar, M., & Hüllermeier, E. (2018). Learning to Rank Based on Analogical Reasoning. In Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI) (pp. 2951–2958).","ama":"Ahmadi Fahandar M, Hüllermeier E. Learning to Rank Based on Analogical Reasoning. In: Proc. 32 Nd AAAI Conference on Artificial Intelligence (AAAI). ; 2018:2951-2958.","chicago":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Learning to Rank Based on Analogical Reasoning.” In Proc. 32 Nd AAAI Conference on Artificial Intelligence (AAAI), 2951–58, 2018."},"type":"conference","year":"2018","page":"2951-2958","date_updated":"2022-01-06T06:50:31Z","_id":"10145"}]