{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:48Z","timestamp":1750221288309,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":24,"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\/3178876.3186112","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"459-468","source":"Crossref","is-referenced-by-count":2,"title":["Mining Tours and Paths in Activity Networks"],"prefix":"10.1145","author":[{"given":"Sofia Maria","family":"Nikolakaki","sequence":"first","affiliation":[{"name":"Boston University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charalampos","family":"Mavroforakis","sequence":"additional","affiliation":[{"name":"Boston University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alina","family":"Ene","sequence":"additional","affiliation":[{"name":"Boston University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evimaria","family":"Terzi","sequence":"additional","affiliation":[{"name":"Boston University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186112-1","doi-asserted-by":"crossref","unstructured":"A. Archer, M. H. Bateni, M. T. Hajiaghayi, and H. Karloff. 2011. Improved approximation algorithms for prize-collecting Steiner tree and TSP. Journal on Computing (2011).","DOI":"10.1137\/090771429"},{"key":"key-10.1145\/3178876.3186112-2","doi-asserted-by":"crossref","unstructured":"M. H. Bateni, C. Chekuri, A. Ene, M. T. Hajiaghayi, N. Korula, and D. Marx. 2011. Prize-collecting Steiner problems on planar graphs SODA. SIAM.","DOI":"10.1137\/1.9781611973082.79"},{"key":"key-10.1145\/3178876.3186112-3","doi-asserted-by":"crossref","unstructured":"J. Cadena, F. Chen, and A. Vullikanti. 2017. Near-Optimal and Practical Algorithms for Graph Scan Statistics SDM. SIAM.","DOI":"10.1137\/1.9781611974973.70"},{"key":"key-10.1145\/3178876.3186112-4","doi-asserted-by":"crossref","unstructured":"K. Chaudhuri, B. Godfrey, S. Rao, and K. Talwar. 2003. Paths, trees, and minimum latency tours. In FOCS. IEEE.","DOI":"10.1109\/SFCS.2003.1238179"},{"key":"key-10.1145\/3178876.3186112-5","doi-asserted-by":"crossref","unstructured":"F. Chen and D. B. Neill. 2014. Non-parametric scan statistics for event detection and forecasting in heterogeneous social media graphs. In SIGKDD. ACM.","DOI":"10.1145\/2623330.2623619"},{"key":"key-10.1145\/3178876.3186112-6","doi-asserted-by":"crossref","unstructured":"L. Duczmal, M. Kulldorff, and L. Huang. 2006. Evaluation of spatial scan statistics for irregularly shaped clusters. Journal of Computational and Graphical Statistics (2006).","DOI":"10.1198\/106186006X112396"},{"key":"key-10.1145\/3178876.3186112-7","unstructured":"M. Ester, H. Kriegel, J. Sander, and X. Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In SIGKDD. ACM."},{"key":"key-10.1145\/3178876.3186112-8","doi-asserted-by":"crossref","unstructured":"R. Fagin, R. Guha, R. Kumar, J. Novak, D. Sivakumar, and A. Tomkins. 2005. Multi-structural databases. In SIGMOD. ACM.","DOI":"10.1145\/1065167.1065191"},{"key":"key-10.1145\/3178876.3186112-9","doi-asserted-by":"crossref","unstructured":"A. Gionis, M. Mathioudakis, and A. Ukkonen. 2017. Bump hunting in the dark: Local discrepancy maximization on graphs. TKDE (2017).","DOI":"10.1109\/TKDE.2016.2571693"},{"key":"key-10.1145\/3178876.3186112-10","doi-asserted-by":"crossref","unstructured":"M. X. Goemans and D. P. Williamson. 1995. A general approximation technique for constrained forest problems. Journal on Computing (1995).","DOI":"10.1137\/S0097539793242618"},{"key":"key-10.1145\/3178876.3186112-11","unstructured":"C. Hegde, P. Indyk, and L. Schmidt. 2014. A fast, adaptive variant of the Goemans-Williamson scheme for the prize-collecting Steiner tree problem. In 11th DIMACS Challenge Workshop."},{"key":"key-10.1145\/3178876.3186112-12","unstructured":"C. Hegde, P. Indyk, and L. Schmidt. 2015. A nearly-linear time framework for graph-structured sparsity ICML."},{"key":"key-10.1145\/3178876.3186112-13","unstructured":"D. S Johnson, M. Minkoff, and S. Phillips. 2000. The prize collecting steiner tree problem: theory and practice SODA. SIAM."},{"key":"key-10.1145\/3178876.3186112-14","doi-asserted-by":"crossref","unstructured":"M. Kulldorff. 1997. A spatial scan statistic. Communications in Statistics-Theory and methods (1997).","DOI":"10.1080\/03610929708831995"},{"key":"key-10.1145\/3178876.3186112-15","doi-asserted-by":"crossref","unstructured":"T. Lappas, E. Terzi, D. Gunopulos, and H. Mannila. 2010. Finding effectors in social networks. In SIGKDD. ACM.","DOI":"10.1145\/1835804.1835937"},{"key":"key-10.1145\/3178876.3186112-16","doi-asserted-by":"crossref","unstructured":"T. Lappas, M. R. Vieira, D. Gunopulos, and V. J. Tsotras. 2012. On the spatiotemporal burstiness of terms. PVLDB (2012).","DOI":"10.14778\/2311906.2311911"},{"key":"key-10.1145\/3178876.3186112-17","doi-asserted-by":"crossref","unstructured":"A. Lulli, M. Dell'Amico, P. Michiardi, and L. Ricci. 2016. NG-DBSCAN: scalable density-based clustering for arbitrary data. PVLDB (2016).","DOI":"10.1109\/BigData.2015.7363845"},{"key":"key-10.1145\/3178876.3186112-18","doi-asserted-by":"crossref","unstructured":"S. T. Mai, I. Assent, and M. Storgaard. 2016. AnyDBC: an efficient anytime density-based clustering algorithm for very large complex datasets. In SIGKDD. ACM.","DOI":"10.1145\/2939672.2939750"},{"key":"key-10.1145\/3178876.3186112-19","doi-asserted-by":"crossref","unstructured":"D. Quercia, R. Schifanella, and L. M. Aiello. 2014. The shortest path to happiness: Recommending beautiful, quiet, and happy routes in the city. In HT. ACM.","DOI":"10.1145\/2631775.2631799"},{"key":"key-10.1145\/3178876.3186112-20","doi-asserted-by":"crossref","unstructured":"A. Rozenshtein, P.and Anagnostopoulos, A. Gionis, and N. Tatti. 2014. Event detection in activity networks. In SIGKDD. ACM.","DOI":"10.1145\/2623330.2623674"},{"key":"key-10.1145\/3178876.3186112-21","doi-asserted-by":"crossref","unstructured":"S. Seufert, S. Bedathur, J. Mestre, and G. Weikum. 2010. Bonsai: Growing interesting small trees. In ICDM. IEEE.","DOI":"10.1109\/ICDM.2010.86"},{"key":"key-10.1145\/3178876.3186112-22","unstructured":"G. Sheikholeslami, S. Chatterjee, and A. Zhang. 1998. Wavecluster: A multi-resolution clustering approach for very large spatial databases VLDB."},{"key":"key-10.1145\/3178876.3186112-23","doi-asserted-by":"crossref","unstructured":"J. Shi, N. Mamoulis, D. Wu, and D. W. Cheung. 2014. Density-based place clustering in geo-social networks SIGMOD. ACM.","DOI":"10.1145\/2588555.2610497"},{"key":"key-10.1145\/3178876.3186112-24","doi-asserted-by":"crossref","unstructured":"S. Speakman, Y. Zhang, and D. B. Neill. 2013. Dynamic pattern detection with temporal consistency and connectivity constraints ICDM. IEEE.","DOI":"10.1109\/ICDM.2013.66"}],"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":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186112","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186112&ftid=1957499&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:28Z","timestamp":1750212688000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186112"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186112","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}