{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T17:19:49Z","timestamp":1767979189233,"version":"3.49.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/cluster.2013.6702683","type":"proceedings-article","created":{"date-parts":[[2014,1,10]],"date-time":"2014-01-10T15:05:37Z","timestamp":1389366337000},"page":"1-8","source":"Crossref","is-referenced-by-count":33,"title":["Active-learning-based surrogate models for empirical performance tuning"],"prefix":"10.1109","author":[{"given":"Prasanna","family":"Balaprakash","sequence":"first","affiliation":[]},{"given":"Robert B.","family":"Gramacy","sequence":"additional","affiliation":[]},{"given":"Stefan M.","family":"Wild","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1023\/A:1013916107446","article-title":"Bayesian treed models","volume":"48","author":"chipman","year":"2002","journal-title":"Mach Learn"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1198\/TECH.2009.0015"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2011.ap09769"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.14.3.192.113"},{"key":"16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01560-1","author":"settles","year":"2012","journal-title":"Active Learning"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.2307\/2332195"},{"key":"14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3799-8","author":"santner","year":"2003","journal-title":"The Design and Analysis of Computer Experiments"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2007.32"},{"key":"12","first-page":"535","article-title":"Active and accelerated learning of cost models for optimizing scientific applications","author":"shivam","year":"2006","journal-title":"Int J Very Large Databases"},{"key":"21","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1214\/12-AOAS590","article-title":"Variable selection and sensitivity analysis via dynamic trees with an application to computer code performance tuning","volume":"7","author":"gramacy","year":"2013","journal-title":"Ann App Stats"},{"key":"20","author":"anagnostopoulos","year":"2012","journal-title":"Dynamic Trees for Streaming and Massive Data Contexts"},{"key":"22","author":"gramacy","year":"0","journal-title":"DynaTree Dynamic Trees for Learning and Design 2011 R Package Version 2 0"},{"key":"23","first-page":"679","article-title":"Neural network exploration using optimal experimental design","volume":"6","author":"cohn","year":"1996","journal-title":"Advances in neural information processing systems"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2012.04.214"},{"key":"26","article-title":"Improving performance via mini-applications","author":"heroux","year":"2009","journal-title":"Sandia National Laboratories Technical Report SAND2009-5574"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1177\/1094342004041293"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1201\/b10509"},{"key":"10","article-title":"MILEPOST GCC: Machine learning based research compiler","author":"fursin","year":"2008","journal-title":"GCC Summit Proceedings"},{"key":"1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/11549468_23","article-title":"Performance modeling: Understanding the past and predicting the future","volume":"3648","author":"bailey","year":"2005","journal-title":"Lecture Notes in Computer Science"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1944862.1944880"},{"key":"6","first-page":"1","article-title":"Machine learning for predictive autotuning with boosted regression trees","author":"bergstra","year":"2012","journal-title":"Proceedings of Innovative Parallel Computing (InPar'12)"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2012.121"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.130"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTR.2008.4663796"},{"key":"8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/780822.781141","article-title":"Meta optimization: Improving compiler heuristics with machine learning","volume":"38","author":"stephenson","year":"2003","journal-title":"ACM SIGPLAN Notices"}],"event":{"name":"2013 IEEE International Conference on Cluster Computing (CLUSTER)","location":"Indianapolis, IN, USA","start":{"date-parts":[[2013,9,23]]},"end":{"date-parts":[[2013,9,27]]}},"container-title":["2013 IEEE International Conference on Cluster Computing (CLUSTER)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6689497\/6702603\/06702683.pdf?arnumber=6702683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T14:49:09Z","timestamp":1688914149000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6702683\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/cluster.2013.6702683","relation":{},"subject":[],"published":{"date-parts":[[2013,9]]}}}