[{"type":"conference","date_created":"2019-09-17T13:38:10Z","place":"Cham","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"abstract":[{"text":"We revisit algorithm selection for declarative programming solvers. We introduce two main ideas to improve cost-sensitive hierarchical clustering: First, to augment the portfolio builder with a self-configuration component. And second, we propose that the algorithm selector assesses the confidence level of its own prediction, so that a more defensive recourse action can be used to overturn the original recommendation.","lang":"eng"}],"citation":{"mla":"Ansotegui, Carlos, et al. “Self-Configuring Cost-Sensitive Hierarchical Clustering with Recourse.” <i>Principles and Practice of Constraint Programming</i>, edited by John Hooker, Springer International Publishing, 2018, pp. 524–34.","bibtex":"@inproceedings{Ansotegui_Sellmann_Tierney_2018, place={Cham}, title={Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse}, booktitle={Principles and Practice of Constraint Programming}, publisher={Springer International Publishing}, author={Ansotegui, Carlos and Sellmann, Meinolf and Tierney, Kevin}, editor={Hooker, JohnEditor}, year={2018}, pages={524–534} }","ama":"Ansotegui C, Sellmann M, Tierney K. Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse. In: Hooker J, ed. <i>Principles and Practice of Constraint Programming</i>. Cham: Springer International Publishing; 2018:524-534.","ieee":"C. Ansotegui, M. Sellmann, and K. Tierney, “Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse,” in <i>Principles and Practice of Constraint Programming</i>, 2018, pp. 524–534.","apa":"Ansotegui, C., Sellmann, M., &#38; Tierney, K. (2018). Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse. In J. Hooker (Ed.), <i>Principles and Practice of Constraint Programming</i> (pp. 524–534). Cham: Springer International Publishing.","chicago":"Ansotegui, Carlos, Meinolf Sellmann, and Kevin Tierney. “Self-Configuring Cost-Sensitive Hierarchical Clustering with Recourse.” In <i>Principles and Practice of Constraint Programming</i>, edited by John Hooker, 524–34. Cham: Springer International Publishing, 2018.","short":"C. Ansotegui, M. Sellmann, K. Tierney, in: J. Hooker (Ed.), Principles and Practice of Constraint Programming, Springer International Publishing, Cham, 2018, pp. 524–534."},"publication":"Principles and Practice of Constraint Programming","editor":[{"full_name":"Hooker, John","first_name":"John","last_name":"Hooker"}],"user_id":"40778","language":[{"iso":"eng"}],"_id":"13249","publisher":"Springer International Publishing","page":"524-534","date_updated":"2022-01-06T06:51:31Z","author":[{"last_name":"Ansotegui","first_name":"Carlos","full_name":"Ansotegui, Carlos"},{"full_name":"Sellmann, Meinolf","first_name":"Meinolf","last_name":"Sellmann"},{"last_name":"Tierney","first_name":"Kevin","full_name":"Tierney, Kevin"}],"publication_identifier":{"isbn":["978-3-319-98334-9"]},"year":"2018","status":"public","title":"Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse"}]