[{"department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"type":"conference","date_created":"2019-06-07T09:02:37Z","citation":{"ama":"El Mesaoudi-Paul A, Hüllermeier E, Busa-Fekete R. Ranking Distributions based on Noisy Sorting. In: <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2018:3469-3477.","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} }","mla":"El Mesaoudi-Paul, Adil, et al. “Ranking Distributions Based on Noisy Sorting.” <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2018, pp. 3469–77.","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.","chicago":"El Mesaoudi-Paul, Adil, Eyke Hüllermeier, and Robert Busa-Fekete. “Ranking Distributions Based on Noisy Sorting.” In <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>, 3469–77. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2018.","apa":"El Mesaoudi-Paul, A., Hüllermeier, E., &#38; Busa-Fekete, R. (2018). Ranking Distributions based on Noisy Sorting. <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>, 3469–3477.","ieee":"A. El Mesaoudi-Paul, E. Hüllermeier, and R. Busa-Fekete, “Ranking Distributions based on Noisy Sorting,” in <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>, 2018, pp. 3469–3477."},"publication":"Proc. 35th Int. Conference on Machine Learning (ICML)","user_id":"5786","_id":"10148","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","page":"3469-3477","date_updated":"2022-01-06T06:50:31Z","author":[{"first_name":"Adil","last_name":"El Mesaoudi-Paul","full_name":"El Mesaoudi-Paul, Adil"},{"id":"48129","last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"full_name":"Busa-Fekete, Robert","last_name":"Busa-Fekete","first_name":"Robert"}],"year":"2018","title":"Ranking Distributions based on Noisy Sorting","status":"public"},{"date_created":"2019-06-07T09:10:51Z","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"type":"conference","citation":{"mla":"Hesse, M., et al. “A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart.” <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>, 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} }","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: <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>. ; 2018: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 <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>, 2018, pp. 15–20.","apa":"Hesse, M., Timmermann, J., Hüllermeier, E., &#38; Trächtler, A. (2018). A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart. <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>, 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.","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 <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>, 15–20, 2018."},"publication":"Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24","language":[{"iso":"eng"}],"_id":"10149","page":"15-20","user_id":"5786","author":[{"last_name":"Hesse","first_name":"M.","full_name":"Hesse, M."},{"full_name":"Timmermann, J.","last_name":"Timmermann","first_name":"J."},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"},{"full_name":"Trächtler, Ansgar","first_name":"Ansgar","last_name":"Trächtler"}],"title":"A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart","status":"public","year":"2018","date_updated":"2022-01-06T06:50:31Z"},{"publication":"Explainable and Interpretable Models in Computer Vision and Machine Learning","citation":{"chicago":"Mencia, E.Loza, J. Fürnkranz, Eyke Hüllermeier, and M. Rapp. “Learning Interpretable Rules for Multi-Label Classification.” In <i>Explainable and Interpretable Models in Computer Vision and Machine Learning</i>, 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.","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.","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. <i>Explainable and Interpretable Models in Computer Vision and Machine Learning</i>. The Springer Series on Challenges in Machine Learning. Springer; 2018: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} }","apa":"Mencia, E. L., Fürnkranz, J., Hüllermeier, E., &#38; 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ü, &#38; M. A. J. van Gerven (Eds.), <i>Explainable and Interpretable Models in Computer Vision and Machine Learning</i> (pp. 81–113). Springer.","mla":"Mencia, E. Loz., et al. “Learning Interpretable Rules for Multi-Label Classification.” <i>Explainable and Interpretable Models in Computer Vision and Machine Learning</i>, edited by H. Jair Escalante et al., Springer, 2018, pp. 81–113.","ieee":"E. L. Mencia, J. Fürnkranz, E. Hüllermeier, and M. Rapp, “Learning interpretable rules for multi-label classification,” in <i>Explainable and Interpretable Models in Computer Vision and Machine Learning</i>, 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."},"type":"book_chapter","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"date_created":"2019-06-07T09:17:56Z","date_updated":"2022-01-06T06:50:31Z","status":"public","year":"2018","title":"Learning interpretable rules for multi-label classification","author":[{"last_name":"Mencia","first_name":"E.Loza","full_name":"Mencia, E.Loza"},{"full_name":"Fürnkranz, J.","first_name":"J.","last_name":"Fürnkranz"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"},{"last_name":"Rapp","first_name":"M.","full_name":"Rapp, M."}],"user_id":"49109","editor":[{"full_name":"Jair Escalante, H.","first_name":"H.","last_name":"Jair Escalante"},{"full_name":"Escalera, S.","last_name":"Escalera","first_name":"S."},{"full_name":"Guyon, I.","last_name":"Guyon","first_name":"I."},{"first_name":"X.","last_name":"Baro","full_name":"Baro, X."},{"full_name":"Güclüütürk, Y.","last_name":"Güclüütürk","first_name":"Y."},{"full_name":"Güclü, U.","last_name":"Güclü","first_name":"U."},{"full_name":"van Gerven, M.A.J.","last_name":"van Gerven","first_name":"M.A.J."}],"page":"81-113","language":[{"iso":"eng"}],"_id":"10152","series_title":"The Springer Series on Challenges in Machine Learning","publisher":"Springer"},{"date_created":"2019-06-07T12:31:20Z","type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"publication":"Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)","citation":{"apa":"Nguyen, V.-L., Destercke, S., Masson, M.-H., &#38; Hüllermeier, E. (2018). Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty. <i>Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)</i>, 5089–5095.","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 <i>Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)</i>, 2018, pp. 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 <i>Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)</i>, 5089–95, 2018.","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.","mla":"Nguyen, Vu-Linh, et al. “Reliable Multi-Class Classification Based on Pairwise Epistemic and Aleatoric Uncertainty.” <i>Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)</i>, 2018, pp. 5089–95.","ama":"Nguyen V-L, Destercke S, Masson M-H, Hüllermeier E. Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty. In: <i>Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)</i>. ; 2018:5089-5095.","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} }"},"page":"5089-5095","language":[{"iso":"eng"}],"_id":"10181","user_id":"5786","year":"2018","title":"Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty","status":"public","author":[{"full_name":"Nguyen, Vu-Linh","first_name":"Vu-Linh","last_name":"Nguyen"},{"first_name":"Sebastian","last_name":"Destercke","full_name":"Destercke, Sebastian"},{"full_name":"Masson, M.-H.","first_name":"M.-H.","last_name":"Masson"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"date_updated":"2022-01-06T06:50:31Z"},{"type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"date_created":"2019-06-07T12:33:58Z","publication":"Proc. 21st Int. Conference on Discovery Science (DS)","citation":{"ama":"Schäfer D, Hüllermeier E. Preference-Based Reinforcement Learning Using Dyad Ranking. In: <i>Proc. 21st Int. Conference on Discovery Science (DS)</i>. ; 2018:161-175.","short":"D. Schäfer, E. Hüllermeier, in: Proc. 21st Int. Conference on Discovery Science (DS), 2018, pp. 161–175.","chicago":"Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning Using Dyad Ranking.” In <i>Proc. 21st Int. Conference on Discovery Science (DS)</i>, 161–75, 2018.","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} }","apa":"Schäfer, D., &#38; Hüllermeier, E. (2018). Preference-Based Reinforcement Learning Using Dyad Ranking. <i>Proc. 21st Int. Conference on Discovery Science (DS)</i>, 161–175.","mla":"Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning Using Dyad Ranking.” <i>Proc. 21st Int. Conference on Discovery Science (DS)</i>, 2018, pp. 161–75.","ieee":"D. Schäfer and E. Hüllermeier, “Preference-Based Reinforcement Learning Using Dyad Ranking,” in <i>Proc. 21st Int. Conference on Discovery Science (DS)</i>, 2018, pp. 161–175."},"user_id":"5786","page":"161-175","language":[{"iso":"eng"}],"_id":"10184","date_updated":"2022-01-06T06:50:31Z","year":"2018","status":"public","title":"Preference-Based Reinforcement Learning Using Dyad Ranking","author":[{"first_name":"Dirk","last_name":"Schäfer","full_name":"Schäfer, Dirk"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"}]},{"issue":"5","publication":"Machine Learning","citation":{"ieee":"D. Schäfer and E. Hüllermeier, “Dyad Ranking Using Plackett-Luce Models based on joint feature representations,” <i>Machine Learning</i>, vol. 107, no. 5, pp. 903–941, 2018.","apa":"Schäfer, D., &#38; Hüllermeier, E. (2018). Dyad Ranking Using Plackett-Luce Models based on joint feature representations. <i>Machine Learning</i>, <i>107</i>(5), 903–941.","chicago":"Schäfer, Dirk, and Eyke Hüllermeier. “Dyad Ranking Using Plackett-Luce Models Based on Joint Feature Representations.” <i>Machine Learning</i> 107, no. 5 (2018): 903–41.","short":"D. Schäfer, E. Hüllermeier, Machine Learning 107 (2018) 903–941.","mla":"Schäfer, Dirk, and Eyke Hüllermeier. “Dyad Ranking Using Plackett-Luce Models Based on Joint Feature Representations.” <i>Machine Learning</i>, 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} }","ama":"Schäfer D, Hüllermeier E. Dyad Ranking Using Plackett-Luce Models based on joint feature representations. <i>Machine Learning</i>. 2018;107(5):903-941."},"type":"journal_article","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"date_created":"2019-06-19T14:58:10Z","date_updated":"2022-01-06T06:50:33Z","intvolume":"       107","status":"public","year":"2018","title":"Dyad Ranking Using Plackett-Luce Models based on joint feature representations","author":[{"full_name":"Schäfer, Dirk","last_name":"Schäfer","first_name":"Dirk"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"user_id":"49109","volume":107,"page":"903-941","language":[{"iso":"eng"}],"_id":"10276"},{"file":[{"creator":"wever","date_created":"2018-11-06T15:32:38Z","relation":"main_file","date_updated":"2018-11-06T15:32:38Z","file_name":"2018_dgfs-cl-poster-seemann-etal.pdf","access_level":"closed","file_size":158928,"file_id":"5389","success":1,"content_type":"application/pdf"}],"date_created":"2018-03-19T15:23:25Z","type":"conference_abstract","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"},{"_id":"115"},{"_id":"355"},{"_id":"115"}],"publication":"Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft","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"}],"language":[{"iso":"ger"}],"year":"2018","title":"Supporting the Cognitive Process in Annotation Tasks","author":[{"full_name":"Seemann, Nina","first_name":"Nina","last_name":"Seemann","id":"65408"},{"orcid":"0000-0002-8180-5606","first_name":"Michaela","last_name":"Geierhos","full_name":"Geierhos, Michaela","id":"42496"},{"full_name":"Merten, Marie-Luis","first_name":"Marie-Luis","last_name":"Merten"},{"full_name":"Tophinke, Doris","first_name":"Doris","last_name":"Tophinke","id":"16277"},{"id":"33176","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"}],"publication_status":"published","date_updated":"2023-01-09T14:56:56Z","oa":"1","file_date_updated":"2018-11-06T15:32:38Z","citation":{"apa":"Seemann, N., Geierhos, M., Merten, M.-L., Tophinke, D., Wever, M. D., &#38; Hüllermeier, E. (2018). Supporting the Cognitive Process in Annotation Tasks. In K. Eckart &#38; D. Schlechtweg (Eds.), <i>Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft</i>.","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 <i>Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft</i>, 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.","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 <i>Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft</i>, edited by Kerstin  Eckart and Dominik  Schlechtweg, 2018.","mla":"Seemann, Nina, et al. “Supporting the Cognitive Process in Annotation Tasks.” <i>Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft</i>, 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. <i>Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft</i>. ; 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} }"},"quality_controlled":"1","project":[{"_id":"39","name":"InterGramm"}],"_id":"1379","user_id":"16277","ddc":["410"],"editor":[{"full_name":"Eckart, Kerstin ","last_name":"Eckart","first_name":"Kerstin "},{"full_name":"Schlechtweg, Dominik ","first_name":"Dominik ","last_name":"Schlechtweg"}],"status":"public","conference":{"location":"Stuttgart, Germany","start_date":"2018-03-07","name":"Postersession Computerlinguistik der 40. Jahrestagung der Deutschen Gesellschaft für Sprachwissenschaft","end_date":"2018-03-09"},"has_accepted_license":"1"},{"extern":"1","issue":"5","publication":"IEEE Transactions on Automatic Control","citation":{"ama":"Ramaswamy A, Bhatnagar S. Analysis of gradient descent methods with nondiminishing bounded errors. <i>IEEE Transactions on Automatic Control</i>. 2017;63(5):1465-1471.","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} }","mla":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Analysis of Gradient Descent Methods with Nondiminishing Bounded Errors.” <i>IEEE Transactions on Automatic Control</i>, vol. 63, no. 5, IEEE, 2017, pp. 1465–71.","chicago":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Analysis of Gradient Descent Methods with Nondiminishing Bounded Errors.” <i>IEEE Transactions on Automatic Control</i> 63, no. 5 (2017): 1465–71.","short":"A. Ramaswamy, S. Bhatnagar, IEEE Transactions on Automatic Control 63 (2017) 1465–1471.","apa":"Ramaswamy, A., &#38; Bhatnagar, S. (2017). Analysis of gradient descent methods with nondiminishing bounded errors. <i>IEEE Transactions on Automatic Control</i>, <i>63</i>(5), 1465–1471.","ieee":"A. Ramaswamy and S. Bhatnagar, “Analysis of gradient descent methods with nondiminishing bounded errors,” <i>IEEE Transactions on Automatic Control</i>, vol. 63, no. 5, pp. 1465–1471, 2017."},"type":"journal_article","department":[{"_id":"355"}],"date_created":"2021-09-10T10:19:40Z","date_updated":"2022-01-06T06:56:08Z","intvolume":"        63","status":"public","year":"2017","title":"Analysis of gradient descent methods with nondiminishing bounded errors","author":[{"id":"66937","first_name":"Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","full_name":"Ramaswamy, Arunselvan"},{"full_name":"Bhatnagar, Shalabh","first_name":"Shalabh","last_name":"Bhatnagar"}],"user_id":"66937","volume":63,"page":"1465-1471","language":[{"iso":"eng"}],"_id":"24152","publisher":"IEEE"},{"extern":"1","citation":{"ama":"Ramaswamy A, Bhatnagar S. A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions. <i>Mathematics of Operations Research</i>. 2017;42(3):648-661.","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} }","mla":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive Inclusions.” <i>Mathematics of Operations Research</i>, vol. 42, no. 3, INFORMS, 2017, pp. 648–61.","chicago":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive Inclusions.” <i>Mathematics of Operations Research</i> 42, no. 3 (2017): 648–61.","short":"A. Ramaswamy, S. Bhatnagar, Mathematics of Operations Research 42 (2017) 648–661.","apa":"Ramaswamy, A., &#38; Bhatnagar, S. (2017). A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions. <i>Mathematics of Operations Research</i>, <i>42</i>(3), 648–661.","ieee":"A. Ramaswamy and S. Bhatnagar, “A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions,” <i>Mathematics of Operations Research</i>, vol. 42, no. 3, pp. 648–661, 2017."},"issue":"3","publication":"Mathematics of Operations Research","department":[{"_id":"355"}],"type":"journal_article","date_created":"2021-09-10T10:21:02Z","intvolume":"        42","date_updated":"2022-01-06T06:56:08Z","author":[{"id":"66937","last_name":"Ramaswamy","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"}],"year":"2017","title":"A generalization of the Borkar-Meyn theorem for stochastic recursive inclusions","status":"public","volume":42,"user_id":"66937","language":[{"iso":"eng"}],"_id":"24153","publisher":"INFORMS","page":"648-661"},{"project":[{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"}],"file_date_updated":"2018-11-30T09:47:59Z","publication":"Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017","citation":{"mla":"Melnikov, Vitalik, and Eyke Hüllermeier. “Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics.” <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>, KIT Scientific Publishing, 2017, doi:<a href=\"https://doi.org/10.5445/KSP/1000074341\">10.5445/KSP/1000074341</a>.","ama":"Melnikov V, Hüllermeier E. Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics. In: <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>. KIT Scientific Publishing; 2017. doi:<a href=\"https://doi.org/10.5445/KSP/1000074341\">10.5445/KSP/1000074341</a>","bibtex":"@inproceedings{Melnikov_Hüllermeier_2017, title={Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics}, DOI={<a href=\"https://doi.org/10.5445/KSP/1000074341\">10.5445/KSP/1000074341</a>}, booktitle={Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017}, publisher={KIT Scientific Publishing}, author={Melnikov, Vitalik and Hüllermeier, Eyke}, year={2017} }","apa":"Melnikov, V., &#38; Hüllermeier, E. (2017). Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics. In <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>. KIT Scientific Publishing. <a href=\"https://doi.org/10.5445/KSP/1000074341\">https://doi.org/10.5445/KSP/1000074341</a>","ieee":"V. Melnikov and E. Hüllermeier, “Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics,” in <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>, 2017.","short":"V. Melnikov, E. Hüllermeier, in: Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017, KIT Scientific Publishing, 2017.","chicago":"Melnikov, Vitalik, and Eyke Hüllermeier. “Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics.” In <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>. KIT Scientific Publishing, 2017. <a href=\"https://doi.org/10.5445/KSP/1000074341\">https://doi.org/10.5445/KSP/1000074341</a>."},"type":"conference","department":[{"_id":"355"}],"file":[{"success":1,"content_type":"application/pdf","file_id":"5987","access_level":"closed","file_size":1829552,"file_name":"main.pdf","date_updated":"2018-11-30T09:47:59Z","relation":"main_file","date_created":"2018-11-30T09:47:59Z","creator":"melnikov"}],"date_created":"2018-06-25T08:14:49Z","date_updated":"2022-01-06T06:59:10Z","has_accepted_license":"1","year":"2017","title":"Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics","status":"public","author":[{"last_name":"Melnikov","first_name":"Vitalik","full_name":"Melnikov, Vitalik"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"}],"user_id":"15504","doi":"10.5445/KSP/1000074341","ddc":["000"],"language":[{"iso":"eng"}],"_id":"3325","publisher":"KIT Scientific Publishing"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file_date_updated":"2018-03-21T13:04:12Z","citation":{"ama":"Jakobs M-C, Krämer J, van Straaten D, Lettmann T. Certification Matters for Service Markets. In: Marcelo De Barros, Janusz Klink,Tadeus Uhl TP, ed. <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>. ; 2017:7-12.","bibtex":"@inproceedings{Jakobs_Krämer_van Straaten_Lettmann_2017, title={Certification Matters for Service Markets}, booktitle={The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Jakobs, Marie-Christine and Krämer, Julia and van Straaten, Dirk and Lettmann, Theodor}, editor={Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas PrinzEditor}, year={2017}, pages={7–12} }","mla":"Jakobs, Marie-Christine, et al. “Certification Matters for Service Markets.” <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 2017, pp. 7–12.","chicago":"Jakobs, Marie-Christine, Julia Krämer, Dirk van Straaten, and Theodor Lettmann. “Certification Matters for Service Markets.” In <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 7–12, 2017.","short":"M.-C. Jakobs, J. Krämer, D. van Straaten, T. Lettmann, in: T.P. Marcelo De Barros, Janusz Klink,Tadeus Uhl (Ed.), The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2017, pp. 7–12.","apa":"Jakobs, M.-C., Krämer, J., van Straaten, D., &#38; Lettmann, T. (2017). Certification Matters for Service Markets. In T. P. Marcelo De Barros, Janusz Klink,Tadeus Uhl (Ed.), <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i> (pp. 7–12).","ieee":"M.-C. Jakobs, J. Krämer, D. van Straaten, and T. Lettmann, “Certification Matters for Service Markets,” in <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2017, pp. 7–12."},"ddc":["040"],"user_id":"477","editor":[{"first_name":"Thomas Prinz","last_name":"Marcelo De Barros, Janusz Klink,Tadeus Uhl","full_name":"Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas Prinz"}],"page":"7-12","_id":"115","has_accepted_license":"1","status":"public","type":"conference","department":[{"_id":"77"},{"_id":"355"},{"_id":"179"}],"file":[{"success":1,"content_type":"application/pdf","file_id":"1564","date_updated":"2018-03-21T13:04:12Z","relation":"main_file","file_size":133531,"access_level":"closed","file_name":"115-JakobsKraemerVanStraatenLettmann2017.pdf","date_created":"2018-03-21T13:04:12Z","creator":"florida"}],"date_created":"2017-10-17T12:41:14Z","abstract":[{"lang":"eng","text":"Whenever customers have to decide between different instances of the same product, they are interested in buying the best product. In contrast, companies are interested in reducing the construction effort (and usually as a consequence thereof, the quality) to gain profit. The described setting is widely known as opposed preferences in quality of the product and also applies to the context of service-oriented computing. In general, service-oriented computing emphasizes the construction of large software systems out of existing services, where services are small and self-contained pieces of software that adhere to a specified interface. Several implementations of the same interface are considered as several instances of the same service. Thereby, customers are interested in buying the best service implementation for their service composition wrt. to metrics, such as costs, energy, memory consumption, or execution time. One way to ensure the service quality is to employ certificates, which can come in different kinds: Technical certificates proving correctness can be automatically constructed by the service provider and again be automatically checked by the user. Digital certificates allow proof of the integrity of a product. Other certificates might be rolled out if service providers follow a good software construction principle, which is checked in annual audits. Whereas all of these certificates are handled differently in service markets, what they have in common is that they influence the buying decisions of customers. In this paper, we review state-of-the-art developments in certification with respect to service-oriented computing. We not only discuss how certificates are constructed and handled in service-oriented computing but also review the effects of certificates on the market from an economic perspective."}],"publication":"The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:02Z","title":"Certification Matters for Service Markets","year":"2017","author":[{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"full_name":"Krämer, Julia","last_name":"Krämer","first_name":"Julia"},{"id":"10311","full_name":"van Straaten, Dirk","last_name":"van Straaten","first_name":"Dirk"},{"id":"315","full_name":"Lettmann, Theodor","first_name":"Theodor","last_name":"Lettmann","orcid":"0000-0001-5859-2457"}]},{"abstract":[{"text":"In this paper, we present the annotation challenges we have encountered when working on a historical language that was undergoing elaboration processes. We especially focus on syntactic ambiguity and gradience in Middle Low German, which causes uncertainty to some extent. Since current annotation tools consider construction contexts and the dynamics of the grammaticalization only partially, we plan to extend CorA – a web-based annotation tool for historical and other non-standard language data – to capture elaboration phenomena and annotator unsureness. Moreover, we seek to interactively learn morphological as well as syntactic annotations.","lang":"eng"}],"publication":"Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature","type":"conference","department":[{"_id":"36"},{"_id":"579"},{"_id":"115"},{"_id":"355"},{"_id":"615"}],"date_created":"2018-01-31T15:32:33Z","date_updated":"2022-01-06T06:51:03Z","publication_status":"published","year":"2017","title":"Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German","author":[{"full_name":"Seemann, Nina","first_name":"Nina","last_name":"Seemann","id":"65408"},{"last_name":"Merten","first_name":"Marie-Luis","full_name":"Merten, Marie-Luis"},{"id":"42496","full_name":"Geierhos, Michaela","first_name":"Michaela","orcid":"0000-0002-8180-5606","last_name":"Geierhos"},{"full_name":"Tophinke, Doris","first_name":"Doris","last_name":"Tophinke"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier"}],"doi":"10.18653/v1/W17-2206","language":[{"iso":"eng"}],"quality_controlled":"1","project":[{"_id":"39","name":"InterGramm"}],"citation":{"chicago":"Seemann, Nina, Marie-Luis Merten, Michaela Geierhos, Doris Tophinke, and Eyke Hüllermeier. “Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German.” In <i>Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature</i>, 40–45. Stroudsburg, PA, USA: Association for Computational Linguistics (ACL), 2017. <a href=\"https://doi.org/10.18653/v1/W17-2206\">https://doi.org/10.18653/v1/W17-2206</a>.","short":"N. Seemann, M.-L. Merten, M. Geierhos, D. Tophinke, E. Hüllermeier, in: Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature, Association for Computational Linguistics (ACL), Stroudsburg, PA, USA, 2017, pp. 40–45.","ieee":"N. Seemann, M.-L. Merten, M. Geierhos, D. Tophinke, and E. Hüllermeier, “Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German,” in <i>Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature</i>, Vancouver, BC, Canada, 2017, pp. 40–45.","apa":"Seemann, N., Merten, M.-L., Geierhos, M., Tophinke, D., &#38; Hüllermeier, E. (2017). Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German. In <i>Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature</i> (pp. 40–45). Stroudsburg, PA, USA: Association for Computational Linguistics (ACL). <a href=\"https://doi.org/10.18653/v1/W17-2206\">https://doi.org/10.18653/v1/W17-2206</a>","bibtex":"@inproceedings{Seemann_Merten_Geierhos_Tophinke_Hüllermeier_2017, place={Stroudsburg, PA, USA}, title={Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German}, DOI={<a href=\"https://doi.org/10.18653/v1/W17-2206\">10.18653/v1/W17-2206</a>}, booktitle={Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature}, publisher={Association for Computational Linguistics (ACL)}, author={Seemann, Nina and Merten, Marie-Luis and Geierhos, Michaela and Tophinke, Doris and Hüllermeier, Eyke}, year={2017}, pages={40–45} }","ama":"Seemann N, Merten M-L, Geierhos M, Tophinke D, Hüllermeier E. Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German. In: <i>Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature</i>. Stroudsburg, PA, USA: Association for Computational Linguistics (ACL); 2017:40-45. doi:<a href=\"https://doi.org/10.18653/v1/W17-2206\">10.18653/v1/W17-2206</a>","mla":"Seemann, Nina, et al. “Annotation Challenges for Reconstructing the Structural Elaboration of Middle Low German.” <i>Proceedings of the Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature</i>, Association for Computational Linguistics (ACL), 2017, pp. 40–45, doi:<a href=\"https://doi.org/10.18653/v1/W17-2206\">10.18653/v1/W17-2206</a>."},"place":"Stroudsburg, PA, USA","status":"public","conference":{"name":"Joint SIGHUM Workshop on Computational Linguistics for Cultural Heritage, Social Sciences, Humanities and Literature (LaTeCH-CLfL 2017)","start_date":"2017-07-31","location":"Vancouver, BC, Canada","end_date":"2017-08-04"},"user_id":"13929","page":"40-45","publisher":"Association for Computational Linguistics (ACL)","_id":"1158"},{"user_id":"477","_id":"5694","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:02:35Z","status":"public","year":"2017","title":"Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies","author":[{"full_name":"Schnitker, Nino Noel","first_name":"Nino Noel","last_name":"Schnitker"}],"type":"bachelorsthesis","department":[{"_id":"355"}],"date_created":"2018-11-15T08:10:48Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"supervisor":[{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"citation":{"ama":"Schnitker NN. <i>Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies</i>. Universität Paderborn; 2017.","bibtex":"@book{Schnitker_2017, title={Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies}, publisher={Universität Paderborn}, author={Schnitker, Nino Noel}, year={2017} }","mla":"Schnitker, Nino Noel. <i>Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies</i>. Universität Paderborn, 2017.","chicago":"Schnitker, Nino Noel. <i>Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies</i>. Universität Paderborn, 2017.","short":"N.N. Schnitker, Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies, Universität Paderborn, 2017.","apa":"Schnitker, N. N. (2017). <i>Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies</i>. Universität Paderborn.","ieee":"N. N. Schnitker, <i>Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies</i>. Universität Paderborn, 2017."}},{"date_created":"2018-11-19T07:32:31Z","department":[{"_id":"355"}],"type":"conference_abstract","citation":{"short":"P. Gupta, A. Hetzer, T. Tornede, S. Gottschalk, A. Kornelsen, S. Osterbrink, K. Pfannschmidt, E. Hüllermeier, in: 2017.","chicago":"Gupta, Pritha, Alexander Hetzer, Tanja Tornede, Sebastian Gottschalk, Andreas Kornelsen, Sebastian Osterbrink, Karlson Pfannschmidt, and Eyke Hüllermeier. “JPL: A Java-Based Software Framework for Preference Learning,” 2017.","apa":"Gupta, P., Hetzer, A., Tornede, T., Gottschalk, S., Kornelsen, A., Osterbrink, S., … Hüllermeier, E. (2017). jPL: A Java-based Software Framework for Preference Learning. Presented at the WDA 2017 Workshops: KDML, FGWM, IR, and FGDB, Rostock.","ieee":"P. Gupta <i>et al.</i>, “jPL: A Java-based Software Framework for Preference Learning,” presented at the WDA 2017 Workshops: KDML, FGWM, IR, and FGDB, Rostock, 2017.","ama":"Gupta P, Hetzer A, Tornede T, et al. jPL: A Java-based Software Framework for Preference Learning. In: ; 2017.","bibtex":"@inproceedings{Gupta_Hetzer_Tornede_Gottschalk_Kornelsen_Osterbrink_Pfannschmidt_Hüllermeier_2017, title={jPL: A Java-based Software Framework for Preference Learning}, author={Gupta, Pritha and Hetzer, Alexander and Tornede, Tanja and Gottschalk, Sebastian and Kornelsen, Andreas and Osterbrink, Sebastian and Pfannschmidt, Karlson and Hüllermeier, Eyke}, year={2017} }","mla":"Gupta, Pritha, et al. <i>JPL: A Java-Based Software Framework for Preference Learning</i>. 2017."},"extern":"1","language":[{"iso":"eng"}],"_id":"5722","user_id":"38209","conference":{"start_date":"11.09.2017","name":"WDA 2017 Workshops: KDML, FGWM, IR, and FGDB","location":"Rostock","end_date":"13.09.2017"},"author":[{"full_name":"Gupta, Pritha","last_name":"Gupta","first_name":"Pritha"},{"id":"38209","last_name":"Hetzer","first_name":"Alexander","full_name":"Hetzer, Alexander"},{"full_name":"Tornede, Tanja","first_name":"Tanja","last_name":"Tornede"},{"full_name":"Gottschalk, Sebastian","last_name":"Gottschalk","first_name":"Sebastian"},{"first_name":"Andreas","last_name":"Kornelsen","full_name":"Kornelsen, Andreas"},{"full_name":"Osterbrink, Sebastian","last_name":"Osterbrink","first_name":"Sebastian"},{"first_name":"Karlson","last_name":"Pfannschmidt","full_name":"Pfannschmidt, Karlson"},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"status":"public","title":"jPL: A Java-based Software Framework for Preference Learning","year":"2017","date_updated":"2022-01-06T07:02:37Z"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"supervisor":[{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"id":"48129","last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"full_name":"Tierney, Kevin","last_name":"Tierney","first_name":"Kevin"}],"citation":{"mla":"Hetzer, Alexander, and Tanja Tornede. <i>Solving the Container Pre-Marshalling Problem Using Reinforcement Learning and Structured Output Prediction</i>. Universität Paderborn, 2017.","ama":"Hetzer A, Tornede T. <i>Solving the Container Pre-Marshalling Problem Using Reinforcement Learning and Structured Output Prediction</i>. Universität Paderborn; 2017.","bibtex":"@book{Hetzer_Tornede_2017, title={Solving the Container Pre-Marshalling Problem using Reinforcement Learning and Structured Output Prediction}, publisher={Universität Paderborn}, author={Hetzer, Alexander and Tornede, Tanja}, year={2017} }","apa":"Hetzer, A., &#38; Tornede, T. (2017). <i>Solving the Container Pre-Marshalling Problem using Reinforcement Learning and Structured Output Prediction</i>. Universität Paderborn.","ieee":"A. Hetzer and T. Tornede, <i>Solving the Container Pre-Marshalling Problem using Reinforcement Learning and Structured Output Prediction</i>. Universität Paderborn, 2017.","chicago":"Hetzer, Alexander, and Tanja Tornede. <i>Solving the Container Pre-Marshalling Problem Using Reinforcement Learning and Structured Output Prediction</i>. Universität Paderborn, 2017.","short":"A. Hetzer, T. Tornede, Solving the Container Pre-Marshalling Problem Using Reinforcement Learning and Structured Output Prediction, Universität Paderborn, 2017."},"department":[{"_id":"355"},{"_id":"199"}],"type":"mastersthesis","date_created":"2018-11-19T07:49:13Z","date_updated":"2022-01-06T07:02:37Z","author":[{"id":"38209","full_name":"Hetzer, Alexander","first_name":"Alexander","last_name":"Hetzer"},{"first_name":"Tanja","last_name":"Tornede","full_name":"Tornede, Tanja"}],"year":"2017","title":"Solving the Container Pre-Marshalling Problem using Reinforcement Learning and Structured Output Prediction","status":"public","user_id":"477","language":[{"iso":"eng"}],"_id":"5724","publisher":"Universität Paderborn"},{"department":[{"_id":"355"},{"_id":"77"}],"type":"conference","date_created":"2017-10-17T12:41:05Z","file":[{"file_id":"5271","content_type":"application/pdf","success":1,"file_name":"fsews17swan-swanmain1.pdf","access_level":"closed","file_size":822383,"relation":"main_file","date_updated":"2018-11-02T14:24:29Z","date_created":"2018-11-02T14:24:29Z","creator":"ups"}],"abstract":[{"text":"Today, software verification tools have reached the maturity to be used for large scale programs. Different tools perform differently well on varying code. A software developer is hence faced with the problem of choosing a tool appropriate for her program at hand. A ranking of tools on programs could facilitate the choice. Such rankings can, however, so far only be obtained by running all considered tools on the program.In this paper, we present a machine learning approach to predicting rankings of tools on programs. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for programs. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from the software verification competition SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy (rank correlation > 0.6).","lang":"eng"}],"publication":"Proceedings of the 3rd International Workshop on Software Analytics","doi":"10.1145/3121257.3121262","series_title":"SWAN'17","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:28Z","author":[{"full_name":"Czech, Mike","last_name":"Czech","first_name":"Mike"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"title":"Predicting Rankings of Software Verification Tools","year":"2017","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"citation":{"mla":"Czech, Mike, et al. “Predicting Rankings of Software Verification Tools.” <i>Proceedings of the 3rd International Workshop on Software Analytics</i>, 2017, pp. 23–26, doi:<a href=\"https://doi.org/10.1145/3121257.3121262\">10.1145/3121257.3121262</a>.","apa":"Czech, M., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (2017). Predicting Rankings of Software Verification Tools. In <i>Proceedings of the 3rd International Workshop on Software Analytics</i> (pp. 23–26). <a href=\"https://doi.org/10.1145/3121257.3121262\">https://doi.org/10.1145/3121257.3121262</a>","ieee":"M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Predicting Rankings of Software Verification Tools,” in <i>Proceedings of the 3rd International Workshop on Software Analytics</i>, 2017, pp. 23–26.","chicago":"Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. “Predicting Rankings of Software Verification Tools.” In <i>Proceedings of the 3rd International Workshop on Software Analytics</i>, 23–26. SWAN’17, 2017. <a href=\"https://doi.org/10.1145/3121257.3121262\">https://doi.org/10.1145/3121257.3121262</a>.","short":"M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26.","ama":"Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software Verification Tools. In: <i>Proceedings of the 3rd International Workshop on Software Analytics</i>. SWAN’17. ; 2017:23-26. doi:<a href=\"https://doi.org/10.1145/3121257.3121262\">10.1145/3121257.3121262</a>","bibtex":"@inproceedings{Czech_Hüllermeier_Jakobs_Wehrheim_2017, series={SWAN’17}, title={Predicting Rankings of Software Verification Tools}, DOI={<a href=\"https://doi.org/10.1145/3121257.3121262\">10.1145/3121257.3121262</a>}, booktitle={Proceedings of the 3rd International Workshop on Software Analytics}, author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={23–26}, collection={SWAN’17} }"},"file_date_updated":"2018-11-02T14:24:29Z","ddc":["000"],"user_id":"15504","_id":"71","page":"23-26","has_accepted_license":"1","status":"public"},{"language":[{"iso":"eng"}],"_id":"72","ddc":["000"],"user_id":"15504","author":[{"first_name":"Mike","last_name":"Czech","full_name":"Czech, Mike"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"},{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"title":"Predicting Rankings of Software Verification Competitions","year":"2017","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T07:03:29Z","date_created":"2017-10-17T12:41:05Z","file":[{"content_type":"application/pdf","success":1,"file_id":"5782","access_level":"closed","file_size":869984,"file_name":"Predicting Rankings of Soware Verification Competitions.pdf","date_updated":"2018-11-21T10:50:11Z","relation":"main_file","date_created":"2018-11-21T10:50:11Z","creator":"florida"}],"department":[{"_id":"77"},{"_id":"355"}],"type":"report","citation":{"mla":"Czech, Mike, et al. <i>Predicting Rankings of Software Verification Competitions</i>. 2017.","ama":"Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. <i>Predicting Rankings of Software Verification Competitions</i>.; 2017.","bibtex":"@book{Czech_Hüllermeier_Jakobs_Wehrheim_2017, title={Predicting Rankings of Software Verification Competitions}, author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017} }","apa":"Czech, M., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (2017). <i>Predicting Rankings of Software Verification Competitions</i>.","ieee":"M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, <i>Predicting Rankings of Software Verification Competitions</i>. 2017.","chicago":"Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. <i>Predicting Rankings of Software Verification Competitions</i>, 2017.","short":"M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Predicting Rankings of Software Verification Competitions, 2017."},"file_date_updated":"2018-11-21T10:50:11Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"abstract":[{"lang":"eng","text":"Software verification competitions, such as the annual SV-COMP, evaluate software verification tools with respect to their effectivity and efficiency. Typically, the outcome of a competition is a (possibly category-specific) ranking of the tools. For many applications, such as building portfolio solvers, it would be desirable to have an idea of the (relative) performance of verification tools on a given verification task beforehand, i.e., prior to actually running all tools on the task.In this paper, we present a machine learning approach to predicting rankings of tools on verification tasks. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for verification tasks. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy. In particular, our method outperforms a recently proposed feature-based approach of Demyanova et al. (when applied to rank predictions). "}]},{"type":"encyclopedia_article","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"date_created":"2019-07-09T15:37:09Z","publication":"Encyclopedia of Machine Learning and Data Mining","citation":{"chicago":"Fürnkranz, J., and Eyke Hüllermeier. “Preference Learning.” In <i>Encyclopedia of Machine Learning and Data Mining</i>, 1000–1005, 2017.","short":"J. Fürnkranz, E. Hüllermeier, in: Encyclopedia of Machine Learning and Data Mining, 2017, pp. 1000–1005.","apa":"Fürnkranz, J., &#38; Hüllermeier, E. (2017). Preference Learning. In <i>Encyclopedia of Machine Learning and Data Mining</i> (pp. 1000–1005).","ieee":"J. Fürnkranz and E. Hüllermeier, “Preference Learning,” in <i>Encyclopedia of Machine Learning and Data Mining</i>, 2017, pp. 1000–1005.","ama":"Fürnkranz J, Hüllermeier E. Preference Learning. In: <i>Encyclopedia of Machine Learning and Data Mining</i>. ; 2017:1000-1005.","bibtex":"@inbook{Fürnkranz_Hüllermeier_2017, title={Preference Learning}, booktitle={Encyclopedia of Machine Learning and Data Mining}, author={Fürnkranz, J. and Hüllermeier, Eyke}, year={2017}, pages={1000–1005} }","mla":"Fürnkranz, J., and Eyke Hüllermeier. “Preference Learning.” <i>Encyclopedia of Machine Learning and Data Mining</i>, 2017, pp. 1000–05."},"user_id":"49109","page":"1000-1005","_id":"10589","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:45Z","status":"public","year":"2017","title":"Preference Learning","author":[{"first_name":"J.","last_name":"Fürnkranz","full_name":"Fürnkranz, J."},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke","id":"48129"}]},{"publication":"Encyclopedia of Machine Learning and Data Mining","citation":{"mla":"Fürnkranz, J., and Eyke Hüllermeier. “Preference Learning.” <i>Encyclopedia of Machine Learning and Data Mining</i>, edited by C. Sammut and G.I. Webb, vol. 107, Springer, 2017, pp. 1000–05.","bibtex":"@inbook{Fürnkranz_Hüllermeier_2017, title={Preference Learning}, volume={107}, booktitle={Encyclopedia of Machine Learning and Data Mining}, publisher={Springer}, author={Fürnkranz, J. and Hüllermeier, Eyke}, editor={Sammut, C. and Webb, G.I.Editors}, year={2017}, pages={1000–1005} }","ama":"Fürnkranz J, Hüllermeier E. Preference Learning. In: Sammut C, Webb GI, eds. <i>Encyclopedia of Machine Learning and Data Mining</i>. Vol 107. Springer; 2017:1000-1005.","ieee":"J. Fürnkranz and E. Hüllermeier, “Preference Learning,” in <i>Encyclopedia of Machine Learning and Data Mining</i>, vol. 107, C. Sammut and G. I. Webb, Eds. Springer, 2017, pp. 1000–1005.","apa":"Fürnkranz, J., &#38; Hüllermeier, E. (2017). Preference Learning. In C. Sammut &#38; G. I. Webb (Eds.), <i>Encyclopedia of Machine Learning and Data Mining</i> (Vol. 107, pp. 1000–1005). Springer.","chicago":"Fürnkranz, J., and Eyke Hüllermeier. “Preference Learning.” In <i>Encyclopedia of Machine Learning and Data Mining</i>, edited by C. Sammut and G.I. Webb, 107:1000–1005. Springer, 2017.","short":"J. Fürnkranz, E. Hüllermeier, in: C. Sammut, G.I. Webb (Eds.), Encyclopedia of Machine Learning and Data Mining, Springer, 2017, pp. 1000–1005."},"type":"book_chapter","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"date_created":"2019-07-10T15:44:32Z","date_updated":"2022-01-06T06:50:50Z","intvolume":"       107","title":"Preference Learning","status":"public","year":"2017","author":[{"full_name":"Fürnkranz, J.","last_name":"Fürnkranz","first_name":"J."},{"id":"48129","first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"}],"user_id":"49109","editor":[{"full_name":"Sammut, C.","first_name":"C.","last_name":"Sammut"},{"last_name":"Webb","first_name":"G.I.","full_name":"Webb, G.I."}],"volume":107,"page":"1000-1005","language":[{"iso":"eng"}],"_id":"10784","publisher":"Springer"},{"date_created":"2018-02-22T07:19:18Z","file":[{"date_created":"2018-11-06T15:28:09Z","creator":"wever","file_id":"5387","success":1,"content_type":"application/pdf","file_name":"CI Workshop AutoML.pdf","file_size":323589,"access_level":"closed","relation":"main_file","date_updated":"2018-11-06T15:28:09Z"}],"department":[{"_id":"355"}],"type":"conference","publication":"27th Workshop Computational Intelligence","abstract":[{"text":"These days, there is a strong rise in the needs for machine learning applications, requiring an automation of machine learning engineering which is referred to as AutoML. In AutoML the selection, composition and parametrization of machine learning algorithms is automated and tailored to a specific problem, resulting in a machine learning pipeline. Current approaches reduce the AutoML problem to optimization of hyperparameters. Based on recursive task networks, in this paper we present one approach from the field of automated planning and one evolutionary optimization approach. Instead of simply parametrizing a given pipeline, this allows for structure optimization of machine learning pipelines, as well. We evaluate the two approaches in an extensive evaluation, finding both approaches to have their strengths in different areas. Moreover, the two approaches outperform the state-of-the-art tool Auto-WEKA in many settings.","lang":"eng"}],"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://publikationen.bibliothek.kit.edu/1000074341/4643874","open_access":"1"}],"author":[{"full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","last_name":"Wever","id":"33176"},{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"title":"Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization","year":"2017","publication_status":"published","date_updated":"2022-01-06T06:51:09Z","place":"Dortmund","oa":"1","citation":{"mla":"Wever, Marcel Dominik, et al. “Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization.” <i>27th Workshop Computational Intelligence</i>, 2017.","bibtex":"@inproceedings{Wever_Mohr_Hüllermeier_2017, place={Dortmund}, title={Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization}, booktitle={27th Workshop Computational Intelligence}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2017} }","ama":"Wever MD, Mohr F, Hüllermeier E. Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization. In: <i>27th Workshop Computational Intelligence</i>. Dortmund; 2017.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization,” in <i>27th Workshop Computational Intelligence</i>, Dortmund, 2017.","apa":"Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2017). Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization. In <i>27th Workshop Computational Intelligence</i>. Dortmund.","short":"M.D. Wever, F. Mohr, E. Hüllermeier, in: 27th Workshop Computational Intelligence, Dortmund, 2017.","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization.” In <i>27th Workshop Computational Intelligence</i>. Dortmund, 2017."},"file_date_updated":"2018-11-06T15:28:09Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"_id":"1180","user_id":"49109","ddc":["000"],"conference":{"end_date":"2017-11-24","location":"Dortmund","name":"27th Workshop Computational Intelligence","start_date":"2017-11-23"},"status":"public","has_accepted_license":"1"}]