{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:36Z","timestamp":1750306356163,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":30,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1145\/2938503.2938551","type":"proceedings-article","created":{"date-parts":[[2016,9,12]],"date-time":"2016-09-12T13:33:45Z","timestamp":1473687225000},"page":"105-114","source":"Crossref","is-referenced-by-count":1,"title":["Mintra"],"prefix":"10.1145","author":[{"given":"Anuj S.","family":"Saxena","sequence":"first","affiliation":[{"name":"National Defence Academy, Khadakwasla, Pune, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vikram","family":"Goyal","sequence":"additional","affiliation":[{"name":"Indraprastha Institute of Information Technology-Delhi, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debajyoti","family":"Bera","sequence":"additional","affiliation":[{"name":"Indraprastha Institute of Information Technology-Delhi, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/2938503.2938551-1","doi-asserted-by":"crossref","unstructured":"R. Agrawal and R. Srikant. Mining sequential patterns. In Proceedings of the Eleventh Int. Conf. on Data Engineering, 1995, pages 3--14.","DOI":"10.1109\/ICDE.1995.380415"},{"key":"key-10.1145\/2938503.2938551-2","doi-asserted-by":"crossref","unstructured":"C. F. Ahmed, S. K. Tanbeer, B.-S. Jeong, and Y.-K. Lee. Efficient tree structures for high utility pattern mining in incremental databases. T, 21(12):1708--1721, 2009.","DOI":"10.1109\/TKDE.2009.46"},{"key":"key-10.1145\/2938503.2938551-3","doi-asserted-by":"crossref","unstructured":"H. Ahonen-Myka. Discovery of frequent word sequences in text. In Pattern Detection and Discovery, pages 180--189. Springer, 2002.","DOI":"10.1007\/3-540-45728-3_14"},{"key":"key-10.1145\/2938503.2938551-4","doi-asserted-by":"crossref","unstructured":"K. k. Arya, G. Vikram, and S. Navathe Shamkant B., and Prasad. Mining frequent spatial-textual sequence patterns. In DASFAA, pages 123--138, 2015.","DOI":"10.1007\/978-3-319-18123-3_8"},{"key":"key-10.1145\/2938503.2938551-5","doi-asserted-by":"crossref","unstructured":"J. Ayres, J. Flannick, J. Gehrke, and T. Yiu. Sequential pattern mining using a bitmap representation. KDD '02, pages 429--435.","DOI":"10.1145\/775047.775109"},{"key":"key-10.1145\/2938503.2938551-6","unstructured":"H. Cao, N. Mamoulis, and D. W. Cheung. Mining frequent spatio-temporal sequential patterns. In Fifth IEEE International Conference on Data Mining, pages 8--pp, 2005."},{"key":"key-10.1145\/2938503.2938551-7","doi-asserted-by":"crossref","unstructured":"R. Chen, B. C. M. Fung, and B. C. Desai. Differentially private trajectory data publication. CoRR, 2011.","DOI":"10.1145\/2339530.2339564"},{"key":"key-10.1145\/2938503.2938551-8","doi-asserted-by":"crossref","unstructured":"F.-L. Chung, T.-C. Fu, V. Ng, and R. W. Luk. An evolutionary approach to pattern-based time series segmentation. Evolutionary Computation, IEEE Transactions on, 8(5):471--489, 2004.","DOI":"10.1109\/TEVC.2004.832863"},{"key":"key-10.1145\/2938503.2938551-9","doi-asserted-by":"crossref","unstructured":"C. Dwork. Differential privacy. In ICALP 2006, volume 4052 of LNCS, pages 1--12. Springer Verlag.","DOI":"10.1007\/11787006_1"},{"key":"key-10.1145\/2938503.2938551-10","doi-asserted-by":"crossref","unstructured":"F. Giannotti, M. Nanni, F. Pinelli, and D. Pedreschi. Trajectory pattern mining. In ACM SIGKDD, pages 330--339, 2007.","DOI":"10.1145\/1281192.1281230"},{"key":"key-10.1145\/2938503.2938551-11","doi-asserted-by":"crossref","unstructured":"N. Gupta, N. Mangal, K. Tiwari, and P. Mitra. Mining quantitative association rules in protein sequences. In Data Mining, pages 273--281. Springer, 2006.","DOI":"10.1007\/11677437_21"},{"key":"key-10.1145\/2938503.2938551-12","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M.-C. Hsu. Freespan: frequent pattern-projected sequential pattern mining. In Proceedings of the sixth ACM SIGKDD, pages 355--359, 2000.","DOI":"10.1145\/347090.347167"},{"key":"key-10.1145\/2938503.2938551-13","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In ACM SIGMOD Record, volume 29, pages 1--12, 2000.","DOI":"10.1145\/335191.335372"},{"key":"key-10.1145\/2938503.2938551-14","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data mining and knowledge discovery, 8(1):53--87, 2004.","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"key-10.1145\/2938503.2938551-15","doi-asserted-by":"crossref","unstructured":"S.-S. Ho and S. Ruan. Differential privacy for location pattern mining. In ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS, SPRINGL '11, pages 17--24. ACM, 2011.","DOI":"10.1145\/2071880.2071884"},{"key":"key-10.1145\/2938503.2938551-16","doi-asserted-by":"crossref","unstructured":"K. Koperski and J. Han. Discovery of spatial association rules in geographic information databases. In Advances in spatial databases'95.","DOI":"10.1007\/3-540-60159-7_4"},{"key":"key-10.1145\/2938503.2938551-17","doi-asserted-by":"crossref","unstructured":"H.-F. Li, S.-Y. Lee, and M.-K. Shan. On mining webclick streams for path traversal patterns. In Proceedings of the 13th international WWW conference on Alternate track papers & posters. ACM, 2004.","DOI":"10.1145\/1013367.1013497"},{"key":"key-10.1145\/2938503.2938551-18","doi-asserted-by":"crossref","unstructured":"A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam. L-diversity: Privacy beyond k-anonymity. TKDD'07, 2007.","DOI":"10.1145\/1217299.1217302"},{"key":"key-10.1145\/2938503.2938551-19","doi-asserted-by":"crossref","unstructured":"E. Masciari, G. Shi, and C. Zaniolo. Sequential pattern mining from trajectory data. In Proceedings of the 17th International Database Engineering & Applications Symposium, pages 162--167. ACM, 2013.","DOI":"10.1145\/2513591.2513653"},{"key":"key-10.1145\/2938503.2938551-20","doi-asserted-by":"crossref","unstructured":"M. E. Nergiz, M. Atzori, and Y. Saygin. Towards trajectory anonymization: a generalization-based approach. In Proceedings of the SIGSPATIAL ACM GIS 2008, pages 52--61.","DOI":"10.1145\/1503402.1503413"},{"key":"key-10.1145\/2938503.2938551-21","unstructured":"Panisson. Python Library for mobility trace simulation. https:\/\/github.com\/panisson\/pymobility, 2011-12."},{"key":"key-10.1145\/2938503.2938551-22","unstructured":"J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In icccn, page 0215. IEEE, 2001."},{"key":"key-10.1145\/2938503.2938551-23","doi-asserted-by":"crossref","unstructured":"A. S. Saxena, V. Goyal, and D. Bera. Efficient enforcement of privacy for moving object trajectories. In ICISS'13, pages 360--374.","DOI":"10.1007\/978-3-642-45204-8_27"},{"key":"key-10.1145\/2938503.2938551-24","doi-asserted-by":"crossref","unstructured":"A. S. Saxena, M. Pundir, V. Goyal, and D. Bera. Preserving location privacy for continuous queries on known route. In ICISS, 2011.","DOI":"10.1007\/978-3-642-25560-1_18"},{"key":"key-10.1145\/2938503.2938551-25","doi-asserted-by":"crossref","unstructured":"R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. Springer, 1996.","DOI":"10.1007\/BFb0014140"},{"key":"key-10.1145\/2938503.2938551-26","doi-asserted-by":"crossref","unstructured":"V. S. Tseng, C.-W. Wu, B.-E. Shie, and P. S. Yu. Up-growth: an efficient algorithm for high utility itemset mining. In SIGKDD, 2010.","DOI":"10.1145\/1835804.1835839"},{"key":"key-10.1145\/2938503.2938551-27","doi-asserted-by":"crossref","unstructured":"I. Tsoukatos and D. Gunopulos. Efficient mining of spatiotemporal patterns. Springer, 2001.","DOI":"10.1007\/3-540-47724-1_22"},{"key":"key-10.1145\/2938503.2938551-28","unstructured":"D. Yang, D. Zhang, V. W. Zheng, and Z. Yu. Modeling user activity preference by leveraging user spatial temporal characteristics in lbsns. IEEE Trans. on Systems, Man, and Cybernetics, 2015."},{"key":"key-10.1145\/2938503.2938551-29","doi-asserted-by":"crossref","unstructured":"J. Yin, Z. Zheng, and L. Cao. Uspan: an efficient algorithm for mining high utility sequential patterns. In ACM SIGKDD, 2012.","DOI":"10.1145\/2339530.2339636"},{"key":"key-10.1145\/2938503.2938551-30","doi-asserted-by":"crossref","unstructured":"M. J. Zaki. Spade: An efficient algorithm for mining frequent sequences. Machine learning, 42(1-2):31--60, 2001.","DOI":"10.1023\/A:1007652502315"}],"event":{"number":"20","sponsor":["Keio University"],"acronym":"IDEAS '16","name":"the 20th International Database Engineering & Applications Symposium","start":{"date-parts":[[2016,7,11]]},"location":"Montreal, QC, Canada","end":{"date-parts":[[2016,7,13]]}},"container-title":["Proceedings of the 20th International Database Engineering & Applications Symposium on - IDEAS '16"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2938503.2938551","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2938551&ftid=1786983&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:04Z","timestamp":1750222564000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2938503.2938551"}},"subtitle":["Mining anonymized trajectories with annotations"],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1145\/2938503.2938551","relation":{},"subject":[],"published":{"date-parts":[[2016]]}}}