{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T14:51:28Z","timestamp":1776351088613,"version":"3.51.2"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T00:00:00Z","timestamp":1598832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["HUST: Grants No. 2019kfyXKJC021, 2019kfyXJJS091"],"award-info":[{"award-number":["HUST: Grants No. 2019kfyXKJC021, 2019kfyXJJS091"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012659","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902134, 61572215"],"award-info":[{"award-number":["61902134, 61572215"]}],"id":[{"id":"10.13039\/501100012659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM\/IMS Trans. Data Sci."],"published-print":{"date-parts":[[2020,8,31]]},"abstract":"<jats:p>\n                    The rapid explosion of urban cities has modernized the residents\u2019 lives and generated a large amount of data (e.g., human mobility data, traffic data, and geographical data), especially the activity trajectory data that contains spatial and temporal as well as activity information. With these data, urban computing enables to provide better services such as location-based applications for smart cities. Recently, a novel exemplar query paradigm becomes popular that considers a user query as an example of the data of interest, which plays an important role in dealing with the information deluge. In this article, we propose a novel query, called searching activity trajectory by exemplar, where, given an exemplar trajectory \u03c4\n                    <jats:sub>\n                      <jats:italic toggle=\"yes\">q<\/jats:italic>\n                    <\/jats:sub>\n                    , the goal is to find the top-\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    trajectories with the smallest distances to \u03c4\n                    <jats:sub>\n                      <jats:italic toggle=\"yes\">q<\/jats:italic>\n                    <\/jats:sub>\n                    . We first introduce an inverted-index-based algorithm (ILA) using threshold ranking strategy. To further improve the efficiency, we propose a gridtree threshold approach (GTA) to quickly locate candidates and prune unnecessary trajectories. In addition, we extend GTA to support parallel processing. Finally, extensive experiments verify the high efficiency and scalability of the proposed algorithms.\n                  <\/jats:p>","DOI":"10.1145\/3379561","type":"journal-article","created":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T08:37:20Z","timestamp":1594111040000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Searching Activity Trajectories by Exemplar"],"prefix":"10.1145","volume":"1","author":[{"given":"Zhong","family":"Yang","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8639-4570","authenticated-orcid":false,"given":"Bolong","family":"Zheng","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohui","family":"Li","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Quoc Viet","family":"Hung","sequence":"additional","affiliation":[{"name":"Griffith University, Gold coast, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanfeng","family":"Liu","sequence":"additional","affiliation":[{"name":"Macquarie University, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Zheng","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,9,14]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920891"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989363"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448955"},{"key":"e_1_2_1_4_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 Proceedings of the 30th International Conference on Very Large Data Bases. Morgan Kaufmann, 792--803."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, 491--502","author":"Chen Lei","year":"2005","unstructured":"Lei Chen, M. Tamer \u00d6zsu, and Vincent Oria. 2005. Robust and fast similarity search for moving object trajectories. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, 491--502. DOI:https:\/\/doi.org\/10.1145\/1066157.1066213"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 15th International Conference on Web Information Systems Engineering (WISE\u201914)","volume":"8786","author":"Chen Wei","year":"2014","unstructured":"Wei Chen, Lei Zhao, Jiajie Xu, Kai Zheng, and Xiaofang Zhou. 2014. Ranking based activity trajectory search. In Proceedings of the 15th International Conference on Web Information Systems Engineering (WISE\u201914), Lecture Notes in Computer Science, Vol. 8786. Springer, 170--185. DOI:https:\/\/doi.org\/10.1007\/978-3-319-11749-2_14"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 27th International Conference on Data Engineering (ICDE\u201911)","author":"Chen Zaiben","year":"2011","unstructured":"Zaiben Chen, Heng Tao Shen, and Xiaofang Zhou. 2011. Discovering popular routes from trajectories. In Proceedings of the 27th International Conference on Data Engineering (ICDE\u201911). IEEE Computer Society, 900--911. DOI:https:\/\/doi.org\/10.1109\/ICDE.2011.5767890"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807197"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687666"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183748"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497474"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 18th International Conference on Web Information Systems Engineering (WISE\u201917)","volume":"10569","author":"Guo Kaiyang","year":"2017","unstructured":"Kaiyang Guo, Rong-Hua Li, Shaojie Qiao, Zhenjun Li, Weipeng Zhang, and Minhua Lu. 2017. Efficient order-sensitive activity trajectory search. In Proceedings of the 18th International Conference on Web Information Systems Engineering (WISE\u201917) Lecture Notes in Computer Science, Vol. 10569. Springer, 391--405. DOI:https:\/\/doi.org\/10.1007\/978-3-319-68783-4_27"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.149"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442968.2442971"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 10th ACM International Conference on Web Search and Data Mining (WSDM\u201917)","author":"Liu Huiwen","year":"2017","unstructured":"Huiwen Liu, Jiajie Xu, Kai Zheng, Chengfei Liu, Lan Du, and Xian Wu. 2017. Semantic-aware query processing for activity trajectories. In Proceedings of the 10th ACM International Conference on Web Search and Data Mining (WSDM\u201917). ACM, 283--292. DOI:https:\/\/doi.org\/10.1145\/3018661.3018678"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2637898"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 20th Australasian Document Computing Symposium (ADCS\u201915)","author":"Mackenzie Joel","unstructured":"Joel Mackenzie, Farhana Murtaza Choudhury, and J. Shane Culpepper. 2015. Efficient location-aware web search. In Proceedings of the 20th Australasian Document Computing Symposium (ADCS\u201915). 4:1--4:8. DOI:https:\/\/doi.org\/10.1145\/2838931.2838933"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0429-2"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1921071.1921076"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2685504"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0331-0"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0038-6"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453953"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 18th International Conference on Data Engineering, Rakesh Agrawal and Klaus R. Dittrich (Eds.). IEEE Computer Society, 673--684","author":"Vlachos Michail","year":"2002","unstructured":"Michail Vlachos, Dimitrios Gunopulos, and George Kollios. 2002. Discovering similar multidimensional trajectories. In Proceedings of the 18th International Conference on Data Engineering, Rakesh Agrawal and Klaus R. Dittrich (Eds.). IEEE Computer Society, 673--684. DOI:https:\/\/doi.org\/10.1109\/ICDE.2002.994784"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 33rd IEEE International Conference on Data Engineering (ICDE\u201917)","author":"Wang Sheng","year":"2017","unstructured":"Sheng Wang, Zhifeng Bao, J. Shane Culpepper, Timos Sellis, Mark Sanderson, and Xiaolin Qin. 2017. Answering Top-k exemplar trajectory queries. In Proceedings of the 33rd IEEE International Conference on Data Engineering (ICDE\u201917). IEEE Computer Society, 597--608. DOI:https:\/\/doi.org\/10.1109\/ICDE.2017.114"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2690421"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 14th International Conference on Data Engineering. IEEE Computer Society, 201--208","author":"Yi Byoung-Kee","year":"1998","unstructured":"Byoung-Kee Yi, H. V. Jagadish, and Christos Faloutsos. 1998. Efficient retrieval of similar time sequences under time warping. In Proceedings of the 14th International Conference on Data Engineering. IEEE Computer Society, 201--208. DOI:https:\/\/doi.org\/10.1109\/ICDE.1998.655778"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2703848"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 31st IEEE International Conference on Data Engineering (ICDE\u201915)","author":"Zheng Bolong","year":"2015","unstructured":"Bolong Zheng, Nicholas Jing Yuan, Kai Zheng, Xing Xie, Shazia Wasim Sadiq, and Xiaofang Zhou. 2015. Approximate keyword search in semantic trajectory database. In Proceedings of the 31st IEEE International Conference on Data Engineering (ICDE\u201915). IEEE Computer Society, 975--986. DOI:https:\/\/doi.org\/10.1109\/ICDE.2015.7113349"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544828"}],"container-title":["ACM\/IMS Transactions on Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3379561","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3379561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T13:57:54Z","timestamp":1776347874000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3379561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,31]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,8,31]]}},"alternative-id":["10.1145\/3379561"],"URL":"https:\/\/doi.org\/10.1145\/3379561","relation":{},"ISSN":["2691-1922"],"issn-type":[{"value":"2691-1922","type":"print"}],"subject":[],"published":{"date-parts":[[2020,8,31]]},"assertion":[{"value":"2019-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-09-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}