[{"doi":"10.1109/ivs.2019.8814100","_id":"15009","date_updated":"2022-01-06T06:52:14Z","year":"2019","citation":{"short":"N. Epple, S. Dari, L. Drees, V. Protschky, A. Riener, in: 2019 IEEE Intelligent Vehicles Symposium (IV), 2019.","ieee":"N. Epple, S. Dari, L. Drees, V. Protschky, and A. Riener, “Influence of Cruise Control on Driver Guidance - a Comparison between System Generations and Countries,” in 2019 IEEE Intelligent Vehicles Symposium (IV), 2019.","apa":"Epple, N., Dari, S., Drees, L., Protschky, V., & Riener, A. (2019). Influence of Cruise Control on Driver Guidance - a Comparison between System Generations and Countries. In 2019 IEEE Intelligent Vehicles Symposium (IV). https://doi.org/10.1109/ivs.2019.8814100","ama":"Epple N, Dari S, Drees L, Protschky V, Riener A. Influence of Cruise Control on Driver Guidance - a Comparison between System Generations and Countries. In: 2019 IEEE Intelligent Vehicles Symposium (IV). ; 2019. doi:10.1109/ivs.2019.8814100","chicago":"Epple, Nico, Simone Dari, Ludwig Drees, Valentin Protschky, and Andreas Riener. “Influence of Cruise Control on Driver Guidance - a Comparison between System Generations and Countries.” In 2019 IEEE Intelligent Vehicles Symposium (IV), 2019. https://doi.org/10.1109/ivs.2019.8814100.","mla":"Epple, Nico, et al. “Influence of Cruise Control on Driver Guidance - a Comparison between System Generations and Countries.” 2019 IEEE Intelligent Vehicles Symposium (IV), 2019, doi:10.1109/ivs.2019.8814100.","bibtex":"@inproceedings{Epple_Dari_Drees_Protschky_Riener_2019, title={Influence of Cruise Control on Driver Guidance - a Comparison between System Generations and Countries}, DOI={10.1109/ivs.2019.8814100}, booktitle={2019 IEEE Intelligent Vehicles Symposium (IV)}, author={Epple, Nico and Dari, Simone and Drees, Ludwig and Protschky, Valentin and Riener, Andreas}, year={2019} }"},"type":"conference","language":[{"iso":"eng"}],"title":"Influence of Cruise Control on Driver Guidance - a Comparison between System Generations and Countries","user_id":"315","publication_status":"published","publication_identifier":{"isbn":["9781728105604"]},"status":"public","date_created":"2019-11-15T10:54:04Z","author":[{"last_name":"Epple","first_name":"Nico","full_name":"Epple, Nico"},{"last_name":"Dari","first_name":"Simone","full_name":"Dari, Simone"},{"first_name":"Ludwig","full_name":"Drees, Ludwig","last_name":"Drees"},{"last_name":"Protschky","full_name":"Protschky, Valentin","first_name":"Valentin"},{"full_name":"Riener, Andreas","first_name":"Andreas","last_name":"Riener"}],"department":[{"_id":"34"},{"_id":"355"}],"publication":"2019 IEEE Intelligent Vehicles Symposium (IV)"},{"ddc":["006"],"user_id":"38209","status":"public","has_accepted_license":"1","date_created":"2019-11-15T13:29:25Z","publisher":"KIT Scientific Publishing, Karlsruhe","author":[{"full_name":"Tornede, Alexander","first_name":"Alexander","id":"38209","last_name":"Tornede"},{"id":"33176","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"}],"publication":"Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019","file_date_updated":"2020-05-25T08:01:31Z","file":[{"date_created":"2020-05-25T08:01:31Z","file_name":"ci_workshop_tornede.pdf","access_level":"open_access","file_id":"17060","creator":"ahetzer","file_size":468825,"relation":"main_file","date_updated":"2020-05-25T08:01:31Z","content_type":"application/pdf"}],"_id":"15011","conference":{"end_date":"2019-11-29","name":"29. Workshop Computational Intelligence","start_date":"2019-11-28","location":"Dortmund"},"citation":{"ieee":"A. Tornede, M. D. Wever, and E. Hüllermeier, “Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking,” in Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019, Dortmund, 2019, pp. 135–146.","short":"A. Tornede, M.D. Wever, E. Hüllermeier, in: F. Hoffmann, E. Hüllermeier, R. Mikut (Eds.), Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019, KIT Scientific Publishing, Karlsruhe, 2019, pp. 135–146.","bibtex":"@inproceedings{Tornede_Wever_Hüllermeier_2019, title={Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking}, booktitle={Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019}, publisher={KIT Scientific Publishing, Karlsruhe}, author={Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, editor={Hoffmann, Frank and Hüllermeier, Eyke and Mikut, RalfEditors}, year={2019}, pages={135–146} }","mla":"Tornede, Alexander, et al. “Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking.” Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019, edited by Frank Hoffmann et al., KIT Scientific Publishing, Karlsruhe, 2019, pp. 135–46.","apa":"Tornede, A., Wever, M. D., & Hüllermeier, E. (2019). Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking. In F. Hoffmann, E. Hüllermeier, & R. Mikut (Eds.), Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019 (pp. 135–146). Dortmund: KIT Scientific Publishing, Karlsruhe.","ama":"Tornede A, Wever MD, Hüllermeier E. Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking. In: Hoffmann F, Hüllermeier E, Mikut R, eds. Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019. KIT Scientific Publishing, Karlsruhe; 2019:135-146.","chicago":"Tornede, Alexander, Marcel Dominik Wever, and Eyke Hüllermeier. “Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking.” In Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019, edited by Frank Hoffmann, Eyke Hüllermeier, and Ralf Mikut, 135–46. KIT Scientific Publishing, Karlsruhe, 2019."},"year":"2019","type":"conference","page":"135-146","title":"Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking","editor":[{"first_name":"Frank","full_name":"Hoffmann, Frank","last_name":"Hoffmann"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier"},{"first_name":"Ralf","full_name":"Mikut, Ralf","last_name":"Mikut"}],"publication_identifier":{"isbn":["978-3-7315-0979-0"]},"publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"department":[{"_id":"355"}],"oa":"1","date_updated":"2022-01-06T06:52:14Z","language":[{"iso":"eng"}]},{"date_created":"2019-11-18T07:26:43Z","status":"public","publication":"Proceedings ECML/PKDD, European Conference on Machine Learning and Knowledge Discovery in Databases","department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"author":[{"full_name":"Brinker, Klaus","first_name":"Klaus","last_name":"Brinker"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"}],"user_id":"315","title":"A Reduction of Label Ranking to Multiclass Classification","place":"Würzburg, Germany","language":[{"iso":"eng"}],"citation":{"short":"K. Brinker, E. Hüllermeier, in: Proceedings ECML/PKDD, European Conference on Machine Learning and Knowledge Discovery in Databases, Würzburg, Germany, 2019.","ieee":"K. Brinker and E. Hüllermeier, “A Reduction of Label Ranking to Multiclass Classification,” in Proceedings ECML/PKDD, European Conference on Machine Learning and Knowledge Discovery in Databases, 2019.","ama":"Brinker K, Hüllermeier E. A Reduction of Label Ranking to Multiclass Classification. In: Proceedings ECML/PKDD, European Conference on Machine Learning and Knowledge Discovery in Databases. Würzburg, Germany; 2019.","apa":"Brinker, K., & Hüllermeier, E. (2019). A Reduction of Label Ranking to Multiclass Classification. In Proceedings ECML/PKDD, European Conference on Machine Learning and Knowledge Discovery in Databases. Würzburg, Germany.","chicago":"Brinker, Klaus, and Eyke Hüllermeier. “A Reduction of Label Ranking to Multiclass Classification.” In Proceedings ECML/PKDD, European Conference on Machine Learning and Knowledge Discovery in Databases. Würzburg, Germany, 2019.","mla":"Brinker, Klaus, and Eyke Hüllermeier. “A Reduction of Label Ranking to Multiclass Classification.” Proceedings ECML/PKDD, European Conference on Machine Learning and Knowledge Discovery in Databases, 2019.","bibtex":"@inproceedings{Brinker_Hüllermeier_2019, place={Würzburg, Germany}, title={A Reduction of Label Ranking to Multiclass Classification}, booktitle={Proceedings ECML/PKDD, European Conference on Machine Learning and Knowledge Discovery in Databases}, author={Brinker, Klaus and Hüllermeier, Eyke}, year={2019} }"},"year":"2019","type":"conference","date_updated":"2022-01-06T06:52:14Z","_id":"15013"},{"status":"public","date_created":"2019-11-18T07:38:13Z","author":[{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"},{"first_name":"Ines","full_name":"Couso, Ines","last_name":"Couso"},{"first_name":"Sebastian","full_name":"Diestercke, Sebastian","last_name":"Diestercke"}],"department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"publication":"Proceedings SUM 2019, International Conference on Scalable Uncertainty Management","title":"Learning from Imprecise Data: Adjustments of Optimistic and Pessimistic Variants","user_id":"315","type":"conference","citation":{"ieee":"E. Hüllermeier, I. Couso, and S. Diestercke, “Learning from Imprecise Data: Adjustments of Optimistic and Pessimistic Variants,” in Proceedings SUM 2019, International Conference on Scalable Uncertainty Management, 2019.","short":"E. Hüllermeier, I. Couso, S. Diestercke, in: Proceedings SUM 2019, International Conference on Scalable Uncertainty Management, 2019.","bibtex":"@inproceedings{Hüllermeier_Couso_Diestercke_2019, title={Learning from Imprecise Data: Adjustments of Optimistic and Pessimistic Variants}, booktitle={Proceedings SUM 2019, International Conference on Scalable Uncertainty Management}, author={Hüllermeier, Eyke and Couso, Ines and Diestercke, Sebastian}, year={2019} }","mla":"Hüllermeier, Eyke, et al. “Learning from Imprecise Data: Adjustments of Optimistic and Pessimistic Variants.” Proceedings SUM 2019, International Conference on Scalable Uncertainty Management, 2019.","chicago":"Hüllermeier, Eyke, Ines Couso, and Sebastian Diestercke. “Learning from Imprecise Data: Adjustments of Optimistic and Pessimistic Variants.” In Proceedings SUM 2019, International Conference on Scalable Uncertainty Management, 2019.","ama":"Hüllermeier E, Couso I, Diestercke S. Learning from Imprecise Data: Adjustments of Optimistic and Pessimistic Variants. In: Proceedings SUM 2019, International Conference on Scalable Uncertainty Management. ; 2019.","apa":"Hüllermeier, E., Couso, I., & Diestercke, S. (2019). Learning from Imprecise Data: Adjustments of Optimistic and Pessimistic Variants. In Proceedings SUM 2019, International Conference on Scalable Uncertainty Management."},"year":"2019","language":[{"iso":"eng"}],"_id":"15014","date_updated":"2022-01-06T06:52:14Z"},{"publication_status":"published","publication_identifier":{"issn":["1556-4681"]},"status":"public","date_created":"2019-11-18T07:40:27Z","author":[{"first_name":"Sascha","full_name":"Henzgen, Sascha","last_name":"Henzgen"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"publication":"ACM Transactions on Knowledge Discovery from Data","title":"Mining Rank Data","user_id":"315","type":"journal_article","year":"2019","citation":{"chicago":"Henzgen, Sascha, and Eyke Hüllermeier. “Mining Rank Data.” ACM Transactions on Knowledge Discovery from Data, 2019, 1–36. https://doi.org/10.1145/3363572.","ama":"Henzgen S, Hüllermeier E. Mining Rank Data. ACM Transactions on Knowledge Discovery from Data. 2019:1-36. doi:10.1145/3363572","apa":"Henzgen, S., & Hüllermeier, E. (2019). Mining Rank Data. ACM Transactions on Knowledge Discovery from Data, 1–36. https://doi.org/10.1145/3363572","bibtex":"@article{Henzgen_Hüllermeier_2019, title={Mining Rank Data}, DOI={10.1145/3363572}, journal={ACM Transactions on Knowledge Discovery from Data}, author={Henzgen, Sascha and Hüllermeier, Eyke}, year={2019}, pages={1–36} }","mla":"Henzgen, Sascha, and Eyke Hüllermeier. “Mining Rank Data.” ACM Transactions on Knowledge Discovery from Data, 2019, pp. 1–36, doi:10.1145/3363572.","short":"S. Henzgen, E. Hüllermeier, ACM Transactions on Knowledge Discovery from Data (2019) 1–36.","ieee":"S. Henzgen and E. Hüllermeier, “Mining Rank Data,” ACM Transactions on Knowledge Discovery from Data, pp. 1–36, 2019."},"page":"1-36","language":[{"iso":"eng"}],"doi":"10.1145/3363572","date_updated":"2022-01-06T06:52:14Z","_id":"15015"},{"author":[{"last_name":"Bengs","id":"76599","first_name":"Viktor","full_name":"Bengs, Viktor"},{"full_name":"Eulert, Matthias","first_name":"Matthias","last_name":"Eulert"},{"last_name":"Holzmann","first_name":"Hajo","full_name":"Holzmann, Hajo"}],"department":[{"_id":"34"},{"_id":"355"}],"publication":"Journal of Multivariate Analysis","status":"public","date_created":"2019-10-30T14:22:57Z","publication_status":"published","publication_identifier":{"issn":["0047-259X"]},"user_id":"76599","title":"Asymptotic confidence sets for the jump curve in bivariate regression problems","language":[{"iso":"eng"}],"year":"2019","type":"journal_article","citation":{"mla":"Bengs, Viktor, et al. “Asymptotic Confidence Sets for the Jump Curve in Bivariate Regression Problems.” Journal of Multivariate Analysis, 2019, pp. 291–312, doi:10.1016/j.jmva.2019.02.017.","bibtex":"@article{Bengs_Eulert_Holzmann_2019, title={Asymptotic confidence sets for the jump curve in bivariate regression problems}, DOI={10.1016/j.jmva.2019.02.017}, journal={Journal of Multivariate Analysis}, author={Bengs, Viktor and Eulert, Matthias and Holzmann, Hajo}, year={2019}, pages={291–312} }","chicago":"Bengs, Viktor, Matthias Eulert, and Hajo Holzmann. “Asymptotic Confidence Sets for the Jump Curve in Bivariate Regression Problems.” Journal of Multivariate Analysis, 2019, 291–312. https://doi.org/10.1016/j.jmva.2019.02.017.","apa":"Bengs, V., Eulert, M., & Holzmann, H. (2019). Asymptotic confidence sets for the jump curve in bivariate regression problems. Journal of Multivariate Analysis, 291–312. https://doi.org/10.1016/j.jmva.2019.02.017","ama":"Bengs V, Eulert M, Holzmann H. Asymptotic confidence sets for the jump curve in bivariate regression problems. Journal of Multivariate Analysis. 2019:291-312. doi:10.1016/j.jmva.2019.02.017","ieee":"V. Bengs, M. Eulert, and H. Holzmann, “Asymptotic confidence sets for the jump curve in bivariate regression problems,” Journal of Multivariate Analysis, pp. 291–312, 2019.","short":"V. Bengs, M. Eulert, H. Holzmann, Journal of Multivariate Analysis (2019) 291–312."},"page":"291-312","_id":"14027","date_updated":"2022-01-06T06:51:52Z","doi":"10.1016/j.jmva.2019.02.017"},{"publication_identifier":{"issn":["1935-7524"]},"publication_status":"published","date_created":"2019-10-30T14:25:16Z","status":"public","department":[{"_id":"34"},{"_id":"355"}],"publication":"Electronic Journal of Statistics","author":[{"first_name":"Viktor","full_name":"Bengs, Viktor","last_name":"Bengs","id":"76599"},{"full_name":"Holzmann, Hajo","first_name":"Hajo","last_name":"Holzmann"}],"title":"Adaptive confidence sets for kink estimation","user_id":"76599","page":"1523-1579","year":"2019","citation":{"mla":"Bengs, Viktor, and Hajo Holzmann. “Adaptive Confidence Sets for Kink Estimation.” Electronic Journal of Statistics, 2019, pp. 1523–79, doi:10.1214/19-ejs1555.","bibtex":"@article{Bengs_Holzmann_2019, title={Adaptive confidence sets for kink estimation}, DOI={10.1214/19-ejs1555}, journal={Electronic Journal of Statistics}, author={Bengs, Viktor and Holzmann, Hajo}, year={2019}, pages={1523–1579} }","ama":"Bengs V, Holzmann H. Adaptive confidence sets for kink estimation. Electronic Journal of Statistics. 2019:1523-1579. doi:10.1214/19-ejs1555","apa":"Bengs, V., & Holzmann, H. (2019). Adaptive confidence sets for kink estimation. Electronic Journal of Statistics, 1523–1579. https://doi.org/10.1214/19-ejs1555","chicago":"Bengs, Viktor, and Hajo Holzmann. “Adaptive Confidence Sets for Kink Estimation.” Electronic Journal of Statistics, 2019, 1523–79. https://doi.org/10.1214/19-ejs1555.","ieee":"V. Bengs and H. Holzmann, “Adaptive confidence sets for kink estimation,” Electronic Journal of Statistics, pp. 1523–1579, 2019.","short":"V. Bengs, H. Holzmann, Electronic Journal of Statistics (2019) 1523–1579."},"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1214/19-ejs1555","date_updated":"2022-01-06T06:51:52Z","_id":"14028"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"date_created":"2019-09-04T08:44:46Z","status":"public","publication":"INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft","department":[{"_id":"355"}],"publisher":"Gesellschaft für Informatik e.V.","author":[{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","last_name":"Wever","id":"33176"},{"full_name":"Tornede, Alexander","first_name":"Alexander","id":"38209","last_name":"Tornede"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"}],"user_id":"38209","title":"From Automated to On-The-Fly Machine Learning","place":"Bonn","language":[{"iso":"eng"}],"page":" 273-274 ","citation":{"ieee":"F. Mohr, M. D. Wever, A. Tornede, and E. Hüllermeier, “From Automated to On-The-Fly Machine Learning,” in INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft, Kassel, 2019, pp. 273–274.","short":"F. Mohr, M.D. Wever, A. Tornede, E. Hüllermeier, in: INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft, Gesellschaft für Informatik e.V., Bonn, 2019, pp. 273–274.","bibtex":"@inproceedings{Mohr_Wever_Tornede_Hüllermeier_2019, place={Bonn}, series={INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik}, title={From Automated to On-The-Fly Machine Learning}, booktitle={INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft}, publisher={Gesellschaft für Informatik e.V.}, author={Mohr, Felix and Wever, Marcel Dominik and Tornede, Alexander and Hüllermeier, Eyke}, year={2019}, pages={273–274}, collection={INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik} }","mla":"Mohr, Felix, et al. “From Automated to On-The-Fly Machine Learning.” INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft, Gesellschaft für Informatik e.V., 2019, pp. 273–74.","chicago":"Mohr, Felix, Marcel Dominik Wever, Alexander Tornede, and Eyke Hüllermeier. “From Automated to On-The-Fly Machine Learning.” In INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft, 273–74. INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft Für Informatik. Bonn: Gesellschaft für Informatik e.V., 2019.","ama":"Mohr F, Wever MD, Tornede A, Hüllermeier E. From Automated to On-The-Fly Machine Learning. In: INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft. INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik. Bonn: Gesellschaft für Informatik e.V.; 2019:273-274.","apa":"Mohr, F., Wever, M. D., Tornede, A., & Hüllermeier, E. (2019). From Automated to On-The-Fly Machine Learning. In INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft (pp. 273–274). Bonn: Gesellschaft für Informatik e.V."},"type":"conference_abstract","year":"2019","series_title":"INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik","conference":{"location":"Kassel","name":"Informatik 2019","start_date":"2019-09-23","end_date":"2019-09-26"},"date_updated":"2022-01-06T06:51:28Z","_id":"13132"},{"has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"date_created":"2019-06-11T21:33:06Z","file":[{"creator":"wever","file_id":"13177","file_size":388191,"relation":"main_file","content_type":"application/pdf","date_updated":"2019-09-10T08:20:44Z","date_created":"2019-09-10T08:19:01Z","file_name":"Automating_MultiLabel_Classification_Extending_ML-Plan.pdf","access_level":"open_access"}],"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","full_name":"Mohr, Felix","first_name":"Felix"},{"first_name":"Alexander","full_name":"Tornede, Alexander","last_name":"Tornede","id":"38209"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"file_date_updated":"2019-09-10T08:20:44Z","department":[{"_id":"355"}],"user_id":"33176","ddc":["006"],"title":"Automating Multi-Label Classification Extending ML-Plan","abstract":[{"lang":"eng","text":"Existing tools for automated machine learning, such as Auto-WEKA, TPOT, auto-sklearn, and more recently ML-Plan, have shown impressive results for the tasks of single-label classification and regression. Yet, there is only little work on other types of machine learning problems so far. In particular, there is almost no work on automating the engineering of machine learning solutions for multi-label classification (MLC). We show how the scope of ML-Plan, an AutoML-tool for multi-class classification, can be extended towards MLC using MEKA, which is a multi-label extension of the well-known Java library WEKA. The resulting approach recursively refines MEKA's multi-label classifiers, nesting other multi-label classifiers for meta algorithms and single-label classifiers provided by WEKA as base learners. In our evaluation, we find that the proposed approach yields strong results and performs significantly better than a set of baselines we compare with."}],"language":[{"iso":"eng"}],"year":"2019","citation":{"ieee":"M. D. Wever, F. Mohr, A. Tornede, and E. Hüllermeier, “Automating Multi-Label Classification Extending ML-Plan,” presented at the 6th ICML Workshop on Automated Machine Learning (AutoML 2019), Long Beach, CA, USA, 2019.","short":"M.D. Wever, F. Mohr, A. Tornede, E. Hüllermeier, in: 2019.","mla":"Wever, Marcel Dominik, et al. Automating Multi-Label Classification Extending ML-Plan. 2019.","bibtex":"@inproceedings{Wever_Mohr_Tornede_Hüllermeier_2019, title={Automating Multi-Label Classification Extending ML-Plan}, author={Wever, Marcel Dominik and Mohr, Felix and Tornede, Alexander and Hüllermeier, Eyke}, year={2019} }","apa":"Wever, M. D., Mohr, F., Tornede, A., & Hüllermeier, E. (2019). Automating Multi-Label Classification Extending ML-Plan. Presented at the 6th ICML Workshop on Automated Machine Learning (AutoML 2019), Long Beach, CA, USA.","ama":"Wever MD, Mohr F, Tornede A, Hüllermeier E. Automating Multi-Label Classification Extending ML-Plan. In: ; 2019.","chicago":"Wever, Marcel Dominik, Felix Mohr, Alexander Tornede, and Eyke Hüllermeier. “Automating Multi-Label Classification Extending ML-Plan,” 2019."},"type":"conference","oa":"1","date_updated":"2022-01-06T06:50:33Z","_id":"10232","conference":{"location":"Long Beach, CA, USA","name":"6th ICML Workshop on Automated Machine Learning (AutoML 2019)","start_date":"2019-06-09","end_date":"2019-06-15"}},{"user_id":"14931","title":"Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches","date_created":"2020-11-02T13:25:49Z","status":"public","publication":"IEEE Transactions on Cognitive and Developmental Systems","department":[{"_id":"749"},{"_id":"355"}],"author":[{"full_name":"Rohlfing, Katharina","first_name":"Katharina","id":"50352","last_name":"Rohlfing"},{"last_name":"Leonardi","full_name":"Leonardi, Giuseppe","first_name":"Giuseppe"},{"first_name":"Iris","full_name":"Nomikou, Iris","last_name":"Nomikou"},{"full_name":"Rączaszek-Leonardi, Joanna","first_name":"Joanna","last_name":"Rączaszek-Leonardi"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"}],"doi":"10.1109/TCDS.2019.2892991","date_updated":"2023-02-01T12:39:19Z","_id":"20243","language":[{"iso":"eng"}],"type":"journal_article","year":"2019","citation":{"ieee":"K. Rohlfing, G. Leonardi, I. Nomikou, J. Rączaszek-Leonardi, and E. Hüllermeier, “Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches,” IEEE Transactions on Cognitive and Developmental Systems, 2019, doi: 10.1109/TCDS.2019.2892991.","short":"K. Rohlfing, G. Leonardi, I. Nomikou, J. Rączaszek-Leonardi, E. Hüllermeier, IEEE Transactions on Cognitive and Developmental Systems (2019).","bibtex":"@article{Rohlfing_Leonardi_Nomikou_Rączaszek-Leonardi_Hüllermeier_2019, title={Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches}, DOI={10.1109/TCDS.2019.2892991}, journal={IEEE Transactions on Cognitive and Developmental Systems}, author={Rohlfing, Katharina and Leonardi, Giuseppe and Nomikou, Iris and Rączaszek-Leonardi, Joanna and Hüllermeier, Eyke}, year={2019} }","mla":"Rohlfing, Katharina, et al. “Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches.” IEEE Transactions on Cognitive and Developmental Systems, 2019, doi:10.1109/TCDS.2019.2892991.","chicago":"Rohlfing, Katharina, Giuseppe Leonardi, Iris Nomikou, Joanna Rączaszek-Leonardi, and Eyke Hüllermeier. “Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches.” IEEE Transactions on Cognitive and Developmental Systems, 2019. https://doi.org/10.1109/TCDS.2019.2892991.","apa":"Rohlfing, K., Leonardi, G., Nomikou, I., Rączaszek-Leonardi, J., & Hüllermeier, E. (2019). Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches. IEEE Transactions on Cognitive and Developmental Systems. https://doi.org/10.1109/TCDS.2019.2892991","ama":"Rohlfing K, Leonardi G, Nomikou I, Rączaszek-Leonardi J, Hüllermeier E. Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches. IEEE Transactions on Cognitive and Developmental Systems. Published online 2019. doi:10.1109/TCDS.2019.2892991"}},{"language":[{"iso":"eng"}],"doi":"10.1109/SCC.2018.00039","oa":"1","date_updated":"2022-01-06T06:56:35Z","publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"department":[{"_id":"355"}],"title":"(WIP) Towards the Automated Composition of Machine Learning Services","place":"San Francisco, CA, USA","type":"conference","citation":{"short":"F. Mohr, M.D. Wever, E. Hüllermeier, A. Faez, in: SCC, IEEE, San Francisco, CA, USA, 2018.","ieee":"F. Mohr, M. D. Wever, E. Hüllermeier, and A. Faez, “(WIP) Towards the Automated Composition of Machine Learning Services,” in SCC, San Francisco, CA, USA, 2018.","ama":"Mohr F, Wever MD, Hüllermeier E, Faez A. (WIP) Towards the Automated Composition of Machine Learning Services. In: SCC. San Francisco, CA, USA: IEEE; 2018. doi:10.1109/SCC.2018.00039","apa":"Mohr, F., Wever, M. D., Hüllermeier, E., & Faez, A. (2018). (WIP) Towards the Automated Composition of Machine Learning Services. In SCC. San Francisco, CA, USA: IEEE. https://doi.org/10.1109/SCC.2018.00039","chicago":"Mohr, Felix, Marcel Dominik Wever, Eyke Hüllermeier, and Amin Faez. “(WIP) Towards the Automated Composition of Machine Learning Services.” In SCC. San Francisco, CA, USA: IEEE, 2018. https://doi.org/10.1109/SCC.2018.00039.","mla":"Mohr, Felix, et al. “(WIP) Towards the Automated Composition of Machine Learning Services.” SCC, IEEE, 2018, doi:10.1109/SCC.2018.00039.","bibtex":"@inproceedings{Mohr_Wever_Hüllermeier_Faez_2018, place={San Francisco, CA, USA}, title={(WIP) Towards the Automated Composition of Machine Learning Services}, DOI={10.1109/SCC.2018.00039}, booktitle={SCC}, publisher={IEEE}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke and Faez, Amin}, year={2018} }"},"year":"2018","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8456425","open_access":"1"}],"conference":{"location":"San Francisco, CA, USA","name":"IEEE International Conference on Services Computing, SCC 2018","start_date":"2018-07-02","end_date":"2018-07-07"},"_id":"2479","date_created":"2018-04-24T08:34:52Z","status":"public","has_accepted_license":"1","publication":"SCC","file_date_updated":"2018-11-06T15:08:39Z","author":[{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"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"},{"full_name":"Faez, Amin","first_name":"Amin","last_name":"Faez"}],"publisher":"IEEE","file":[{"date_created":"2018-11-06T15:08:39Z","file_name":"08456425.pdf","access_level":"closed","file_id":"5382","creator":"wever","file_size":237890,"relation":"main_file","date_updated":"2018-11-06T15:08:39Z","content_type":"application/pdf"}],"ddc":["000"],"user_id":"49109"},{"status":"public","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"date_created":"2020-09-17T10:53:39Z","author":[{"full_name":"Pfannschmidt, Karlson","first_name":"Karlson","last_name":"Pfannschmidt"},{"full_name":"Gupta, Pritha","first_name":"Pritha","last_name":"Gupta"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"department":[{"_id":"7"},{"_id":"355"}],"publication":"arXiv:1803.05796","user_id":"13472","title":"Deep Architectures for Learning Context-dependent Ranking Functions","abstract":[{"lang":"eng","text":"Object ranking is an important problem in the realm of preference learning.\r\nOn the basis of training data in the form of a set of rankings of objects,\r\nwhich are typically represented as feature vectors, the goal is to learn a\r\nranking function that predicts a linear order of any new set of objects.\r\nCurrent approaches commonly focus on ranking by scoring, i.e., on learning an\r\nunderlying latent utility function that seeks to capture the inherent utility\r\nof each object. These approaches, however, are not able to take possible\r\neffects of context-dependence into account, where context-dependence means that\r\nthe utility or usefulness of an object may also depend on what other objects\r\nare available as alternatives. In this paper, we formalize the problem of\r\ncontext-dependent ranking and present two general approaches based on two\r\nnatural representations of context-dependent ranking functions. Both approaches\r\nare instantiated by means of appropriate neural network architectures, which\r\nare evaluated on suitable benchmark task."}],"language":[{"iso":"eng"}],"year":"2018","citation":{"chicago":"Pfannschmidt, Karlson, Pritha Gupta, and Eyke Hüllermeier. “Deep Architectures for Learning Context-Dependent Ranking Functions.” ArXiv:1803.05796, 2018.","ama":"Pfannschmidt K, Gupta P, Hüllermeier E. Deep Architectures for Learning Context-dependent Ranking Functions. arXiv:180305796. 2018.","apa":"Pfannschmidt, K., Gupta, P., & Hüllermeier, E. (2018). Deep Architectures for Learning Context-dependent Ranking Functions. ArXiv:1803.05796.","mla":"Pfannschmidt, Karlson, et al. “Deep Architectures for Learning Context-Dependent Ranking Functions.” ArXiv:1803.05796, 2018.","bibtex":"@article{Pfannschmidt_Gupta_Hüllermeier_2018, title={Deep Architectures for Learning Context-dependent Ranking Functions}, journal={arXiv:1803.05796}, author={Pfannschmidt, Karlson and Gupta, Pritha and Hüllermeier, Eyke}, year={2018} }","short":"K. Pfannschmidt, P. Gupta, E. Hüllermeier, ArXiv:1803.05796 (2018).","ieee":"K. Pfannschmidt, P. Gupta, and E. Hüllermeier, “Deep Architectures for Learning Context-dependent Ranking Functions,” arXiv:1803.05796. 2018."},"type":"preprint","_id":"19524","date_updated":"2022-01-06T06:54:06Z"},{"citation":{"bibtex":"@inproceedings{Mohr_Lettmann_Hüllermeier_Wever_2018, title={Programmatic Task Network Planning}, booktitle={Proceedings of the 1st ICAPS Workshop on Hierarchical Planning}, publisher={AAAI}, author={Mohr, Felix and Lettmann, Theodor and Hüllermeier, Eyke and Wever, Marcel Dominik}, year={2018}, pages={31–39} }","mla":"Mohr, Felix, et al. “Programmatic Task Network Planning.” Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39.","ama":"Mohr F, Lettmann T, Hüllermeier E, Wever MD. Programmatic Task Network Planning. In: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning. AAAI; 2018:31-39.","apa":"Mohr, F., Lettmann, T., Hüllermeier, E., & Wever, M. D. (2018). Programmatic Task Network Planning. In Proceedings of the 1st ICAPS Workshop on Hierarchical Planning (pp. 31–39). Delft, Netherlands: AAAI.","chicago":"Mohr, Felix, Theodor Lettmann, Eyke Hüllermeier, and Marcel Dominik Wever. “Programmatic Task Network Planning.” In Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, 31–39. AAAI, 2018.","ieee":"F. Mohr, T. Lettmann, E. Hüllermeier, and M. D. Wever, “Programmatic Task Network Planning,” in Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, Delft, Netherlands, 2018, pp. 31–39.","short":"F. Mohr, T. Lettmann, E. Hüllermeier, M.D. Wever, in: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39."},"type":"conference","year":"2018","page":"31-39","main_file_link":[{"open_access":"1","url":"http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop08/docs/Mohr18ProgrammaticPlanning.pdf"}],"_id":"2857","conference":{"start_date":"2018-06-24","name":"28th International Conference on Automated Planning and Scheduling","location":"Delft, Netherlands","end_date":"2018-06-29"},"has_accepted_license":"1","status":"public","date_created":"2018-05-24T09:00:20Z","file":[{"file_name":"Mohr18ProgrammaticPlanning.pdf","date_created":"2018-11-06T15:18:26Z","access_level":"closed","creator":"wever","file_id":"5384","file_size":349958,"relation":"main_file","success":1,"date_updated":"2018-11-06T15:18:26Z","content_type":"application/pdf"}],"author":[{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"last_name":"Lettmann","id":"315","first_name":"Theodor","orcid":"0000-0001-5859-2457","full_name":"Lettmann, Theodor"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","id":"33176"}],"publisher":"AAAI","publication":"Proceedings of the 1st ICAPS Workshop on Hierarchical Planning","file_date_updated":"2018-11-06T15:18:26Z","user_id":"315","ddc":["000"],"language":[{"iso":"eng"}],"oa":"1","date_updated":"2022-01-06T06:58:08Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"department":[{"_id":"355"}],"title":"Programmatic Task Network Planning"},{"issue":"6","_id":"24150","date_updated":"2022-01-06T06:56:08Z","intvolume":" 64","language":[{"iso":"eng"}],"citation":{"mla":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Stability of Stochastic Approximations with ‘Controlled Markov’ Noise and Temporal Difference Learning.” IEEE Transactions on Automatic Control, vol. 64, no. 6, IEEE, 2018, pp. 2614–20.","bibtex":"@article{Ramaswamy_Bhatnagar_2018, title={Stability of stochastic approximations with “controlled markov” noise and temporal difference learning}, volume={64}, number={6}, journal={IEEE Transactions on Automatic Control}, publisher={IEEE}, author={Ramaswamy, Arunselvan and Bhatnagar, Shalabh}, year={2018}, pages={2614–2620} }","ama":"Ramaswamy A, Bhatnagar S. Stability of stochastic approximations with “controlled markov” noise and temporal difference learning. IEEE Transactions on Automatic Control. 2018;64(6):2614-2620.","apa":"Ramaswamy, A., & Bhatnagar, S. (2018). Stability of stochastic approximations with “controlled markov” noise and temporal difference learning. IEEE Transactions on Automatic Control, 64(6), 2614–2620.","chicago":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Stability of Stochastic Approximations with ‘Controlled Markov’ Noise and Temporal Difference Learning.” IEEE Transactions on Automatic Control 64, no. 6 (2018): 2614–20.","ieee":"A. Ramaswamy and S. Bhatnagar, “Stability of stochastic approximations with ‘controlled markov’ noise and temporal difference learning,” IEEE Transactions on Automatic Control, vol. 64, no. 6, pp. 2614–2620, 2018.","short":"A. Ramaswamy, S. Bhatnagar, IEEE Transactions on Automatic Control 64 (2018) 2614–2620."},"year":"2018","type":"journal_article","page":"2614-2620","user_id":"66937","title":"Stability of stochastic approximations with “controlled markov” noise and temporal difference learning","status":"public","date_created":"2021-09-10T10:17:54Z","volume":64,"publisher":"IEEE","author":[{"id":"66937","last_name":"Ramaswamy","full_name":"Ramaswamy, Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan"},{"last_name":"Bhatnagar","first_name":"Shalabh","full_name":"Bhatnagar, Shalabh"}],"department":[{"_id":"355"}],"publication":"IEEE Transactions on Automatic Control"},{"volume":2,"date_created":"2021-09-10T10:19:07Z","status":"public","department":[{"_id":"355"}],"publication":"IEEE Control Systems Letters","author":[{"full_name":"Demirel, Burak","first_name":"Burak","last_name":"Demirel"},{"last_name":"Ramaswamy","id":"66937","first_name":"Arunselvan","full_name":"Ramaswamy, Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111"},{"full_name":"Quevedo, Daniel E","first_name":"Daniel E","last_name":"Quevedo"},{"first_name":"Holger","full_name":"Karl, Holger","last_name":"Karl"}],"publisher":"IEEE","title":"Deepcas: A deep reinforcement learning algorithm for control-aware scheduling","user_id":"66937","page":"737-742","type":"journal_article","year":"2018","citation":{"mla":"Demirel, Burak, et al. “Deepcas: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.” IEEE Control Systems Letters, vol. 2, no. 4, IEEE, 2018, pp. 737–42.","bibtex":"@article{Demirel_Ramaswamy_Quevedo_Karl_2018, title={Deepcas: A deep reinforcement learning algorithm for control-aware scheduling}, volume={2}, number={4}, journal={IEEE Control Systems Letters}, publisher={IEEE}, author={Demirel, Burak and Ramaswamy, Arunselvan and Quevedo, Daniel E and Karl, Holger}, year={2018}, pages={737–742} }","chicago":"Demirel, Burak, Arunselvan Ramaswamy, Daniel E Quevedo, and Holger Karl. “Deepcas: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.” IEEE Control Systems Letters 2, no. 4 (2018): 737–42.","apa":"Demirel, B., Ramaswamy, A., Quevedo, D. E., & Karl, H. (2018). Deepcas: A deep reinforcement learning algorithm for control-aware scheduling. IEEE Control Systems Letters, 2(4), 737–742.","ama":"Demirel B, Ramaswamy A, Quevedo DE, Karl H. Deepcas: A deep reinforcement learning algorithm for control-aware scheduling. IEEE Control Systems Letters. 2018;2(4):737-742.","ieee":"B. Demirel, A. Ramaswamy, D. E. Quevedo, and H. Karl, “Deepcas: A deep reinforcement learning algorithm for control-aware scheduling,” IEEE Control Systems Letters, vol. 2, no. 4, pp. 737–742, 2018.","short":"B. Demirel, A. Ramaswamy, D.E. Quevedo, H. Karl, IEEE Control Systems Letters 2 (2018) 737–742."},"language":[{"iso":"eng"}],"issue":"4","_id":"24151","intvolume":" 2","date_updated":"2022-01-06T06:56:08Z"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:56:32Z","oa":"1","doi":"10.1109/SCC.2018.00036","department":[{"_id":"355"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"place":"San Francisco, CA, USA","title":"On-The-Fly Service Construction with Prototypes","main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/8456422","open_access":"1"}],"citation":{"chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “On-The-Fly Service Construction with Prototypes.” In SCC. San Francisco, CA, USA: IEEE Computer Society, 2018. https://doi.org/10.1109/SCC.2018.00036.","apa":"Mohr, F., Wever, M. D., & Hüllermeier, E. (2018). On-The-Fly Service Construction with Prototypes. In SCC. San Francisco, CA, USA: IEEE Computer Society. https://doi.org/10.1109/SCC.2018.00036","ama":"Mohr F, Wever MD, Hüllermeier E. On-The-Fly Service Construction with Prototypes. In: SCC. San Francisco, CA, USA: IEEE Computer Society; 2018. doi:10.1109/SCC.2018.00036","bibtex":"@inproceedings{Mohr_Wever_Hüllermeier_2018, place={San Francisco, CA, USA}, title={On-The-Fly Service Construction with Prototypes}, DOI={10.1109/SCC.2018.00036}, booktitle={SCC}, publisher={IEEE Computer Society}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018} }","mla":"Mohr, Felix, et al. “On-The-Fly Service Construction with Prototypes.” SCC, IEEE Computer Society, 2018, doi:10.1109/SCC.2018.00036.","short":"F. Mohr, M.D. Wever, E. Hüllermeier, in: SCC, IEEE Computer Society, San Francisco, CA, USA, 2018.","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “On-The-Fly Service Construction with Prototypes,” in SCC, San Francisco, CA, USA, 2018."},"type":"conference","year":"2018","conference":{"end_date":"2018-07-07","location":"San Francisco, CA, USA","name":"IEEE International Conference on Services Computing, SCC 2018","start_date":"2018-07-02"},"_id":"2471","file":[{"access_level":"closed","file_name":"08456422.pdf","date_created":"2018-11-06T15:15:38Z","date_updated":"2018-11-06T15:15:38Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":356132,"file_id":"5383","creator":"wever"}],"publication":"SCC","file_date_updated":"2018-11-06T15:15:38Z","publisher":"IEEE Computer Society","author":[{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"},{"first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","last_name":"Wever","id":"33176"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"}],"date_created":"2018-04-23T11:40:20Z","has_accepted_license":"1","status":"public","user_id":"49109","ddc":["000"]},{"language":[{"iso":"eng"}],"doi":"10.1007/s10994-018-5733-1","date_updated":"2022-01-06T06:59:14Z","project":[{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901","_id":"1"}],"publication_identifier":{"issn":["1573-0565"]},"department":[{"_id":"355"}],"title":"On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis","citation":{"short":"V. Melnikov, E. Hüllermeier, Machine Learning (2018).","ieee":"V. Melnikov and E. Hüllermeier, “On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis,” Machine Learning, 2018.","chicago":"Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics for Learning Nested Dichotomies: An Empirical Analysis.” Machine Learning, 2018. https://doi.org/10.1007/s10994-018-5733-1.","ama":"Melnikov V, Hüllermeier E. On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis. Machine Learning. 2018. doi:10.1007/s10994-018-5733-1","apa":"Melnikov, V., & Hüllermeier, E. (2018). On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis. Machine Learning. https://doi.org/10.1007/s10994-018-5733-1","bibtex":"@article{Melnikov_Hüllermeier_2018, title={On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis}, DOI={10.1007/s10994-018-5733-1}, journal={Machine Learning}, author={Melnikov, Vitalik and Hüllermeier, Eyke}, year={2018} }","mla":"Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics for Learning Nested Dichotomies: An Empirical Analysis.” Machine Learning, 2018, doi:10.1007/s10994-018-5733-1."},"type":"journal_article","year":"2018","_id":"3402","status":"public","has_accepted_license":"1","date_created":"2018-06-29T07:44:26Z","file":[{"date_updated":"2018-11-02T15:30:57Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":1482882,"file_id":"5305","creator":"ups","access_level":"closed","file_name":"OnTheEffectivenessOfHeuristics.pdf","date_created":"2018-11-02T15:30:57Z"}],"author":[{"last_name":"Melnikov","full_name":"Melnikov, Vitalik","first_name":"Vitalik"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"}],"publication":"Machine Learning","file_date_updated":"2018-11-02T15:30:57Z","user_id":"15504","ddc":["000"],"abstract":[{"text":"In machine learning, so-called nested dichotomies are utilized as a reduction technique, i.e., to decompose a multi-class classification problem into a set of binary problems, which are solved using a simple binary classifier as a base learner. The performance of the (multi-class) classifier thus produced strongly depends on the structure of the decomposition. In this paper, we conduct an empirical study, in which we compare existing heuristics for selecting a suitable structure in the form of a nested dichotomy. Moreover, we propose two additional heuristics as natural completions. One of them is the Best-of-K heuristic, which picks the (presumably) best among K randomly generated nested dichotomies. Surprisingly, and in spite of its simplicity, it turns out to outperform the state of the art.","lang":"eng"}]},{"publisher":"Springer","author":[{"first_name":"Felix","full_name":"Mohr, Felix","last_name":"Mohr"},{"first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","last_name":"Wever","id":"33176"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"file_date_updated":"2018-11-02T15:32:16Z","publication":"Machine Learning","keyword":["AutoML","Hierarchical Planning","HTN planning","ML-Plan"],"file":[{"access_level":"closed","file_name":"ML-PlanAutomatedMachineLearnin.pdf","date_created":"2018-11-02T15:32:16Z","content_type":"application/pdf","date_updated":"2018-11-02T15:32:16Z","relation":"main_file","success":1,"file_size":1070937,"file_id":"5306","creator":"ups"}],"status":"public","has_accepted_license":"1","date_created":"2018-07-08T14:06:14Z","article_type":"original","abstract":[{"text":"Automated machine learning (AutoML) seeks to automatically select, compose, and parametrize machine learning algorithms, so as to achieve optimal performance on a given task (dataset). Although current approaches to AutoML have already produced impressive results, the field is still far from mature, and new techniques are still being developed. In this paper, we present ML-Plan, a new approach to AutoML based on hierarchical planning. To highlight the potential of this approach, we compare ML-Plan to the state-of-the-art frameworks Auto-WEKA, auto-sklearn, and TPOT. In an extensive series of experiments, we show that ML-Plan is highly competitive and often outperforms existing approaches.","lang":"eng"}],"ddc":["000"],"user_id":"5786","main_file_link":[{"url":"https://rdcu.be/3Nc2","open_access":"1"}],"citation":{"ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “ML-Plan: Automated Machine Learning via Hierarchical Planning,” Machine Learning, pp. 1495–1515, 2018, doi: 10.1007/s10994-018-5735-z.","short":"F. Mohr, M.D. Wever, E. Hüllermeier, Machine Learning (2018) 1495–1515.","mla":"Mohr, Felix, et al. “ML-Plan: Automated Machine Learning via Hierarchical Planning.” Machine Learning, Springer, 2018, pp. 1495–515, doi:10.1007/s10994-018-5735-z.","bibtex":"@article{Mohr_Wever_Hüllermeier_2018, title={ML-Plan: Automated Machine Learning via Hierarchical Planning}, DOI={10.1007/s10994-018-5735-z}, journal={Machine Learning}, publisher={Springer}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018}, pages={1495–1515} }","ama":"Mohr F, Wever MD, Hüllermeier E. ML-Plan: Automated Machine Learning via Hierarchical Planning. Machine Learning. Published online 2018:1495-1515. doi:10.1007/s10994-018-5735-z","apa":"Mohr, F., Wever, M. D., & Hüllermeier, E. (2018). ML-Plan: Automated Machine Learning via Hierarchical Planning. Machine Learning, 1495–1515. https://doi.org/10.1007/s10994-018-5735-z","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “ML-Plan: Automated Machine Learning via Hierarchical Planning.” Machine Learning, 2018, 1495–1515. https://doi.org/10.1007/s10994-018-5735-z."},"year":"2018","type":"journal_article","page":"1495-1515","_id":"3510","conference":{"name":"European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases","start_date":"2018-09-10","location":"Dublin, Ireland","end_date":"2018-09-14"},"department":[{"_id":"355"},{"_id":"34"},{"_id":"7"},{"_id":"26"}],"publication_identifier":{"issn":["0885-6125"],"eissn":["1573-0565"]},"publication_status":"epub_ahead","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"title":"ML-Plan: Automated Machine Learning via Hierarchical Planning","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:21Z","doi":"10.1007/s10994-018-5735-z","oa":"1"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:25Z","doi":"10.1007/978-3-030-01768-2_19","oa":"1","department":[{"_id":"355"}],"publication_status":"accepted","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"3","name":"SFB 901 - Project Area B"}],"place":"‘s-Hertogenbosch, the Netherlands","title":"Reduction Stumps for Multi-Class Classification","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007%2F978-3-030-01768-2_19","open_access":"1"}],"type":"conference","citation":{"bibtex":"@inproceedings{Mohr_Wever_Hüllermeier, place={‘s-Hertogenbosch, the Netherlands}, title={Reduction Stumps for Multi-Class Classification}, DOI={10.1007/978-3-030-01768-2_19}, booktitle={Proceedings of the Symposium on Intelligent Data Analysis}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke} }","mla":"Mohr, Felix, et al. “Reduction Stumps for Multi-Class Classification.” Proceedings of the Symposium on Intelligent Data Analysis, doi:10.1007/978-3-030-01768-2_19.","ama":"Mohr F, Wever MD, Hüllermeier E. Reduction Stumps for Multi-Class Classification. In: Proceedings of the Symposium on Intelligent Data Analysis. ‘s-Hertogenbosch, the Netherlands. doi:10.1007/978-3-030-01768-2_19","apa":"Mohr, F., Wever, M. D., & Hüllermeier, E. (n.d.). Reduction Stumps for Multi-Class Classification. In Proceedings of the Symposium on Intelligent Data Analysis. ‘s-Hertogenbosch, the Netherlands. https://doi.org/10.1007/978-3-030-01768-2_19","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “Reduction Stumps for Multi-Class Classification.” In Proceedings of the Symposium on Intelligent Data Analysis. ‘s-Hertogenbosch, the Netherlands, n.d. https://doi.org/10.1007/978-3-030-01768-2_19.","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “Reduction Stumps for Multi-Class Classification,” in Proceedings of the Symposium on Intelligent Data Analysis, ‘s-Hertogenbosch, the Netherlands.","short":"F. Mohr, M.D. Wever, E. Hüllermeier, in: Proceedings of the Symposium on Intelligent Data Analysis, ‘s-Hertogenbosch, the Netherlands, n.d."},"year":"2018","conference":{"location":"‘s-Hertogenbosch, the Netherlands","name":"Symposium on Intelligent Data Analysis","start_date":"2018-10-24","end_date":"2018-10-26"},"_id":"3552","file_date_updated":"2018-11-06T15:23:02Z","publication":"Proceedings of the Symposium on Intelligent Data Analysis","author":[{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"id":"33176","last_name":"Wever","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"quality_controlled":"1","file":[{"access_level":"closed","date_created":"2018-11-06T15:23:02Z","file_name":"Mohr2018_Chapter_ReductionStumpsForMulti-classC.pdf","relation":"main_file","success":1,"date_updated":"2018-11-06T15:23:02Z","content_type":"application/pdf","creator":"wever","file_id":"5385","file_size":1348768}],"date_created":"2018-07-13T15:29:15Z","has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"49109"},{"ddc":["006"],"user_id":"49109","abstract":[{"lang":"eng","text":"In automated machine learning (AutoML), the process of engineering machine learning applications with respect to a specific problem is (partially) automated.\r\nVarious AutoML tools have already been introduced to provide out-of-the-box machine learning functionality.\r\nMore specifically, by selecting machine learning algorithms and optimizing their hyperparameters, these tools produce a machine learning pipeline tailored to the problem at hand.\r\nExcept for TPOT, all of these tools restrict the maximum number of processing steps of such a pipeline.\r\nHowever, as TPOT follows an evolutionary approach, it suffers from performance issues when dealing with larger datasets.\r\nIn this paper, we present an alternative approach leveraging a hierarchical planning to configure machine learning pipelines that are unlimited in length.\r\nWe evaluate our approach and find its performance to be competitive with other AutoML tools, including TPOT."}],"status":"public","has_accepted_license":"1","date_created":"2018-08-09T06:14:54Z","quality_controlled":"1","author":[{"last_name":"Wever","id":"33176","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik"},{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"keyword":["automated machine learning","complex pipelines","hierarchical planning"],"publication":"ICML 2018 AutoML Workshop","file_date_updated":"2018-08-09T06:14:43Z","file":[{"file_size":297811,"file_id":"3853","creator":"wever","content_type":"application/pdf","date_updated":"2018-08-09T06:14:43Z","relation":"main_file","date_created":"2018-08-09T06:14:43Z","file_name":"38.pdf","access_level":"open_access"}],"_id":"3852","conference":{"location":"Stockholm, Sweden","name":"ICML 2018 AutoML Workshop","start_date":"2018-07-10","end_date":"2018-07-15"},"urn":"38527","citation":{"apa":"Wever, M. D., Mohr, F., & Hüllermeier, E. (2018). ML-Plan for Unlimited-Length Machine Learning Pipelines. In ICML 2018 AutoML Workshop. Stockholm, Sweden.","ama":"Wever MD, Mohr F, Hüllermeier E. ML-Plan for Unlimited-Length Machine Learning Pipelines. In: ICML 2018 AutoML Workshop. ; 2018.","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “ML-Plan for Unlimited-Length Machine Learning Pipelines.” In ICML 2018 AutoML Workshop, 2018.","mla":"Wever, Marcel Dominik, et al. “ML-Plan for Unlimited-Length Machine Learning Pipelines.” ICML 2018 AutoML Workshop, 2018.","bibtex":"@inproceedings{Wever_Mohr_Hüllermeier_2018, title={ML-Plan for Unlimited-Length Machine Learning Pipelines}, booktitle={ICML 2018 AutoML Workshop}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }","short":"M.D. Wever, F. Mohr, E. Hüllermeier, in: ICML 2018 AutoML Workshop, 2018.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “ML-Plan for Unlimited-Length Machine Learning Pipelines,” in ICML 2018 AutoML Workshop, Stockholm, Sweden, 2018."},"type":"conference","year":"2018","main_file_link":[{"url":"https://docs.google.com/viewer?a=v&pid=sites&srcid=ZGVmYXVsdGRvbWFpbnxhdXRvbWwyMDE4aWNtbHxneDo3M2Q3MjUzYjViNDRhZTAx"}],"title":"ML-Plan for Unlimited-Length Machine Learning Pipelines","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"department":[{"_id":"355"}],"oa":"1","date_updated":"2022-01-06T06:59:46Z","language":[{"iso":"eng"}]}]