{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:13Z","timestamp":1750306093624,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T00:00:00Z","timestamp":1501804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"University of Missouri Research Board","award":["4991"],"award-info":[{"award-number":["4991"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,4]]},"DOI":"10.1145\/3097983.3098044","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T18:35:54Z","timestamp":1501871754000},"page":"165-173","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Unsupervised P2P Rental Recommendations via Integer Programming"],"prefix":"10.1145","author":[{"given":"Yanjie","family":"Fu","sequence":"first","affiliation":[{"name":"Missouri University of Science and Technology, Rolla, MO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guannan","family":"Liu","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingfei","family":"Teng","sequence":"additional","affiliation":[{"name":"Rutgers University, Newark, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charu","family":"Aggarwal","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Yorktown Heights, NY, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.04.002"},{"key":"e_1_3_2_2_2_1","unstructured":"Alejandro Marcos Alvarez Quentin Louveaux and Louis Wehenkel. 2014. A supervised machine learning approach to variable branching in branch-and-bound In ECML. Citeseer.  Alejandro Marcos Alvarez Quentin Louveaux and Louis Wehenkel. 2014. A supervised machine learning approach to variable branching in branch-and-bound In ECML. Citeseer."},{"key":"e_1_3_2_2_3_1","unstructured":"Alejandro Marcos Alvarez Louis Wehenkel and Quentin Louveaux. 2014. Machine Learning to Balance the Load in Parallel Branch-and-Bound. (2014).  Alejandro Marcos Alvarez Louis Wehenkel and Quentin Louveaux. 2014. Machine Learning to Balance the Load in Parallel Branch-and-Bound. (2014)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Aris Anagnostopoulos Luca Becchetti Carlos Castillo and Aristides Gionis 2010 An optimization framework for query recommendation Proceedings of the third ACM international conference on Web search and data mining. ACM 161--170.  Aris Anagnostopoulos Luca Becchetti Carlos Castillo and Aristides Gionis 2010 An optimization framework for query recommendation Proceedings of the third ACM international conference on Web search and data mining. ACM 161--170.","DOI":"10.1145\/1718487.1718508"},{"key":"e_1_3_2_2_5_1","unstructured":"Justin A Boyan and Andrew W Moore 1998. Learning evaluation functions for global optimization and boolean satisfiability AAAI\/IAAI. 3--10.  Justin A Boyan and Andrew W Moore 1998. Learning evaluation functions for global optimization and boolean satisfiability AAAI\/IAAI. 3--10."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68504-3_7"},{"key":"e_1_3_2_2_8_1","volume-title":"An efficient boosting algorithm for combining preferences. The Journal of machine learning research","author":"Freund Yoav","year":"2003","unstructured":"Yoav Freund , Raj Iyer , Robert E Schapire , and Yoram Singer . 2003. An efficient boosting algorithm for combining preferences. The Journal of machine learning research ( 2003 ). Yoav Freund, Raj Iyer, Robert E Schapire, and Yoram Singer. 2003. An efficient boosting algorithm for combining preferences. The Journal of machine learning research (2003)."},{"key":"e_1_3_2_2_9_1","volume-title":"Hal Daume III, and Jason M Eisner","author":"He He","year":"2014","unstructured":"He He , Hal Daume III, and Jason M Eisner 2014 . Learning to Search in Branch and Bound Algorithms. Advances in Neural Information Processing Systems . 3293--3301. He He, Hal Daume III, and Jason M Eisner 2014. Learning to Search in Branch and Bound Algorithms. Advances in Neural Information Processing Systems. 3293--3301."},{"key":"e_1_3_2_2_10_1","unstructured":"Xiaofei He Deng Cai and Partha Niyogi 2005. Laplacian score for feature selection. In Advances in neural information processing systems. 507--514.  Xiaofei He Deng Cai and Partha Niyogi 2005. Laplacian score for feature selection. In Advances in neural information processing systems. 507--514."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3015812.3015920"},{"key":"e_1_3_2_2_12_1","volume-title":"Proceedings., Twelfth International. IEEE, 443--450","author":"Lowrie Matthew","year":"1988","unstructured":"Matthew Lowrie and Benjamin Wah 1988 . Learning heuristic functions for numeric optimization problems Computer Software and Applications Conference, 1988. COMPSAC 88 . Proceedings., Twelfth International. IEEE, 443--450 . Matthew Lowrie and Benjamin Wah 1988. Learning heuristic functions for numeric optimization problems Computer Software and Applications Conference, 1988. COMPSAC 88. Proceedings., Twelfth International. IEEE, 443--450."},{"key":"e_1_3_2_2_13_1","volume-title":"Linear feature-based models for information retrieval. Information Retrieval","author":"Metzler Donald","year":"2007","unstructured":"Donald Metzler and W Bruce Croft 2007. Linear feature-based models for information retrieval. Information Retrieval ( 2007 ). Donald Metzler and W Bruce Croft 2007. Linear feature-based models for information retrieval. Information Retrieval (2007)."},{"volume-title":"Theory of games and economic behavior","author":"von Neumann J","key":"e_1_3_2_2_14_1","unstructured":"J von Neumann , Oskar Morgenstern , and others. 1944. Theory of games and economic behavior . Vol. Vol. 60 . Princeton university press Princeton . J von Neumann, Oskar Morgenstern, and others. 1944. Theory of games and economic behavior. Vol. Vol. 60. Princeton university press Princeton."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Paolo Viappiani and Craig Boutilier 2009. Regret-based optimal recommendation sets in conversational recommender systems Proceedings of the third ACM conference on Recommender systems. ACM 101--108.  Paolo Viappiani and Craig Boutilier 2009. Regret-based optimal recommendation sets in conversational recommender systems Proceedings of the third ACM conference on Recommender systems. ACM 101--108.","DOI":"10.1145\/1639714.1639732"},{"volume-title":"Utilizing marginal net utility for recommendation in e-commerce Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval. ACM, 1003--1012","author":"Wang Jian","key":"e_1_3_2_2_16_1","unstructured":"Jian Wang and Yi Zhang 2011. Utilizing marginal net utility for recommendation in e-commerce Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval. ACM, 1003--1012 . Jian Wang and Yi Zhang 2011. Utilizing marginal net utility for recommendation in e-commerce Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval. ACM, 1003--1012."},{"volume-title":"Adarank: a boosting algorithm for information retrieval Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval. ACM, 391--398","author":"Xu Jun","key":"e_1_3_2_2_17_1","unstructured":"Jun Xu and Hang Li. 2007. Adarank: a boosting algorithm for information retrieval Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval. ACM, 391--398 . Jun Xu and Hang Li. 2007. Adarank: a boosting algorithm for information retrieval Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval. ACM, 391--398."},{"key":"e_1_3_2_2_18_1","volume-title":"Where Every Stay is Above Average. Where Every Stay is Above Average (January 23","author":"Zervas Georgios","year":"2015","unstructured":"Georgios Zervas , Davide Proserpio , and John Byers . 2015. A First Look at Online Reputation on Airbnb , Where Every Stay is Above Average. Where Every Stay is Above Average (January 23 , 2015 ) (2015). Georgios Zervas, Davide Proserpio, and John Byers. 2015. A First Look at Online Reputation on Airbnb, Where Every Stay is Above Average. Where Every Stay is Above Average (January 23, 2015) (2015)."}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Halifax NS Canada","acronym":"KDD '17"},"container-title":["Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098044","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:25Z","timestamp":1750217425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,4]]},"references-count":17,"alternative-id":["10.1145\/3097983.3098044","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098044","relation":{},"subject":[],"published":{"date-parts":[[2017,8,4]]},"assertion":[{"value":"2017-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}