{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T09:57:05Z","timestamp":1722938225625},"publisher-location":"New York, New York, USA","reference-count":41,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,4,10]],"date-time":"2018-04-10T00:00:00Z","timestamp":1523318400000},"content-version":"vor","delay-in-days":99,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NEH","award":["HG-229283-15"]},{"name":"ORNL","award":["Task Order 4000143330"]},{"name":"Facebook","award":["Faculty Gift"]},{"name":"NSF","award":["CAREER IIS-1750407"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186174","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T11:53:48Z","timestamp":1523620428000},"page":"1805-1814","source":"Crossref","is-referenced-by-count":4,"title":["Mining E-Commerce Query Relations using Customer Interaction Networks"],"prefix":"10.1145","author":[{"given":"Bijaya","family":"Adhikari","sequence":"first","affiliation":[{"name":"Virginia Tech, Blacksburg, VA, USA"}]},{"given":"Parikshit","family":"Sondhi","sequence":"additional","affiliation":[{"name":"WalmartLabs, Sunnyvale, CA, USA"}]},{"given":"Wenke","family":"Zhang","sequence":"additional","affiliation":[{"name":"WalmartLabs, Sunnyvale, CA, USA"}]},{"given":"Mohit","family":"Sharma","sequence":"additional","affiliation":[{"name":"WalmartLabs, Sunnyvale, CA, USA"}]},{"given":"B. Aditya","family":"Prakash","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA, USA"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186174-1","unstructured":"Ricardo Baeza-Yates. 2007. Graphs from search engine queries. SOFSEM 2007: Theory and Practice of Computer Science (2007), 1--8."},{"key":"key-10.1145\/3178876.3186174-2","unstructured":"Ricardo A Baeza-Yates, Carlos A Hurtado, Marcelo Mendoza, et al. 2004. Query Recommendation Using Query Logs in Search Engines.. In EDBT workshops, Vol. 3268. Springer, 588--596."},{"key":"key-10.1145\/3178876.3186174-3","unstructured":"Michael J Barber. 2007. Modularity and community detection in bipartite networks. Physical Review E 76, 6 (2007), 066102."},{"key":"key-10.1145\/3178876.3186174-4","doi-asserted-by":"crossref","unstructured":"Doug Beeferman and Adam Berger. 2000. Agglomerative clustering of a search engine query log. In Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 407--416.","DOI":"10.1145\/347090.347176"},{"key":"key-10.1145\/3178876.3186174-5","unstructured":"Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment 2008, 10 (2008), P10008."},{"key":"key-10.1145\/3178876.3186174-6","doi-asserted-by":"crossref","unstructured":"Paolo Boldi, Francesco Bonchi, Carlos Castillo, Debora Donato, Aristides Gionis, and Sebastiano Vigna. 2008. The query-flow graph: model and applications. In Proceedings of the 17th ACM conference on Information and knowledge management. ACM, 609--618.","DOI":"10.1145\/1458082.1458163"},{"key":"key-10.1145\/3178876.3186174-7","doi-asserted-by":"crossref","unstructured":"Paolo Boldi, Francesco Bonchi, Carlos Castillo, Debora Donato, and Sebastiano Vigna. 2009. Query suggestions using query-flow graphs. In Proceedings of the 2009 workshop on Web Search Click Data. ACM, 56--63.","DOI":"10.1145\/1507509.1507518"},{"key":"key-10.1145\/3178876.3186174-8","doi-asserted-by":"crossref","unstructured":"Phillip Bonacich. 2007. Some unique properties of eigenvector centrality. Social networks 29, 4 (2007), 555--564.","DOI":"10.1016\/j.socnet.2007.04.002"},{"key":"key-10.1145\/3178876.3186174-9","doi-asserted-by":"crossref","unstructured":"Christian Borgs, Michael Brautbar, Jennifer Chayes, and Brendan Lucier. 2014. Maximizing social influence in nearly optimal time. In Proceedings of the TwentyFifth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 946--957.","DOI":"10.1137\/1.9781611973402.70"},{"key":"key-10.1145\/3178876.3186174-10","doi-asserted-by":"crossref","unstructured":"Andrei Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, and Janet Wiener. 2000. Graph structure in the web. Computer networks 33, 1 (2000), 309--320.","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"key-10.1145\/3178876.3186174-11","doi-asserted-by":"crossref","unstructured":"Wei Chen, Yajun Wang, and Siyu Yang. 2009. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 199--208.","DOI":"10.1145\/1557019.1557047"},{"key":"key-10.1145\/3178876.3186174-12","doi-asserted-by":"crossref","unstructured":"Nick Craswell and Martin Szummer. 2007. Random Walks on the Click Graph. In Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '07). ACM, New York, NY, USA, 239--246. https:\/\/doi.org\/10.1145\/1277741.1277784","DOI":"10.1145\/1277741.1277784"},{"key":"key-10.1145\/3178876.3186174-13","doi-asserted-by":"crossref","unstructured":"Atish Das Sarma, Nish Parikh, and Neel Sundaresan. 2014. E-commerce product search: personalization, diversification, and beyond. In Proceedings of the 23rd International Conference on World Wide Web. ACM, 189--190.","DOI":"10.1145\/2567948.2577272"},{"key":"key-10.1145\/3178876.3186174-14","doi-asserted-by":"crossref","unstructured":"Michelangelo Diligenti, Marco Gori, and Marco Maggini. 2011. A unified representation of web logs for mining applications. Information Retrieval 14, 3 (2011), 215--236.","DOI":"10.1007\/s10791-010-9160-6"},{"key":"key-10.1145\/3178876.3186174-15","unstructured":"Nan Du, Le Song, Manuel Gomez Rodriguez, and Hongyuan Zha. 2013. Scalable influence estimation in continuous-time diffusion networks. In Advances in neural information processing systems. 3147--3155."},{"key":"key-10.1145\/3178876.3186174-16","doi-asserted-by":"crossref","unstructured":"Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. 1999. On power-law relationships of the internet topology. In ACM SIGCOMM computer communication review, Vol. 29. ACM, 251--262.","DOI":"10.1145\/316188.316229"},{"key":"key-10.1145\/3178876.3186174-17","unstructured":"Bruno M Fonseca, Paulo Braz Golgher, Edleno Silva de Moura, and Nivio Ziviani. 2003. Using association rules to discover search engines related queries. In Web Congress, 2003. Proceedings. First Latin American. IEEE, 66--71."},{"key":"key-10.1145\/3178876.3186174-18","unstructured":"Alexandre P Francisco, Ricardo Baeza-Yates, and Arlindo L Oliveira. 2012. Mining query log graphs towards a query folksonomy. Concurrency and Computation: Practice and Experience 24, 17 (2012), 2179--2192."},{"key":"key-10.1145\/3178876.3186174-19","unstructured":"Alexandre P Francisco, Ricardo A Baeza-Yates, and Arlindo L Oliveira. 2008. Clique Analysis of Query Log Graphs.. In SPIRE, Vol. 5280. Springer, 188--199."},{"key":"key-10.1145\/3178876.3186174-20","doi-asserted-by":"crossref","unstructured":"Michelle Girvan and Mark EJ Newman. 2002. Community structure in social and biological networks. Proceedings of the national academy of sciences 99, 12 (2002), 7821--7826.","DOI":"10.1073\/pnas.122653799"},{"key":"key-10.1145\/3178876.3186174-21","doi-asserted-by":"crossref","unstructured":"Kalervo Järvelin and Jaana Kekäläinen. 2002. Cumulated Gain-based Evaluation of IR Techniques. ACM Trans. Inf. Syst. 20, 4 (Oct. 2002), 422--446. https:\/\/doi. org\/10.1145\/582415.582418","DOI":"10.1145\/582415.582418"},{"key":"key-10.1145\/3178876.3186174-22","doi-asserted-by":"crossref","unstructured":"Daxin Jiang, Jian Pei, and Hang Li. 2013. Mining search and browse logs for web search: A survey. ACM Transactions on Intelligent Systems and Technology (TIST) 4, 4 (2013), 57.","DOI":"10.1145\/2508037.2508038"},{"key":"key-10.1145\/3178876.3186174-23","doi-asserted-by":"crossref","unstructured":"Shan Jiang, Yuening Hu, Changsung Kang, Tim Daly Jr, Dawei Yin, Yi Chang, and Chengxiang Zhai. 2016. Learning Query and Document Relevance from a Web-scale Click Graph. In Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval. ACM, 185--194.","DOI":"10.1145\/2911451.2911531"},{"key":"key-10.1145\/3178876.3186174-24","doi-asserted-by":"crossref","unstructured":"David Kempe, Jon Kleinberg, and Éva Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 137--146.","DOI":"10.1145\/956750.956769"},{"key":"key-10.1145\/3178876.3186174-25","doi-asserted-by":"crossref","unstructured":"Matthieu Latapy, Clémence Magnien, and Nathalie Del Vecchio. 2008. Basic notions for the analysis of large two-mode networks. Social networks 30, 1 (2008), 31--48.","DOI":"10.1016\/j.socnet.2007.04.006"},{"key":"key-10.1145\/3178876.3186174-26","unstructured":"Xin Liu, Weichu Liu, Tsuyoshi Murata, and Ken Wakita. 2014. A framework for community detection in heterogeneous multi-relational networks. Advances in Complex Systems 17, 06 (2014), 1450018."},{"key":"key-10.1145\/3178876.3186174-27","unstructured":"Zitao Liu, Gyanit Singh, Nish Parikh, and Neel Sundaresan. 2014. A large scale query logs analysis for assessing personalization opportunities in e-commerce sites. WSCD ?2014 New York, New York USA, ACM-2014 (2014)."},{"key":"key-10.1145\/3178876.3186174-28","doi-asserted-by":"crossref","unstructured":"Michael Mitzenmacher. 2004. A brief history of generative models for power law and lognormal distributions. Internet mathematics 1, 2 (2004), 226--251.","DOI":"10.1080\/15427951.2004.10129088"},{"key":"key-10.1145\/3178876.3186174-29","unstructured":"George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions?I. Mathematical Programming 14, 1 (1978), 265--294."},{"key":"key-10.1145\/3178876.3186174-30","unstructured":"Mark EJ Newman. 2002. Assortative mixing in networks. Physical review letters 89, 20 (2002), 208701."},{"key":"key-10.1145\/3178876.3186174-31","unstructured":"Mark EJ Newman. 2003. Mixing patterns in networks. Physical Review E 67, 2 (2003), 026126."},{"key":"key-10.1145\/3178876.3186174-32","unstructured":"Mark EJ Newman. 2006. Modularity and community structure in networks. Proceedings of the national academy of sciences 103, 23 (2006), 8577--8582."},{"key":"key-10.1145\/3178876.3186174-33","unstructured":"Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank citation ranking: Bringing order to the web. Technical Report. Stanford InfoLab."},{"key":"key-10.1145\/3178876.3186174-34","doi-asserted-by":"crossref","unstructured":"Zeqian Shen and Neel Sundaresan. 2011. eBay: an E-commerce marketplace as a complex network. In Proceedings of the fourth ACM international conference on Web search and data mining. ACM, 655--664.","DOI":"10.1145\/1935826.1935916"},{"key":"key-10.1145\/3178876.3186174-35","doi-asserted-by":"crossref","unstructured":"Yang Song, Dengyong Zhou, and Li-wei He. 2012. Query suggestion by constructing term-transition graphs. In Proceedings of the fifth ACM international conference on Web search and data mining. ACM, 353--362.","DOI":"10.1145\/2124295.2124339"},{"key":"key-10.1145\/3178876.3186174-36","unstructured":"Jeffrey Travers and Stanley Milgram. 1967. The small world problem. Phychology Today 1 (1967), 61--67."},{"key":"key-10.1145\/3178876.3186174-37","doi-asserted-by":"crossref","unstructured":"Ji-Rong Wen, Jian-Yun Nie, and Hong-Jiang Zhang. 2001. Clustering user queries of a search engine. In Proceedings of the 10th international conference on World Wide Web. acm, 162--168.","DOI":"10.1145\/371920.371974"},{"key":"key-10.1145\/3178876.3186174-38","doi-asserted-by":"crossref","unstructured":"Jaewon Yang and Jure Leskovec. 2013. Overlapping community detection at scale: a nonnegative matrix factorization approach. In Proceedings of the sixth ACM international conference on Web search and data mining. ACM, 587--596.","DOI":"10.1145\/2433396.2433471"},{"key":"key-10.1145\/3178876.3186174-39","doi-asserted-by":"crossref","unstructured":"Jun Zhang, Mark S Ackerman, and Lada Adamic. 2007. Expertise networks in online communities: structure and algorithms. In Proceedings of the 16th international conference on World Wide Web. ACM, 221--230.","DOI":"10.1145\/1242572.1242603"},{"key":"key-10.1145\/3178876.3186174-40","doi-asserted-by":"crossref","unstructured":"Zhiyong Zhang and Olfa Nasraoui. 2006. Mining search engine query logs for query recommendation. In Proceedings of the 15th international conference on World Wide Web. ACM, 1039--1040.","DOI":"10.1145\/1135777.1136004"},{"key":"key-10.1145\/3178876.3186174-41","unstructured":"Vinko Zlatić, Miran Božičević, Hrvoje Štefančić, and Mladen Domazet. 2006. Wikipedias: Collaborative web-based encyclopedias as complex networks. Physical Review E 74, 1 (2006), 016115."}],"event":{"number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"acronym":"WWW '18","name":"the 2018 World Wide Web Conference","start":{"date-parts":[[2018,4,23]]},"location":"Lyon, France","end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186174&ftid=1957380&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T14:27:50Z","timestamp":1523629670000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186174"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186174","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}