{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T19:49:02Z","timestamp":1777319342086,"version":"3.51.4"},"publisher-location":"New York, New York, USA","reference-count":11,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3184558.3186961","type":"proceedings-article","created":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T18:04:25Z","timestamp":1524074665000},"page":"131-134","source":"Crossref","is-referenced-by-count":5,"title":["Four-Dimensional Shopping Mall"],"prefix":"10.1145","author":[{"given":"Hong-Han","family":"Shuai","sequence":"first","affiliation":[{"name":"National Chiao Tung University, Hsinchu, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yueh-Hsue","family":"Li","sequence":"additional","affiliation":[{"name":"National Chiao Tung University, Hsinchu, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Chieh","family":"Feng","sequence":"additional","affiliation":[{"name":"National Chiao Tung University, Hsinchu, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-Chih","family":"Peng","sequence":"additional","affiliation":[{"name":"National Chiao Tung University, Hsinchu, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3184558.3186961-1","unstructured":"2002. On the complexity of theMPA problem in probabilistic networks. European Conference on Artificial Intelligence (2002)."},{"key":"key-10.1145\/3184558.3186961-2","doi-asserted-by":"crossref","unstructured":"Rakesh Agrawal, Tomasz Imielinski, and Arun N. Swami. 1993. Mining Association Rules between Sets of Items in Large Databases. In SIGMOD.","DOI":"10.1145\/170035.170072"},{"key":"key-10.1145\/3184558.3186961-3","doi-asserted-by":"crossref","unstructured":"Eunjoon Cho, Seth A. Myers, and Jure Leskovec. 2011. Friendship and mobility: user movement in location-based social networks. In KDD.","DOI":"10.1145\/2020408.2020579"},{"key":"key-10.1145\/3184558.3186961-4","doi-asserted-by":"crossref","unstructured":"D. Heckerman, D. Geiger, and D. M. Chickering. 1995. Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning (1995).","DOI":"10.1016\/B978-1-55860-377-6.50079-7"},{"key":"key-10.1145\/3184558.3186961-5","doi-asserted-by":"crossref","unstructured":"H.-J. Hung, H.-H. Shuai, W.-C. Lee, D.-N. Yang, J. Pei, L.-H. Huang, and M.-S. Chen. 2016. When Social Influence Meets Item Inference. KDD (2016).","DOI":"10.1145\/2939672.2939758"},{"key":"key-10.1145\/3184558.3186961-6","doi-asserted-by":"crossref","unstructured":"David Kempe, Jon M. Kleinberg, and Éva Tardos. 2003. Maximizing the spread of influence through a social network. In KDD.","DOI":"10.1145\/956750.956769"},{"key":"key-10.1145\/3184558.3186961-7","doi-asserted-by":"crossref","unstructured":"J. Li, X. Wang, Ke Deng, X. Yang, T. Selli, and J. X. Yu. 2017. Most Influential Community Search over Large Social Networks. ICDE (2017).","DOI":"10.1109\/ICDE.2017.136"},{"key":"key-10.1145\/3184558.3186961-8","doi-asserted-by":"crossref","unstructured":"Bai-En Shie, Hui-Fang Hsiao, and VincentS. Tseng. 2013. Efficient Algorithms for Discovering High Utility User Behavior Patterns in Mobile Commerce Environments. Knowledge and Information Systems (KAIS) (2013), 363--387.","DOI":"10.1007\/s10115-012-0483-z"},{"key":"key-10.1145\/3184558.3186961-9","unstructured":"H.-H. Shuai, D.-N. Yang, P. S. Yu, and M.-S. Chen. 2014. Willingness Optimization for Social Group Activity. VLDB (2014)."},{"key":"key-10.1145\/3184558.3186961-10","doi-asserted-by":"crossref","unstructured":"Jianyong Wang, Jiawei Han, Ying Lu, and P. Tzvetkov. 2005. TFP: an efficient algorithm for mining top-k frequent closed itemsets. IEEE Transactions on Knowledge and Data Engineering (2005).","DOI":"10.1109\/TKDE.2005.81"},{"key":"key-10.1145\/3184558.3186961-11","doi-asserted-by":"crossref","unstructured":"Unil Yun, Gangin Lee, and Keun Ho Ryu. 2014. Mining Maximal Frequent Patterns by Considering Weight Conditions over Data Streams. Knowledge-Based Systems 55 (2014), 49--65.","DOI":"10.1016\/j.knosys.2013.10.011"}],"event":{"name":"Companion of the The Web Conference 2018","location":"Lyon, France","acronym":"WWW '18","number":"2018","sponsor":["IW3C2, International World Wide Web Conference Committee","SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"start":{"date-parts":[[2018,4,23]]},"end":{"date-parts":[[2018,4,27]]}},"container-title":["Companion of the The Web Conference 2018 on The Web Conference 2018 - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3184558.3186961","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186961&ftid=1958199&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:23Z","timestamp":1750208903000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3184558.3186961"}},"subtitle":["Sequential Group Willingness Optimization under VR Environments"],"proceedings-subject":"The Web Conference 2018","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1145\/3184558.3186961","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}