{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:39:15Z","timestamp":1726043955748},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030301781"},{"type":"electronic","value":"9783030301798"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30179-8_31","type":"book-chapter","created":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T23:03:18Z","timestamp":1567983798000},"page":"338-352","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Personalized Transaction Kernels for Recommendation Using MCTS"],"prefix":"10.1007","author":[{"given":"Maryam","family":"Tavakol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Joppen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulf","family":"Brefeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"F\u00fcrnkranz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,24]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Basilico, J., Hofmann, T.: Unifying collaborative and content-based filtering. In: Proceedings of the 21st International Conference on Machine Learning (ICML 2004), p. 9. ACM (2004)","DOI":"10.1145\/1015330.1015394"},{"issue":"1","key":"31_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., et al.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Cao, B., He, L., Kong, X., Philip, S.Y., Hao, Z., Ragin, A.B.: Tensor-based multi-view feature selection with applications to brain diseases. In: Proceedings of the IEEE International Conference on Data Mining (ICDM 2014), pp. 40\u201349 (2014)","DOI":"10.1109\/ICDM.2014.26"},{"issue":"4","key":"31_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s40708-015-0023-1","volume":"2","author":"B Cao","year":"2015","unstructured":"Cao, B., Kong, X., Yu, P.S.: A review of heterogeneous data mining for brain disorder identification. Brain Inform. 2(4), 211\u2013233 (2015)","journal-title":"Brain Inform."},{"issue":"3","key":"31_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10791-009-9109-9","volume":"13","author":"O Chapelle","year":"2010","unstructured":"Chapelle, O., Keerthi, S.S.: Efficient algorithms for ranking with SVMs. Inf. Retr. 13(3), 201\u2013215 (2010)","journal-title":"Inf. Retr."},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"M Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 693\u2013703. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_59"},{"key":"31_CR7","unstructured":"Dullemond, K., Peeters, K.: Introduction to Tensor Calculus. University of Heidelberg (2010). http:\/\/www.e-booksdirectory.com\/details.php?ebook=9967"},{"key":"31_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30164-8","volume-title":"Preference Learning","year":"2010","unstructured":"F\u00fcrnkranz, J., H\u00fcllermeier, E. (eds.): Preference Learning. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-0-387-30164-8"},{"key":"31_CR9","unstructured":"Gaudel, R., Sebag, M.: Feature selection as a one-player game. In: F\u00fcrnkranz, J., Joachims, T. (eds.) Proceedings of the 27th International Conference on Machine Learning (ICML 2010), pp. 359\u2013366. Omnipress, Haifa (2010)"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-14125-6_18","volume-title":"Preference Learning","author":"Marco de Gemmis","year":"2010","unstructured":"de Gemmis, M., Iaquinta, L., Lops, P., Musto, C., Narducci, F., Semeraro, G.: Learning preference models in recommender systems. In: F\u00fcrnkranz and H\u00fcllermeier [8], pp. 387\u2013407"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Hu, Y., Koren, Y., Volinsky, C.: Collaborative filtering for implicit feedback datasets. In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), pp. 263\u2013272. IEEE (2008)","DOI":"10.1109\/ICDM.2008.22"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 133\u2013142. ACM (2002)","DOI":"10.1145\/775047.775067"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-14125-6_9","volume-title":"Preference Learning","author":"Toshihiro Kamishima","year":"2010","unstructured":"Kamishima, T., Kazawa, H., Akaho, S.: A survey and empirical comparison of object ranking methods. In: F\u00fcrnkranz and H\u00fcllermeier [8], pp. 181\u2013201"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based Monte-Carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_29"},{"issue":"8","key":"31_CR15","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques forrecommender systems. Computer 42(8), 30\u201337 (2009)","journal-title":"Computer"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Li, L., Chu, W., Langford, J., Schapire, R.E.: A contextual-bandit approach to personalized news article recommendation. In: Proceedings of the 19th International Conference on the World Wide Web (WWW 2010), pp. 661\u2013670. ACM (2010)","DOI":"10.1145\/1772690.1772758"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Liebman, E., Khandelwal, P., Saar-Tsechansky, M., Stone, P.: Designing better playlists with Monte Carlo tree search. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 4715\u20134720 (2017)","DOI":"10.1609\/aaai.v31i2.19100"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-540-30115-8_31","volume-title":"Machine Learning: ECML 2004","author":"S Oyama","year":"2004","unstructured":"Oyama, S., Manning, C.D.: Using feature conjunctions across examples for learning pairwise classifiers. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 322\u2013333. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30115-8_31"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Pham, N., Pagh, R.: Fast and scalable polynomial kernels via explicit feature maps. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 239\u2013247. ACM (2013)","DOI":"10.1145\/2487575.2487591"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Item-based collaborative filtering recommendation algorithms. In: Proceedings of the 10th International Conference on the World Wide Web (WWW 2001), pp. 285\u2013295. ACM (2001)","DOI":"10.1145\/371920.372071"},{"key":"31_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-44581-1_27","volume-title":"Computational Learning Theory","author":"B Sch\u00f6lkopf","year":"2001","unstructured":"Sch\u00f6lkopf, B., Herbrich, R., Smola, A.J.: A generalized representer theorem. In: Helmbold, D., Williamson, B. (eds.) COLT 2001. LNCS (LNAI), vol. 2111, pp. 416\u2013426. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44581-1_27"},{"key":"31_CR22","unstructured":"Shi, Q., et al.: Hash kernels. In: Proceedings of the 12th International Conference on Artificial Intelligence and Statistics (AISTATS 2009), pp. 496\u2013503. JMLR, Clearwater Beach (2009)"},{"issue":"7587","key":"31_CR23","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., et al.: Mastering the game of Go with deep neural networks and tree search. Nature 529(7587), 484\u2013489 (2016)","journal-title":"Nature"},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Smalter, A., Huan, J., Lushington, G.: Feature selection in the tensor product feature space. In: Proceedings of the 9th IEEE International Conference on Data Mining (ICDM 2009), pp. 1004\u20131009. IEEE (2009)","DOI":"10.1109\/ICDM.2009.101"},{"key":"31_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-319-71246-8_17","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M Tavakol","year":"2017","unstructured":"Tavakol, M., Brefeld, U.: A unified contextual bandit framework for\u00a0long- and short-term recommendations. In: Ceci, M., Hollm\u00e9n, J., Todorovski, L., Vens, C., D\u017eeroski, S. (eds.) ECML PKDD 2017. LNCS (LNAI), vol. 10535, pp. 269\u2013284. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71246-8_17"},{"key":"31_CR26","doi-asserted-by":"crossref","unstructured":"Tavakol, M., Brefeld, U.: Factored MDPs for detecting topics of user sessions. In: Proceedings of the 8th ACM Conference on Recommender Systems, pp. 33\u201340. ACM (2014)","DOI":"10.1145\/2645710.2645739"},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"Vanchinathan, H.P., Nikolic, I., De Bona, F., Krause, A.: Explore-exploit in top-n recommender systems via Gaussian processes. In: Proceedings of the 8th ACM Conference on Recommender Systems, pp. 225\u2013232. ACM (2014)","DOI":"10.1145\/2645710.2645733"},{"key":"31_CR28","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-14125-6_3","volume-title":"Preference Learning","author":"Shankar Vembu","year":"2010","unstructured":"Vembu, S., G\u00e4rtner, T.: Label ranking algorithms: a survey. In: F\u00fcrnkranz and H\u00fcllermeier [8], pp. 45\u201364"},{"key":"31_CR29","doi-asserted-by":"crossref","unstructured":"Wang, C., Blei, D.M.: Collaborative topic modeling for recommending scientific articles. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 448\u2013456. ACM (2011)","DOI":"10.1145\/2020408.2020480"},{"key":"31_CR30","unstructured":"Wang, Y., Tung, H.Y., Smola, A.J., Anandkumar, A.: Fast and guaranteed tensor decomposition via sketching. In: Advances in Neural Information Processing Systems, pp. 991\u2013999 (2015)"},{"key":"31_CR31","doi-asserted-by":"crossref","unstructured":"Weinberger, K., Dasgupta, A., Langford, J., Smola, A., Attenberg, J.: Feature hashing for large scale multitask learning. In: Proceedings of the 26th International Conference on Machine Learning (ICML 2009), pp. 1113\u20131120. ACM (2009)","DOI":"10.1145\/1553374.1553516"},{"issue":"Feb","key":"31_CR32","first-page":"1083","volume":"3","author":"D Zelenko","year":"2003","unstructured":"Zelenko, D., Aone, C., Richardella, A.: Kernel methods for relation extraction. J. Mach. Learn. Res. 3(Feb), 1083\u20131106 (2003)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Lecture Notes in Computer Science","KI 2019: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30179-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T21:40:43Z","timestamp":1664314843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30179-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030301781","9783030301798"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30179-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint German\/Austrian Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kassel","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ki2019.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}