{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:28:37Z","timestamp":1765546117182,"version":"3.41.0"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2016,10,10]],"date-time":"2016-10-10T00:00:00Z","timestamp":1476057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Spatial Algorithms Syst."],"published-print":{"date-parts":[[2016,10,14]]},"abstract":"<jats:p>Business-location planning, critical to the success of many businesses, can be addressed by the reverse nearest neighbors (RNN) query using geographical proximity to the customers as the main metric to find a store location close to many customers. Nevertheless, we argue that other marketing factors, such as social influence, could be considered in the process of business-location planning. In this article, we propose a framework for business-location planning that takes into account both factors of<jats:italic>geographical proximity<\/jats:italic>and<jats:italic>social influence<\/jats:italic>. An essential task in this framework is to compute the \u201cinfluence spread\u201d of RNNs for candidate locations. Here, the influence spread refers to the number of people influenced via the word-of-mouth effect. To alleviate the excessive computational overhead and long latency in the framework, we trade storage overhead for processing speed by precomputing and storing the social influence between pairs of customers. Based on<jats:italic>Targeted Region (TR)-Oriented<\/jats:italic>and<jats:italic>RNN-Oriented<\/jats:italic>processing strategies, we develop two suites of algorithms that incorporate various efficient pruning and segmentation techniques to enhance our framework. Experiments validate our ideas and evaluate the efficiency of the proposed algorithms over various parameter settings. The experimental results show that (a) TR-oriented and RNN-oriented processing are feasible for supporting the task of location planning; (b) RNN-oriented processing is more efficient than TR-oriented processing; and (c) the optimization technique that we developed significantly improves the efficiency of RNN-oriented and TR-oriented processing.<\/jats:p>","DOI":"10.1145\/2964906","type":"journal-article","created":{"date-parts":[[2016,10,11]],"date-time":"2016-10-11T18:01:35Z","timestamp":1476208895000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Social Influence-Aware Reverse Nearest Neighbor Search"],"prefix":"10.1145","volume":"2","author":[{"given":"Hui-Ju","family":"Hung","sequence":"first","affiliation":[{"name":"The Pennsylvania State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"De-Nian","family":"Yang","sequence":"additional","affiliation":[{"name":"Academia Sinica, Taipei, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang-Chien","family":"Lee","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,10,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516462"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Saad Aljubayrin Jianzhong Qi Christian S. Jensen Rui Zhang Zhen He and Zeyi Wen. 2015. The safest path via safe zones. In ICDE. 531--542. Saad Aljubayrin Jianzhong Qi Christian S. Jensen Rui Zhang Zhen He and Zeyi Wen. 2015. The safest path via safe zones. In ICDE. 531--542.","DOI":"10.1109\/ICDE.2015.7113312"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2014.2081"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.122"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623733"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0166-4"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124368"},{"volume-title":"Fowler","year":"2012","author":"Bond Robert M.","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Christian Borgs Michael Brautbar Jennifer T. Chayes and Brendan Lucier. 2014. Maximizing social influence in nearly optimal time. In SODA. 946--957. Christian Borgs Michael Brautbar Jennifer T. Chayes and Brendan Lucier. 2014. Maximizing social influence in nearly optimal time. In SODA. 946--957.","DOI":"10.1137\/1.9781611973402.70"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488402"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835817"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2772600"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732946"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735703.2735706"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Wei Chen Alex Collins Rachel Cummings Te Ke Zhenming Liu David Rinc\u00f3n Xiaorui Sun Yajun Wang Wei Wei and Yifei Yuan. 2011. Influence maximization in social networks when negative opinions may emerge and propagate. In SDM. 379--390. Wei Chen Alex Collins Rachel Cummings Te Ke Zhenming Liu David Rinc\u00f3n Xiaorui Sun Yajun Wang Wei Wei and Yifei Yuan. 2011. Influence maximization in social networks when negative opinions may emerge and propagate. In SDM. 379--390.","DOI":"10.1137\/1.9781611972818.33"},{"key":"e_1_2_1_16_1","unstructured":"Wei Chen Wei Lu and Ning Zhang. 2012. Time-critical influence maximization in social networks with time-delayed diffusion process. In AAAI. Wei Chen Wei Lu and Ning Zhang. 2012. Time-critical influence maximization in social networks with time-delayed diffusion process. In AAAI."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.118"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020579"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487683"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623693"},{"key":"e_1_2_1_23_1","unstructured":"Mehrdad Farajtabar Manuel Gomez-Rodriguez Mohammad Zamani Nan Du Hongyuan Zha and Le Song. 2015. Back to the past: Source identification in diffusion networks from partially observed cascades. In AISTATS. Mehrdad Farajtabar Manuel Gomez-Rodriguez Mohammad Zamani Nan Du Hongyuan Zha and Le Song. 2015. Back to the past: Source identification in diffusion networks from partially observed cascades. In AISTATS."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01286518"},{"key":"e_1_2_1_25_1","unstructured":"Foursquare. 2009. Retrieved August 21 2016 from https:\/\/foursquare.com\/. Foursquare. 2009. Retrieved August 21 2016 from https:\/\/foursquare.com\/."},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Wei Gao and Guohong Cao. 2011. User-centric data dissemination in disruption tolerant networks. In INFOCOM. 3119--3127. Wei Gao and Guohong Cao. 2011. User-centric data dissemination in disruption tolerant networks. In INFOCOM. 3119--3127.","DOI":"10.1109\/INFCOM.2011.5935157"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.201"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.113"},{"key":"e_1_2_1_29_1","unstructured":"Manuel Gomez-Rodriguez David Balduzzi and Bernhard Sch\u00f6lkopf. 2011. Uncovering the temporal dynamics of diffusion networks. In ICML. 561--568. Manuel Gomez-Rodriguez David Balduzzi and Bernhard Sch\u00f6lkopf. 2011. Uncovering the temporal dynamics of diffusion networks. In ICML. 561--568."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398663"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2789991"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718518"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047492"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963217"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.132"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_37_1","unstructured":"Xinran He Guojie Song Wei Chen and Qingye Jiang. 2012. Influence blocking maximization in social networks under the competitive linear threshold model. In SDM. 463--474. Xinran He Guojie Song Wei Chen and Qingye Jiang. 2012. Influence blocking maximization in social networks under the competitive linear threshold model. In SDM. 463--474."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063971"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487624"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335415"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487657"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_2_1_44_1","unstructured":"Hai-Guang Li Tianyu Cao and Zhao Li. 2014. Learning the information diffusion probabilities by using variance regularized EM algorithm. In ASONAM. 273--280. Hai-Guang Li Tianyu Cao and Zhao Li. 2014. Learning the information diffusion probabilities by using variance regularized EM algorithm. In ASONAM. 273--280."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70757"},{"key":"e_1_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Pei-Lun Liao Chung-Kuang Chou and Ming-Syan Chen. 2016. Uncovering multiple diffusion networks using the first-hand sharing pattern. In SDM. Pei-Lun Liao Chung-Kuang Chou and Ming-Syan Chen. 2016. Uncovering multiple diffusion networks using the first-hand sharing pattern. In SDM.","DOI":"10.1137\/1.9781611974348.8"},{"key":"e_1_2_1_47_1","doi-asserted-by":"crossref","unstructured":"King-Ip Lin Michael Nolen and Congjun Yang. 2003. Applying bulk insertion techniques for dynamic reverse nearest neighbor problems. In IDEAS. 290--297. King-Ip Lin Michael Nolen and Congjun Yang. 2003. Applying bulk insertion techniques for dynamic reverse nearest neighbor problems. In IDEAS. 290--297.","DOI":"10.1109\/IDEAS.2003.1214938"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487673"},{"key":"e_1_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Hao Liu Yaoxue Zhang Yuezhi Zhou Di Zhang Xiaoming Fu and K. K. Ramakrishnan. 2014. Mining checkins from location-sharing services for client-independent IP geolocation. In INFOCOM. 619--627. Hao Liu Yaoxue Zhang Yuezhi Zhou Di Zhang Xiaoming Fu and K. K. Ramakrishnan. 2014. Mining checkins from location-sharing services for client-independent IP geolocation. In INFOCOM. 619--627.","DOI":"10.1109\/INFOCOM.2014.6847987"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487649"},{"key":"e_1_2_1_51_1","first-page":"58","article-title":"Space-time aware behavioral topic modeling for microblog posts","volume":"38","author":"Qu Qiang","year":"2015","journal-title":"IEEE Data Engineering Bulletin"},{"key":"e_1_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Qiang Qu Siyuan Liu Christian S. Jensen Feida Zhu and Christos Faloutsos. 2014a. Interestingness-driven diffusion process summarization in dynamic networks. In ECML\/PKDD. 597--613. Qiang Qu Siyuan Liu Christian S. Jensen Feida Zhu and Christos Faloutsos. 2014a. Interestingness-driven diffusion process summarization in dynamic networks. In ECML\/PKDD. 597--613.","DOI":"10.1007\/978-3-662-44851-9_38"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2014.39"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85567-5_9"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9787.1996.tb01121.x"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487691"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.148"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1099554.1099697"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662039"},{"key":"e_1_2_1_60_1","unstructured":"Congjun Yang and King-Ip Lin. 2001. An index structure for efficient reverse nearest neighbor queries. In ICDE. 485--492. Congjun Yang and King-Ip Lin. 2001. An index structure for efficient reverse nearest neighbor queries. In ICDE. 485--492."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623684"},{"volume-title":"Human behavior and the principle of least effort","author":"Zipf George Kingsley","key":"e_1_2_1_62_1"}],"container-title":["ACM Transactions on Spatial Algorithms and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2964906","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2964906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:40:01Z","timestamp":1750218001000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2964906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,10]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10,14]]}},"alternative-id":["10.1145\/2964906"],"URL":"https:\/\/doi.org\/10.1145\/2964906","relation":{},"ISSN":["2374-0353","2374-0361"],"issn-type":[{"type":"print","value":"2374-0353"},{"type":"electronic","value":"2374-0361"}],"subject":[],"published":{"date-parts":[[2016,10,10]]},"assertion":[{"value":"2015-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-10-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}