{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:06:29Z","timestamp":1725732389706},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40991-2_33","type":"book-chapter","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T01:43:57Z","timestamp":1377654237000},"page":"515-530","source":"Crossref","is-referenced-by-count":0,"title":["Decision-Theoretic Sparsification for Gaussian Process Preference Learning"],"prefix":"10.1007","author":[{"given":"M. Ehsan","family":"Abbasnejad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin V.","family":"Bonilla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Sanner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Chu, W., Ghahramani, Z.: Extensions of gaussian processes for ranking: semi-supervised and active learning. In: Workshop on Learning to Rank at NIPS (2005)"},{"key":"33_CR2","unstructured":"Bonilla, E.V., Guo, S., Sanner, S.: Gaussian process preference elicitation. In: NIPS, pp. 153\u2013160 (2010)"},{"key":"33_CR3","unstructured":"Platt, J.C., Burges, C.J.C., Swenson, S., Weare, C., Zheng, A.: Learning a Gaussian Process Prior for Automatically Generating Music Playlists. In: NIPS (2002)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-15939-8_32","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"Z. Xu","year":"2010","unstructured":"Xu, Z., Kersting, K., Joachims, T.: Fast active exploration for link-based preference learning using Gaussian processes. In: Balc\u00e1zar, J.L., Bonchi, F., Gionis, A., Sebag, M. (eds.) ECML PKDD 2010, Part III. LNCS, vol.\u00a06323, pp. 499\u2013514. Springer, Heidelberg (2010)"},{"key":"33_CR5","unstructured":"Smola, A.J., Bartlett, P.: Sparse greedy Gaussian process regression. In: NIPS (2001)"},{"key":"33_CR6","unstructured":"Keerthi, S.S., Chu, W.: A Matching Pursuit Approach to Sparse Gaussian Process Regression. In: NIPS (2005)"},{"key":"33_CR7","unstructured":"Snelson, E., Ghahramani, Z.: Sparse Gaussian processes using pseudo-inputs. In: NIPS (2006)"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Lawrence, N., Seeger, M., Herbrich, R.: Fast sparse Gaussian process methods: The informative vector machine. In: NIPS (2003)","DOI":"10.1145\/1015330.1015382"},{"key":"33_CR9","unstructured":"Minka, T.P.: A family of algorithms for approximate bayesian inference. PhD thesis, Massachusetts Institute of Technology (2001)"},{"key":"33_CR10","unstructured":"Minka, T.P.: Expectation propagation for approximate Bayesian inference. In: UAI, vol. 17, pp. 362\u2013369 (2001)"},{"key":"33_CR11","unstructured":"Lacoste-Julien, S., Huszar, F., Ghahramani, Z.: Approximate inference for the loss-calibrated Bayesian. In: AISTATS, pp. 416\u2013424 (2011)"},{"key":"33_CR12","unstructured":"Srinivas, N., Krause, A., Kakade, S.M., Seeger, M.: Gaussian process optimization in the bandit setting: No regret and experimental design. In: NIPS (2009)"},{"key":"33_CR13","unstructured":"Neumann, J.V., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press (1944)"},{"key":"33_CR14","unstructured":"Krause, A., Golovin, D.: Submodular Function Maximization. In: Tractability: Practical Approaches to Hard Problems. Cambridge University Press (2012)"},{"issue":"1","key":"33_CR15","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/TSSC.1966.300074","volume":"2","author":"R. Howard","year":"1966","unstructured":"Howard, R.: Information value theory. IEEE Transactions on Systems Science and Cybernetics\u00a02(1), 22\u201326 (1966)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"issue":"2-3","key":"33_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn.\u00a047(2-3), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Seeger, M.W.: Bayesian Gaussian Process Models: PAC-Bayesian Generalisation Error Bounds and Sparse Approximations. PhD thesis, University of Edinburgh (2003)","DOI":"10.1162\/153244303765208386"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Rasmussen, C.E., Williams, C.: Gaussian Processes for Machine Learning (2006)","DOI":"10.7551\/mitpress\/3206.001.0001"},{"key":"33_CR19","unstructured":"Chajewska, U., Koller, D.: Utilities as random variables: Density estimation and structure discovery. In: UAI, pp. 63\u201371. Morgan Kaufmann Publishers Inc. (2000)"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Guo, S., Sanner, S.: Real-time multiattribute Bayesian preference elicitation with pairwise comparison queries. In: AISTATS (2010)","DOI":"10.1007\/978-3-642-13278-0_51"},{"key":"33_CR21","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/1102351.1102369","volume-title":"ICML","author":"W. Chu","year":"2005","unstructured":"Chu, W., Ghahramani, Z.: Preference learning with Gaussian processes. In: ICML, pp. 137\u2013144. ACM, New York (2005)"},{"key":"33_CR22","unstructured":"Eric, B., Freitas, N.D., Ghosh, A.: Active preference learning with discrete choice data. In: NIPS, pp. 409\u2013416 (2008)"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Birlutiu, A., Groot, P., Heskes, T.: Multi-task preference learning with an application to hearing aid personalization. Neurocomputing\u00a073 (2010)","DOI":"10.1016\/j.neucom.2009.11.025"},{"key":"33_CR24","unstructured":"Qui\u00f1onero-Candela, J., Rasmussen, C.: A unifying view of sparse approximate Gaussian process regression. JMLR, 1939\u20131959 (2005)"},{"key":"33_CR25","unstructured":"Houlsby, N., Husz\u00e1r, F., Ghahramani, Z., Lengyel, M.: Bayesian Active Learning for Classification and Preference Learning. arXiv:1112.5745 (2011)"},{"key":"33_CR26","unstructured":"Houlsby, N., Hern\u00e1ndez-Lobato, J.M., Husz\u00e1r, F., Ghahramani, Z.: Collaborative Gaussian Processes for Preference Learning. In: NIPS (2012)"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40991-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T19:54:08Z","timestamp":1558036448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40991-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387081","9783642387098"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40991-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}