{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:03:30Z","timestamp":1750309410079,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T00:00:00Z","timestamp":1729468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100012246","name":"Priority Academic Program Development of Jiangsu Higher Education Institutions","doi-asserted-by":"publisher","id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100012246","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Jiangsu Province","award":["BK20211307"],"award-info":[{"award-number":["BK20211307"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,10,21]]},"DOI":"10.1145\/3627673.3679848","type":"proceedings-article","created":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T19:34:11Z","timestamp":1729452851000},"page":"1523-1532","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["KMCT:<i>k<\/i>-Means Clustering of Trajectories Efficiently in Location-Based Services"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6983-8088","authenticated-orcid":false,"given":"Yuanjun","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8980-4950","authenticated-orcid":false,"given":"Guanfeng","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computing, Macquarie University, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2418-090X","authenticated-orcid":false,"given":"Qingzhi","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2355-288X","authenticated-orcid":false,"given":"Zhixu","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2055-2553","authenticated-orcid":false,"given":"Shiting","family":"Wen","sequence":"additional","affiliation":[{"name":"School of Computer and Data Engneering, NingboTech University, Ningbo, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5123-9279","authenticated-orcid":false,"given":"Lei","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6368-576X","authenticated-orcid":false,"given":"An","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"David Arthur and Sergei Vassilvitskii. 2007. K-means: the advantages of careful seeding. In SODA 1027--1035."},{"key":"e_1_3_2_1_2_1","unstructured":"Olivier Bachem Mario Lucic S. Hamed Hassani and Andreas Krause. 2016. Fast and provably good seedings for k-means. In NIPS 55--63."},{"key":"e_1_3_2_1_3_1","volume-title":"Berndt and James Clifford","author":"Donald","year":"1994","unstructured":"Donald J. Berndt and James Clifford. 1994. Using dynamic time warping to find patterns in time series. In KDD, 359--370."},{"key":"e_1_3_2_1_4_1","volume-title":"Chiok Yew Ho, and De-Nian Yang","author":"Chen Bing-Jyue","year":"2024","unstructured":"Bing-Jyue Chen, Chiok Yew Ho, and De-Nian Yang. 2024. After: adaptive friend discovery for temporal-spatial and social-aware xr. In ICDE, 2639--2652."},{"key":"e_1_3_2_1_5_1","volume-title":"Ng","author":"Chen Lei","year":"2004","unstructured":"Lei Chen and Raymond T. Ng. 2004. On the marriage of lp-norms and edit distance. In VLDB, 792--803."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Pranita Dewan Raghu Ganti and Mudhakar Srivatsa. 2017. Som-tc: self-organizing map for hierarchical trajectory clustering. In ICDCS 1042--1052.","DOI":"10.1109\/ICDCS.2017.244"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.01.007"},{"key":"e_1_3_2_1_8_1","unstructured":"Martin Ester Hans-Peter Kriegel J\u00f6rg Sander and Xiaowei Xu. 1996. A densitybased algorithm for discovering clusters in large spatial databases with noise. In KDD 226--231."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00652-x"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Ziquan Fang Yuntao Du Lu Chen Yujia Hu Yunjun Gao and Gang Chen. 2021. E2dtc: an end to end deep trajectory clustering framework via self-training. In ICDE 696--707.","DOI":"10.1109\/ICDE51399.2021.00066"},{"key":"e_1_3_2_1_11_1","volume-title":"Silva","author":"Ferreira Nivan","year":"2013","unstructured":"Nivan Ferreira, James T. Klosowski, Carlos E. Scheidegger, and Cl\u00e1udio T. Silva. 2013. Vector field k-means: clustering trajectories by fitting multiple vector fields. In EuroVis, 201--210."},{"key":"e_1_3_2_1_12_1","first-page":"II","article-title":"Similarity based vehicle trajectory clustering and anomaly detection","volume":"2","author":"Fu Zhouyu","year":"2005","unstructured":"Zhouyu Fu, Weiming Hu, and Tieniu Tan. 2005. Similarity based vehicle trajectory clustering and anomaly detection. In ICIP. Vol. 2, II--602.","journal-title":"ICIP."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3312319"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Yang Guo Zhiqi Wang Jin Xue and Zili Shao. 2024. A spatio-temporal series data model with efficient indexing and layout for cloud-based trajectory data management. In ICDE 1171--1184.","DOI":"10.1109\/ICDE60146.2024.00313"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Antonin Guttman. 1984. R-trees: a dynamic index structure for spatial searching. In SIGMOD 47--57.","DOI":"10.1145\/971697.602266"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2013.119"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2021.102476"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Nan Jiang Haitao Yuan Jianing Si Minxiao Chen and Shangguang Wang. 2024. Towards effective next poi prediction: spatial and semantic augmentation with remote sensing data. In ICDE 5061--5074.","DOI":"10.1109\/ICDE60146.2024.00104"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Sun Jianhua Li Yuxuan Fang Hao-Shu and Lu Cewu. 2021. Three steps to multimodal trajectory prediction: modality clustering classification and synthesis. In ICCV 13230--13239.","DOI":"10.1109\/ICCV48922.2021.01300"},{"key":"e_1_3_2_1_20_1","unstructured":"Jae-Gil Lee Jiawei Han and Kyu-Young Whang. 2007. Trajectory clustering: a partition-and-group framework. In SIGMOD 593--604."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Xiucheng Li Kaiqi Zhao Gao Cong Christian S. Jensen and Wei Wei. 2018. Deep representation learning for trajectory similarity computation. In ICDE 617--628.","DOI":"10.1109\/ICDE.2018.00062"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-023-00833-w"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2013.2269780"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3287739"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Yuanjun Liu An Liu Guanfeng Liu Zhixu Li and Lei Zhao. 2023. Towards effective trajectory similarity measure in linear time. In DASFAA 283--299.","DOI":"10.1007\/978-3-031-30637-2_19"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Zhuoheng Lv and Qingxin Liu. 2023. Distance-weighted k-means clustering algorithm based on local density. In ICAICE 90--96.","DOI":"10.1145\/3652628.3652643"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2937882"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3320184"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Alex Rodriguez and Alessandro Laio. 2014. Clustering by fast search and find of density peaks. Science 344 6191 1492--1496.","DOI":"10.1126\/science.1242072"},{"key":"e_1_3_2_1_31_1","first-page":"1528","article-title":"Filling delivery time automatically based on couriers? trajectories","volume":"35","author":"Ruan Sijie","year":"2023","unstructured":"Sijie Ruan, Xi Fu, Cheng Long, Zi Xiong, Jie Bao, Ruiyuan Li, Yiheng Chen, Shengnan Wu, and Yu Zheng. 2023. Filling delivery time automatically based on couriers? trajectories. TKDE, 35, 2, 1528--1540.","journal-title":"TKDE"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Junjun Si Yang Xiang Jin Yang Li Li Bo Tu Xiangqun Chen and Rongqing Zhang. 2023. A dual self-supervised deep trajectory clustering method. In ISCC 1169--1172.","DOI":"10.1109\/ISCC58397.2023.10217908"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3357377.3357380"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Shuo Wang Surya Nepal Richard O. Sinnott and Carsten Rudolph. 2019. PSTM: privacy-protected social tie mining of individual trajectories. In ICWS 1--10.","DOI":"10.1109\/ICWS.2019.00014"},{"key":"e_1_3_2_1_35_1","first-page":"3567","article-title":"Vehicle trajectory clustering based on dynamic representation learning of internet of vehicles","volume":"22","author":"Wang Wei","year":"2021","unstructured":"Wei Wang, Feng Xia, Hansong Nie, Zhikui Chen, Zhiguo Gong, Xiangjie Kong, and Wei Wei. 2021. Vehicle trajectory clustering based on dynamic representation learning of internet of vehicles. T-ITS, 22, 6, 3567--3576.","journal-title":"T-ITS"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"JishangWei Hongfeng Yu Jacqueline H. Chen and Kwan-Liu Ma. 2011. Parallel clustering for visualizing large scientific line data. In LDAV 47--55.","DOI":"10.1109\/LDAV.2011.6092316"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Jing Yuan Yu Zheng Chengyang Zhang Wenlei Xie Xing Xie Guangzhong Sun and Yan Huang. 2010. T-drive: driving directions based on taxi trajectories. In ACM-GIS 99--108.","DOI":"10.1145\/1869790.1869807"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Kaiqi Zhang Hong Gao Xixian Han Jian Chen and Jianzhong Li. 2022. Maximizing range sum in trajectory data. In ICDE 755--766.","DOI":"10.1109\/ICDE53745.2022.00061"},{"key":"e_1_3_2_1_39_1","volume-title":"Popularity-aware spatial keyword search on activity trajectories. WWW, 20, 4, (July","author":"Zheng Kai","year":"2017","unstructured":"Kai Zheng, Bolong Zheng, Jiajie Xu, Guanfeng Liu, An Liu, and Zhixu Li. 2017. Popularity-aware spatial keyword search on activity trajectories. WWW, 20, 4, (July 2017), 749--773."},{"key":"e_1_3_2_1_40_1","first-page":"32","article-title":"Geolife: A collaborative social networking service among user, location and trajectory","volume":"33","author":"Zheng Yu","year":"2010","unstructured":"Yu Zheng, Xing Xie, and Wei-Ying Ma. 2010. Geolife: A collaborative social networking service among user, location and trajectory. IEEE Data Eng. Bull., 33, 2, 32--39.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Lv Zhongjian Xu Jiajie Zhao Pengpeng Liu Guanfeng Zhao Lei and Xiaofang Zhou. 2017. Outlier trajectory detection: a trajectory analytics based approach. In DASFAA 231--246.","DOI":"10.1007\/978-3-319-55753-3_15"},{"volume-title":"AAAI number 20.","author":"Zhuang Zhuang","key":"e_1_3_2_1_42_1","unstructured":"Zhuang Zhuang, Wei Tianxin, Liu Lingbo, Qi Heng, Shen Yanming, and Yin Baocai. 2024. Tau: trajectory data augmentation with uncertainty for next poi recommendation. In AAAI number 20. Vol. 38, 22565--22573."}],"event":{"name":"CIKM '24: The 33rd ACM International Conference on Information and Knowledge Management","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Boise ID USA","acronym":"CIKM '24"},"container-title":["Proceedings of the 33rd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627673.3679848","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3627673.3679848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:58:08Z","timestamp":1750294688000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627673.3679848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,21]]},"references-count":42,"alternative-id":["10.1145\/3627673.3679848","10.1145\/3627673"],"URL":"https:\/\/doi.org\/10.1145\/3627673.3679848","relation":{},"subject":[],"published":{"date-parts":[[2024,10,21]]},"assertion":[{"value":"2024-10-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}