{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T19:53:44Z","timestamp":1772308424469,"version":"3.50.1"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,11]]},"abstract":"<jats:p>Discovering co-movement patterns from large-scale trajectory databases is an important mining task and has a wide spectrum of applications. Previous studies have identified several types of interesting co-movement patterns and show-cased their usefulness. In this paper, we make two key contributions to this research field. First, we propose a more general co-movement pattern to unify those defined in the past literature. Second, we propose two types of parallel and scalable frameworks and deploy them on Apache Spark. To the best of our knowledge, this is the first work to mine co-movement patterns in real life trajectory databases with hundreds of millions of points. Experiments on three real life large-scale trajectory datasets have verified the efficiency and scalability of our proposed solutions.<\/jats:p>","DOI":"10.14778\/3025111.3025114","type":"journal-article","created":{"date-parts":[[2017,1,24]],"date-time":"2017-01-24T15:29:41Z","timestamp":1485271781000},"page":"313-324","source":"Crossref","is-referenced-by-count":48,"title":["A general and parallel platform for mining co-movement patterns over large-scale trajectories"],"prefix":"10.14778","volume":"10","author":[{"given":"Qi","family":"Fan","sequence":"first","affiliation":[{"name":"NUS Graduate School for Integrative Science and Technology, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongxiang","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huayu","family":"Wu","sequence":"additional","affiliation":[{"name":"Institute for Infocomm Research, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[{"name":"NUS Graduate School for Integrative Science and Technology, Singapore and School of Computing, NUS, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,11]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"487","volume-title":"VLDB","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal , R. Srikant , Fast algorithms for mining association rules . In VLDB , pages 487 -- 499 , 1994 . R. Agrawal, R. Srikant, et al. Fast algorithms for mining association rules. In VLDB, pages 487--499, 1994."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1876037.1876057"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-014-0220-8"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.3138\/FM57-6770-U75U-7727"},{"key":"e_1_2_1_5_1","first-page":"226","volume-title":"SIGKDD","author":"Ester M.","year":"1996","unstructured":"M. Ester , H.-P. Kriegel , J. Sander , X. Xu , A density-based algorithm for discovering clusters in large spatial databases with noise . In SIGKDD , pages 226 -- 231 , 1996 . M. Ester, H.-P. Kriegel, J. Sander, X. Xu, et al. A density-based algorithm for discovering clusters in large spatial databases with noise. In SIGKDD, pages 226--231, 1996."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183471.1183479"},{"key":"e_1_2_1_7_1","volume-title":"TKDE, page 1","author":"Guo L.","year":"2016","unstructured":"L. Guo , D. Zhang , G. Cong , W. Wu , and K.-L. Tan . Influence maximization in trajectory databases . In TKDE, page 1 , 2016 . L. Guo, D. Zhang, G. Cong, W. Wu, and K.-L. Tan. Influence maximization in trajectory databases. In TKDE, page 1, 2016."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453971"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CloudCom.2012.6427526"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_21"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213840"},{"key":"e_1_2_1_12_1","first-page":"201","volume-title":"DSDH","author":"Laube P.","year":"2005","unstructured":"P. Laube , M. van Kreveld , and S. Imfeld . Finding remodetecting relative motion patterns in geospatial lifelines . In DSDH , pages 201 -- 215 . 2005 . P. Laube, M. van Kreveld, and S. Imfeld. Finding remodetecting relative motion patterns in geospatial lifelines. In DSDH, pages 201--215. 2005."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.193"},{"key":"e_1_2_1_14_1","volume-title":"Effective online group discovery in trajectory databases","author":"Li X.","year":"2013","unstructured":"X. Li , V. Ceikute , S. Jensen , Christian, and K.-L. Tan . Effective online group discovery in trajectory databases . 2013 . X. Li, V. Ceikute, S. Jensen, Christian, and K.-L. Tan. Effective online group discovery in trajectory databases. 2013."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2015.02.001"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920934"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835942"},{"key":"e_1_2_1_18_1","first-page":"21","volume-title":"DMKD","author":"Pei J.","year":"2000","unstructured":"J. Pei , J. Han , R. Mao , : An efficient algorithm for mining frequent closed itemsets . In DMKD , pages 21 -- 30 , 2000 . J. Pei, J. Han, R. Mao, et al. Closet: An efficient algorithm for mining frequent closed itemsets. In DMKD, pages 21--30, 2000."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956779"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2005.04.006"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.150"},{"key":"e_1_2_1_22_1","first-page":"15","volume-title":"USENIX","author":"Zaharia M.","year":"2012","unstructured":"M. Zaharia , M. Chowdhury , T. Das , A. Dave , J. Ma , M. McCauley , M. J. Franklin , S. Shenker , and I. Stoica . Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing . In USENIX , pages 15 -- 28 , 2012 . M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, M. J. Franklin, S. Shenker, and I. Stoica. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In USENIX, pages 15--28, 2012."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544829"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2743025"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2030112.2030126"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3025111.3025114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:19:05Z","timestamp":1672222745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3025111.3025114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["10.14778\/3025111.3025114"],"URL":"https:\/\/doi.org\/10.14778\/3025111.3025114","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,11]]}}}