[{"place":"Kyoto, Japan","title":"Ensembles of Evolved Nested Dichotomies for Classification","department":[{"_id":"355"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"publication_status":"published","date_updated":"2022-01-06T06:54:45Z","oa":"1","doi":"10.1145/3205455.3205562","language":[{"iso":"eng"}],"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."}],"user_id":"33176","ddc":["000"],"file":[{"file_name":"p561-wever.pdf","date_created":"2018-11-02T14:33:54Z","access_level":"closed","file_size":875404,"creator":"ups","file_id":"5275","date_updated":"2018-11-02T14:33:54Z","content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018","file_date_updated":"2018-11-02T14:33:54Z","keyword":["Classification","Hierarchical Decomposition","Indirect Encoding"],"publisher":"ACM","author":[{"id":"33176","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik"},{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"}],"date_created":"2018-03-31T13:51:23Z","has_accepted_license":"1","status":"public","conference":{"location":"Kyoto, Japan","name":"GECCO 2018","start_date":"2018-07-15","end_date":"2018-07-19"},"_id":"2109","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/citation.cfm?doid=3205455.3205562"}],"year":"2018","type":"conference","citation":{"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.","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.","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.","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} }","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"}},{"user_id":"5786","title":"Automated Multi-Label Classification based on ML-Plan","status":"public","date_created":"2020-08-07T11:38:10Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"publisher":"Arxiv","author":[{"id":"33176","last_name":"Wever","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik"},{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"}],"department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"oa":"1","_id":"17713","date_updated":"2022-01-06T06:53:17Z","language":[{"iso":"eng"}],"citation":{"mla":"Wever, Marcel Dominik, et al. 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} }","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.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Automated Multi-Label Classification based on ML-Plan.” Arxiv, 2018.","short":"M.D. Wever, F. Mohr, E. Hüllermeier, (2018)."},"year":"2018","type":"preprint","main_file_link":[{"url":"https://arxiv.org/pdf/1811.04060.pdf","open_access":"1"}]},{"author":[{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"last_name":"Wever","id":"33176","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"date_created":"2020-08-07T11:40:13Z","title":"Automated machine learning service composition","user_id":"5786","main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/1809.00486.pdf"}],"year":"2018","citation":{"short":"F. Mohr, M.D. Wever, E. Hüllermeier, (2018).","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “Automated machine learning service composition.” 2018.","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “Automated Machine Learning Service Composition,” 2018.","ama":"Mohr F, Wever MD, Hüllermeier E. Automated machine learning service composition. Published online 2018.","apa":"Mohr, F., Wever, M. D., & Hüllermeier, E. (2018). Automated machine learning service composition.","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} }"},"type":"preprint","language":[{"iso":"eng"}],"_id":"17714","date_updated":"2022-01-06T06:53:17Z","oa":"1"},{"_id":"5693","date_updated":"2022-01-06T07:02:35Z","supervisor":[{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"}],"language":[{"iso":"eng"}],"citation":{"chicago":"Graf, Helena. Ranking of Classification Algorithms in AutoML. Universität Paderborn, 2018.","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.","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","user_id":"33176","title":"Ranking of Classification Algorithms in AutoML","publisher":"Universität Paderborn","author":[{"id":"52640","last_name":"Graf","full_name":"Graf, Helena","first_name":"Helena"}],"department":[{"_id":"355"}],"status":"public","date_created":"2018-11-15T08:06:41Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"}]},{"year":"2018","citation":{"ama":"Scheibl M. 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.","chicago":"Scheibl, Manuel. Learning about Learning Curves from Dataset Properties. Universität Paderborn, 2018.","mla":"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} }","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."},"type":"bachelorsthesis","supervisor":[{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:02:47Z","_id":"5936","publisher":"Universität Paderborn","author":[{"full_name":"Scheibl, Manuel","first_name":"Manuel","last_name":"Scheibl"}],"department":[{"_id":"355"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"date_created":"2018-11-28T10:29:53Z","title":"Learning about learning curves from dataset properties","user_id":"477"},{"date_created":"2018-12-20T15:52:03Z","status":"public","has_accepted_license":"1","file_date_updated":"2019-01-11T11:03:50Z","publication":"Discovery Science","author":[{"last_name":"Schäfer","first_name":"Dirk","full_name":"Schäfer, Dirk"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"}],"publisher":"Springer International Publishing","file":[{"date_updated":"2019-01-11T11:03:50Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":458972,"creator":"ups","file_id":"6623","access_level":"closed","date_created":"2019-01-11T11:03:50Z","file_name":"Schäfer-Hüllermeier2018_Chapter_Preference-BasedReinforcementL.pdf"}],"ddc":["000"],"user_id":"49109","page":"161-175","year":"2018","type":"book_chapter","citation":{"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","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} }","short":"D. Schäfer, E. Hüllermeier, in: Discovery Science, Springer International Publishing, Cham, 2018, pp. 161–175.","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."},"_id":"6423","publication_identifier":{"isbn":["9783030017705","9783030017712"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"department":[{"_id":"355"}],"title":"Preference-Based Reinforcement Learning Using Dyad Ranking","place":"Cham","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-01771-2_11","date_updated":"2022-01-06T07:03:04Z"},{"issue":"1","date_updated":"2022-01-06T06:50:45Z","_id":"10591","intvolume":" 7","citation":{"ieee":"S. Abiteboul et al., Eds., Research Directions for Principles of Data Management, vol. 7, no. 1. 2018, pp. 1–29.","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.","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} }","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.","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).","ama":"Abiteboul S, Arenas M, Barceló P, et al., eds. Research Directions for Principles of Data Management. Vol 7.; 2018:1-29."},"type":"conference_editor","year":"2018","page":"1-29","language":[{"iso":"eng"}],"title":"Research Directions for Principles of Data Management","user_id":"49109","editor":[{"first_name":"S.","full_name":"Abiteboul, S.","last_name":"Abiteboul"},{"first_name":"M.","full_name":"Arenas, M.","last_name":"Arenas"},{"last_name":"Barceló","full_name":"Barceló, P.","first_name":"P."},{"last_name":"Bienvenu","full_name":"Bienvenu, M.","first_name":"M."},{"first_name":"D.","full_name":"Calvanese, D.","last_name":"Calvanese"},{"last_name":"David","full_name":"David, C.","first_name":"C."},{"last_name":"Hull","full_name":"Hull, R.","first_name":"R."},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"last_name":"Kimelfeld","first_name":"B.","full_name":"Kimelfeld, B."},{"last_name":"Libkin","first_name":"L.","full_name":"Libkin, L."},{"last_name":"Martens","full_name":"Martens, W.","first_name":"W."},{"last_name":"Milo","first_name":"T.","full_name":"Milo, T."},{"full_name":"Murlak, F.","first_name":"F.","last_name":"Murlak"},{"full_name":"Neven, F.","first_name":"F.","last_name":"Neven"},{"first_name":"M.","full_name":"Ortiz, M.","last_name":"Ortiz"},{"last_name":"Schwentick","first_name":"T.","full_name":"Schwentick, T."},{"first_name":"J.","full_name":"Stoyanovich, J.","last_name":"Stoyanovich"},{"last_name":"Su","first_name":"J.","full_name":"Su, J."},{"last_name":"Suciu","first_name":"D.","full_name":"Suciu, D."},{"last_name":"Vianu","full_name":"Vianu, V.","first_name":"V."},{"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"}]},{"user_id":"49109","title":"Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators","status":"public","date_created":"2019-07-10T15:39:00Z","editor":[{"first_name":"Sanaz","full_name":"Mostaghim, Sanaz","last_name":"Mostaghim"},{"last_name":"Nürnberger","first_name":"Andreas","full_name":"Nürnberger, Andreas"},{"last_name":"Borgelt","full_name":"Borgelt, Christian","first_name":"Christian"}],"author":[{"first_name":"Ines","full_name":"Couso, Ines","last_name":"Couso"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"publisher":"Springer","publication":"Frontiers in Computational Intelligence","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"_id":"10783","date_updated":"2022-01-06T06:50:50Z","language":[{"iso":"eng"}],"citation":{"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.","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.","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.","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.","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.","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} }"},"year":"2018","type":"book_chapter","page":"31-46"},{"user_id":"49109","title":"Dyad ranking using Plackett-Luce models based on joint feature representations","publication":"Machine Learning","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"author":[{"last_name":"Schäfer","first_name":"D.","full_name":"Schäfer, D."},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"date_created":"2020-02-24T15:59:19Z","status":"public","volume":107,"_id":"16038","date_updated":"2022-01-06T06:52:42Z","intvolume":" 107","issue":"5","language":[{"iso":"eng"}],"page":"903-941","year":"2018","citation":{"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.","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.","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.","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."},"type":"journal_article"},{"page":"2951-2958","citation":{"short":"M. Ahmadi Fahandar, E. Hüllermeier, in: Proc. 32 Nd AAAI Conference on Artificial Intelligence (AAAI), 2018, pp. 2951–2958.","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.","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.","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.","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).","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} }"},"type":"conference","year":"2018","language":[{"iso":"eng"}],"_id":"10145","date_updated":"2022-01-06T06:50:31Z","publication":"Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI)","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"author":[{"full_name":"Ahmadi Fahandar, Mohsen","first_name":"Mohsen","last_name":"Ahmadi Fahandar"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"date_created":"2019-06-07T08:49:33Z","status":"public","title":"Learning to Rank Based on Analogical Reasoning","user_id":"49109"},{"date_created":"2019-06-07T09:02:37Z","status":"public","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"publication":"Proc. 35th Int. Conference on Machine Learning (ICML)","author":[{"last_name":"El Mesaoudi-Paul","first_name":"Adil","full_name":"El Mesaoudi-Paul, Adil"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"last_name":"Busa-Fekete","first_name":"Robert","full_name":"Busa-Fekete, Robert"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","title":"Ranking Distributions based on Noisy Sorting","user_id":"5786","page":"3469-3477","citation":{"mla":"El Mesaoudi-Paul, Adil, et al. “Ranking Distributions Based on Noisy Sorting.” Proc. 35th Int. Conference on Machine Learning (ICML), Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2018, pp. 3469–77.","bibtex":"@inproceedings{El Mesaoudi-Paul_Hüllermeier_Busa-Fekete_2018, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Ranking Distributions based on Noisy Sorting}, booktitle={Proc. 35th Int. Conference on Machine Learning (ICML)}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={El Mesaoudi-Paul, Adil and Hüllermeier, Eyke and Busa-Fekete, Robert}, year={2018}, pages={3469–3477}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","chicago":"El Mesaoudi-Paul, Adil, Eyke Hüllermeier, and Robert Busa-Fekete. “Ranking Distributions Based on Noisy Sorting.” In Proc. 35th Int. Conference on Machine Learning (ICML), 3469–77. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2018.","apa":"El Mesaoudi-Paul, A., Hüllermeier, E., & Busa-Fekete, R. (2018). Ranking Distributions based on Noisy Sorting. Proc. 35th Int. Conference on Machine Learning (ICML), 3469–3477.","ama":"El Mesaoudi-Paul A, Hüllermeier E, Busa-Fekete R. Ranking Distributions based on Noisy Sorting. In: Proc. 35th Int. Conference on Machine Learning (ICML). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2018:3469-3477.","ieee":"A. El Mesaoudi-Paul, E. Hüllermeier, and R. Busa-Fekete, “Ranking Distributions based on Noisy Sorting,” in Proc. 35th Int. Conference on Machine Learning (ICML), 2018, pp. 3469–3477.","short":"A. El Mesaoudi-Paul, E. Hüllermeier, R. Busa-Fekete, in: Proc. 35th Int. Conference on Machine Learning (ICML), Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2018, pp. 3469–3477."},"year":"2018","type":"conference","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:50:31Z","_id":"10148"},{"date_updated":"2022-01-06T06:50:31Z","_id":"10149","type":"conference","citation":{"apa":"Hesse, M., Timmermann, J., Hüllermeier, E., & Trächtler, A. (2018). A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart. Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24, 15–20.","ama":"Hesse M, Timmermann J, Hüllermeier E, Trächtler A. A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart. In: Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24. ; 2018:15-20.","chicago":"Hesse, M., J. Timmermann, Eyke Hüllermeier, and Ansgar Trächtler. “A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart.” In Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24, 15–20, 2018.","mla":"Hesse, M., et al. “A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart.” Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24, 2018, pp. 15–20.","bibtex":"@inproceedings{Hesse_Timmermann_Hüllermeier_Trächtler_2018, title={A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart}, booktitle={Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24}, author={Hesse, M. and Timmermann, J. and Hüllermeier, Eyke and Trächtler, Ansgar}, year={2018}, pages={15–20} }","short":"M. Hesse, J. Timmermann, E. Hüllermeier, A. Trächtler, in: Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24, 2018, pp. 15–20.","ieee":"M. Hesse, J. Timmermann, E. Hüllermeier, and A. Trächtler, “A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart,” in Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24, 2018, pp. 15–20."},"year":"2018","page":"15-20","language":[{"iso":"eng"}],"title":"A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart","user_id":"5786","author":[{"last_name":"Hesse","full_name":"Hesse, M.","first_name":"M."},{"full_name":"Timmermann, J.","first_name":"J.","last_name":"Timmermann"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"},{"last_name":"Trächtler","first_name":"Ansgar","full_name":"Trächtler, Ansgar"}],"publication":"Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"status":"public","date_created":"2019-06-07T09:10:51Z"},{"title":"Learning interpretable rules for multi-label classification","user_id":"49109","publisher":"Springer","author":[{"full_name":"Mencia, E.Loza","first_name":"E.Loza","last_name":"Mencia"},{"last_name":"Fürnkranz","first_name":"J.","full_name":"Fürnkranz, J."},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"},{"last_name":"Rapp","first_name":"M.","full_name":"Rapp, M."}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"publication":"Explainable and Interpretable Models in Computer Vision and Machine Learning","editor":[{"last_name":"Jair Escalante","first_name":"H.","full_name":"Jair Escalante, H."},{"full_name":"Escalera, S.","first_name":"S.","last_name":"Escalera"},{"last_name":"Guyon","first_name":"I.","full_name":"Guyon, I."},{"last_name":"Baro","full_name":"Baro, X.","first_name":"X."},{"first_name":"Y.","full_name":"Güclüütürk, Y.","last_name":"Güclüütürk"},{"first_name":"U.","full_name":"Güclü, U.","last_name":"Güclü"},{"first_name":"M.A.J.","full_name":"van Gerven, M.A.J.","last_name":"van Gerven"}],"status":"public","date_created":"2019-06-07T09:17:56Z","date_updated":"2022-01-06T06:50:31Z","_id":"10152","series_title":"The Springer Series on Challenges in Machine Learning","year":"2018","type":"book_chapter","citation":{"mla":"Mencia, E. Loz., et al. “Learning Interpretable Rules for Multi-Label Classification.” Explainable and Interpretable Models in Computer Vision and Machine Learning, edited by H. Jair Escalante et al., Springer, 2018, pp. 81–113.","bibtex":"@inbook{Mencia_Fürnkranz_Hüllermeier_Rapp_2018, series={The Springer Series on Challenges in Machine Learning}, title={Learning interpretable rules for multi-label classification}, booktitle={Explainable and Interpretable Models in Computer Vision and Machine Learning}, publisher={Springer}, author={Mencia, E.Loza and Fürnkranz, J. and Hüllermeier, Eyke and Rapp, M.}, editor={Jair Escalante, H. and Escalera, S. and Guyon, I. and Baro, X. and Güclüütürk, Y. and Güclü, U. and van Gerven, M.A.J.Editors}, year={2018}, pages={81–113}, collection={The Springer Series on Challenges in Machine Learning} }","chicago":"Mencia, E.Loza, J. Fürnkranz, Eyke Hüllermeier, and M. Rapp. “Learning Interpretable Rules for Multi-Label Classification.” In Explainable and Interpretable Models in Computer Vision and Machine Learning, edited by H. Jair Escalante, S. Escalera, I. Guyon, X. Baro, Y. Güclüütürk, U. Güclü, and M.A.J. van Gerven, 81–113. The Springer Series on Challenges in Machine Learning. Springer, 2018.","ama":"Mencia EL, Fürnkranz J, Hüllermeier E, Rapp M. Learning interpretable rules for multi-label classification. In: Jair Escalante H, Escalera S, Guyon I, et al., eds. Explainable and Interpretable Models in Computer Vision and Machine Learning. The Springer Series on Challenges in Machine Learning. Springer; 2018:81-113.","apa":"Mencia, E. L., Fürnkranz, J., Hüllermeier, E., & Rapp, M. (2018). Learning interpretable rules for multi-label classification. In H. Jair Escalante, S. Escalera, I. Guyon, X. Baro, Y. Güclüütürk, U. Güclü, & M. A. J. van Gerven (Eds.), Explainable and Interpretable Models in Computer Vision and Machine Learning (pp. 81–113). Springer.","ieee":"E. L. Mencia, J. Fürnkranz, E. Hüllermeier, and M. Rapp, “Learning interpretable rules for multi-label classification,” in Explainable and Interpretable Models in Computer Vision and Machine Learning, H. Jair Escalante, S. Escalera, I. Guyon, X. Baro, Y. Güclüütürk, U. Güclü, and M. A. J. van Gerven, Eds. Springer, 2018, pp. 81–113.","short":"E.L. Mencia, J. Fürnkranz, E. Hüllermeier, M. Rapp, in: H. Jair Escalante, S. Escalera, I. Guyon, X. Baro, Y. Güclüütürk, U. Güclü, M.A.J. van Gerven (Eds.), Explainable and Interpretable Models in Computer Vision and Machine Learning, Springer, 2018, pp. 81–113."},"page":"81-113","language":[{"iso":"eng"}]},{"page":"5089-5095","citation":{"bibtex":"@inproceedings{Nguyen_Destercke_Masson_Hüllermeier_2018, title={Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty}, booktitle={Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)}, author={Nguyen, Vu-Linh and Destercke, Sebastian and Masson, M.-H. and Hüllermeier, Eyke}, year={2018}, pages={5089–5095} }","mla":"Nguyen, Vu-Linh, et al. “Reliable Multi-Class Classification Based on Pairwise Epistemic and Aleatoric Uncertainty.” Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI), 2018, pp. 5089–95.","apa":"Nguyen, V.-L., Destercke, S., Masson, M.-H., & Hüllermeier, E. (2018). Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty. Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI), 5089–5095.","ama":"Nguyen V-L, Destercke S, Masson M-H, Hüllermeier E. Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty. In: Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI). ; 2018:5089-5095.","chicago":"Nguyen, Vu-Linh, Sebastian Destercke, M.-H. Masson, and Eyke Hüllermeier. “Reliable Multi-Class Classification Based on Pairwise Epistemic and Aleatoric Uncertainty.” In Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI), 5089–95, 2018.","ieee":"V.-L. Nguyen, S. Destercke, M.-H. Masson, and E. Hüllermeier, “Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty,” in Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI), 2018, pp. 5089–5095.","short":"V.-L. Nguyen, S. Destercke, M.-H. Masson, E. Hüllermeier, in: Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI), 2018, pp. 5089–5095."},"year":"2018","type":"conference","language":[{"iso":"eng"}],"_id":"10181","date_updated":"2022-01-06T06:50:31Z","date_created":"2019-06-07T12:31:20Z","status":"public","publication":"Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"author":[{"last_name":"Nguyen","first_name":"Vu-Linh","full_name":"Nguyen, Vu-Linh"},{"last_name":"Destercke","full_name":"Destercke, Sebastian","first_name":"Sebastian"},{"last_name":"Masson","first_name":"M.-H.","full_name":"Masson, M.-H."},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"title":"Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty","user_id":"5786"},{"date_updated":"2022-01-06T06:50:31Z","_id":"10184","language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Schäfer_Hüllermeier_2018, title={Preference-Based Reinforcement Learning Using Dyad Ranking}, booktitle={Proc. 21st Int. Conference on Discovery Science (DS)}, author={Schäfer, Dirk and Hüllermeier, Eyke}, year={2018}, pages={161–175} }","mla":"Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning Using Dyad Ranking.” Proc. 21st Int. Conference on Discovery Science (DS), 2018, pp. 161–75.","ama":"Schäfer D, Hüllermeier E. Preference-Based Reinforcement Learning Using Dyad Ranking. In: Proc. 21st Int. Conference on Discovery Science (DS). ; 2018:161-175.","apa":"Schäfer, D., & Hüllermeier, E. (2018). Preference-Based Reinforcement Learning Using Dyad Ranking. Proc. 21st Int. Conference on Discovery Science (DS), 161–175.","chicago":"Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning Using Dyad Ranking.” In Proc. 21st Int. Conference on Discovery Science (DS), 161–75, 2018.","ieee":"D. Schäfer and E. Hüllermeier, “Preference-Based Reinforcement Learning Using Dyad Ranking,” in Proc. 21st Int. Conference on Discovery Science (DS), 2018, pp. 161–175.","short":"D. Schäfer, E. Hüllermeier, in: Proc. 21st Int. Conference on Discovery Science (DS), 2018, pp. 161–175."},"year":"2018","type":"conference","page":"161-175","user_id":"5786","title":"Preference-Based Reinforcement Learning Using Dyad Ranking","status":"public","date_created":"2019-06-07T12:33:58Z","author":[{"full_name":"Schäfer, Dirk","first_name":"Dirk","last_name":"Schäfer"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"}],"publication":"Proc. 21st Int. Conference on Discovery Science (DS)","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}]},{"user_id":"49109","title":"Dyad Ranking Using Plackett-Luce Models based on joint feature representations","author":[{"first_name":"Dirk","full_name":"Schäfer, Dirk","last_name":"Schäfer"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"publication":"Machine Learning","status":"public","date_created":"2019-06-19T14:58:10Z","volume":107,"intvolume":" 107","_id":"10276","date_updated":"2022-01-06T06:50:33Z","issue":"5","language":[{"iso":"eng"}],"type":"journal_article","citation":{"chicago":"Schäfer, Dirk, and Eyke Hüllermeier. “Dyad Ranking Using Plackett-Luce Models Based on Joint Feature Representations.” Machine Learning 107, no. 5 (2018): 903–41.","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.","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.","mla":"Schäfer, Dirk, 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.","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, Dirk and Hüllermeier, Eyke}, year={2018}, pages={903–941} }","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."},"year":"2018","page":"903-941"},{"_id":"1379","conference":{"end_date":"2018-03-09","location":"Stuttgart, Germany","name":"Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft","start_date":"2018-03-07"},"main_file_link":[{"open_access":"1","url":"https://www.dgfs2018.uni-stuttgart.de/programm/postersession/programm-cl-postersession/2018_dgfs-cl-poster-seemann-etal.pdf"}],"type":"conference_abstract","citation":{"ieee":"N. Seemann, M. Geierhos, M.-L. Merten, D. Tophinke, M. D. Wever, and E. Hüllermeier, “Supporting the Cognitive Process in Annotation Tasks,” in Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft, Stuttgart, Germany, 2018.","short":"N. Seemann, M. Geierhos, M.-L. Merten, D. Tophinke, M.D. Wever, E. Hüllermeier, in: K. Eckart, D. Schlechtweg (Eds.), Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft, 2018.","bibtex":"@inproceedings{Seemann_Geierhos_Merten_Tophinke_Wever_Hüllermeier_2018, title={Supporting the Cognitive Process in Annotation Tasks}, booktitle={Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft}, author={Seemann, Nina and Geierhos, Michaela and Merten, Marie-Luis and Tophinke, Doris and Wever, Marcel Dominik and Hüllermeier, Eyke}, editor={Eckart, Kerstin and Schlechtweg, Dominik }, year={2018} }","mla":"Seemann, Nina, et al. “Supporting the Cognitive Process in Annotation Tasks.” Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft, edited by Kerstin Eckart and Dominik Schlechtweg, 2018.","ama":"Seemann N, Geierhos M, Merten M-L, Tophinke D, Wever MD, Hüllermeier E. Supporting the Cognitive Process in Annotation Tasks. In: Eckart K, Schlechtweg D, eds. Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft. ; 2018.","apa":"Seemann, N., Geierhos, M., Merten, M.-L., Tophinke, D., Wever, M. D., & Hüllermeier, E. (2018). Supporting the Cognitive Process in Annotation Tasks. In K. Eckart & D. Schlechtweg (Eds.), Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft.","chicago":"Seemann, Nina, Michaela Geierhos, Marie-Luis Merten, Doris Tophinke, Marcel Dominik Wever, and Eyke Hüllermeier. “Supporting the Cognitive Process in Annotation Tasks.” In Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft, edited by Kerstin Eckart and Dominik Schlechtweg, 2018."},"year":"2018","user_id":"16277","ddc":["410"],"file":[{"creator":"wever","file_id":"5389","file_size":158928,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-11-06T15:32:38Z","date_created":"2018-11-06T15:32:38Z","file_name":"2018_dgfs-cl-poster-seemann-etal.pdf","access_level":"closed"}],"quality_controlled":"1","author":[{"first_name":"Nina","full_name":"Seemann, Nina","last_name":"Seemann","id":"65408"},{"id":"42496","last_name":"Geierhos","full_name":"Geierhos, Michaela","orcid":"0000-0002-8180-5606","first_name":"Michaela"},{"full_name":"Merten, Marie-Luis","first_name":"Marie-Luis","last_name":"Merten"},{"last_name":"Tophinke","id":"16277","first_name":"Doris","full_name":"Tophinke, Doris"},{"id":"33176","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"}],"file_date_updated":"2018-11-06T15:32:38Z","publication":"Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft","status":"public","has_accepted_license":"1","date_created":"2018-03-19T15:23:25Z","date_updated":"2023-01-09T14:56:56Z","oa":"1","language":[{"iso":"ger"}],"title":"Supporting the Cognitive Process in Annotation Tasks","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"},{"_id":"115"},{"_id":"355"},{"_id":"115"}],"project":[{"name":"InterGramm","_id":"39"}],"editor":[{"full_name":"Eckart, Kerstin ","first_name":"Kerstin ","last_name":"Eckart"},{"first_name":"Dominik ","full_name":"Schlechtweg, Dominik ","last_name":"Schlechtweg"}],"publication_status":"published"},{"extern":"1","title":"Analysis of gradient descent methods with nondiminishing bounded errors","user_id":"66937","department":[{"_id":"355"}],"publication":"IEEE Transactions on Automatic Control","publisher":"IEEE","author":[{"orcid":"https://orcid.org/ 0000-0001-7547-8111","full_name":"Ramaswamy, Arunselvan","first_name":"Arunselvan","id":"66937","last_name":"Ramaswamy"},{"full_name":"Bhatnagar, Shalabh","first_name":"Shalabh","last_name":"Bhatnagar"}],"volume":63,"date_created":"2021-09-10T10:19:40Z","status":"public","_id":"24152","intvolume":" 63","date_updated":"2022-01-06T06:56:08Z","issue":"5","page":"1465-1471","citation":{"chicago":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Analysis of Gradient Descent Methods with Nondiminishing Bounded Errors.” IEEE Transactions on Automatic Control 63, no. 5 (2017): 1465–71.","ama":"Ramaswamy A, Bhatnagar S. Analysis of gradient descent methods with nondiminishing bounded errors. IEEE Transactions on Automatic Control. 2017;63(5):1465-1471.","apa":"Ramaswamy, A., & Bhatnagar, S. (2017). Analysis of gradient descent methods with nondiminishing bounded errors. IEEE Transactions on Automatic Control, 63(5), 1465–1471.","mla":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Analysis of Gradient Descent Methods with Nondiminishing Bounded Errors.” IEEE Transactions on Automatic Control, vol. 63, no. 5, IEEE, 2017, pp. 1465–71.","bibtex":"@article{Ramaswamy_Bhatnagar_2017, title={Analysis of gradient descent methods with nondiminishing bounded errors}, volume={63}, number={5}, journal={IEEE Transactions on Automatic Control}, publisher={IEEE}, author={Ramaswamy, Arunselvan and Bhatnagar, Shalabh}, year={2017}, pages={1465–1471} }","short":"A. Ramaswamy, S. Bhatnagar, IEEE Transactions on Automatic Control 63 (2017) 1465–1471.","ieee":"A. Ramaswamy and S. Bhatnagar, “Analysis of gradient descent methods with nondiminishing bounded errors,” IEEE Transactions on Automatic Control, vol. 63, no. 5, pp. 1465–1471, 2017."},"type":"journal_article","year":"2017","language":[{"iso":"eng"}]},{"publisher":"INFORMS","author":[{"last_name":"Ramaswamy","id":"66937","first_name":"Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","full_name":"Ramaswamy, Arunselvan"},{"full_name":"Bhatnagar, Shalabh","first_name":"Shalabh","last_name":"Bhatnagar"}],"publication":"Mathematics of Operations Research","department":[{"_id":"355"}],"status":"public","date_created":"2021-09-10T10:21:02Z","volume":42,"extern":"1","user_id":"66937","title":"A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions","language":[{"iso":"eng"}],"citation":{"short":"A. Ramaswamy, S. Bhatnagar, Mathematics of Operations Research 42 (2017) 648–661.","ieee":"A. Ramaswamy and S. Bhatnagar, “A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions,” Mathematics of Operations Research, vol. 42, no. 3, pp. 648–661, 2017.","chicago":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive Inclusions.” Mathematics of Operations Research 42, no. 3 (2017): 648–61.","apa":"Ramaswamy, A., & Bhatnagar, S. (2017). A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions. Mathematics of Operations Research, 42(3), 648–661.","ama":"Ramaswamy A, Bhatnagar S. A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions. Mathematics of Operations Research. 2017;42(3):648-661.","mla":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive Inclusions.” Mathematics of Operations Research, vol. 42, no. 3, INFORMS, 2017, pp. 648–61.","bibtex":"@article{Ramaswamy_Bhatnagar_2017, title={A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions}, volume={42}, number={3}, journal={Mathematics of Operations Research}, publisher={INFORMS}, author={Ramaswamy, Arunselvan and Bhatnagar, Shalabh}, year={2017}, pages={648–661} }"},"type":"journal_article","year":"2017","page":"648-661","intvolume":" 42","_id":"24153","date_updated":"2022-01-06T06:56:08Z","issue":"3"},{"type":"conference","year":"2017","citation":{"ama":"Melnikov V, Hüllermeier E. Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics. In: Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017. KIT Scientific Publishing; 2017. doi:10.5445/KSP/1000074341","apa":"Melnikov, V., & Hüllermeier, E. (2017). Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics. In Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017. KIT Scientific Publishing. https://doi.org/10.5445/KSP/1000074341","chicago":"Melnikov, Vitalik, and Eyke Hüllermeier. “Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics.” In Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017. KIT Scientific Publishing, 2017. https://doi.org/10.5445/KSP/1000074341.","mla":"Melnikov, Vitalik, and Eyke Hüllermeier. “Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics.” Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017, KIT Scientific Publishing, 2017, doi:10.5445/KSP/1000074341.","bibtex":"@inproceedings{Melnikov_Hüllermeier_2017, title={Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics}, DOI={10.5445/KSP/1000074341}, booktitle={Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017}, publisher={KIT Scientific Publishing}, author={Melnikov, Vitalik and Hüllermeier, Eyke}, year={2017} }","short":"V. Melnikov, E. Hüllermeier, in: Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017, KIT Scientific Publishing, 2017.","ieee":"V. Melnikov and E. Hüllermeier, “Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics,” in Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017, 2017."},"language":[{"iso":"eng"}],"_id":"3325","date_updated":"2022-01-06T06:59:10Z","doi":"10.5445/KSP/1000074341","department":[{"_id":"355"}],"publication":"Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017","file_date_updated":"2018-11-30T09:47:59Z","publisher":"KIT Scientific Publishing","author":[{"first_name":"Vitalik","full_name":"Melnikov, Vitalik","last_name":"Melnikov"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"}],"file":[{"creator":"melnikov","file_id":"5987","file_size":1829552,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-11-30T09:47:59Z","file_name":"main.pdf","date_created":"2018-11-30T09:47:59Z","access_level":"closed"}],"project":[{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"}],"date_created":"2018-06-25T08:14:49Z","has_accepted_license":"1","status":"public","title":"Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics","ddc":["000"],"user_id":"15504"}]