{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:10:10Z","timestamp":1746295810076,"version":"3.40.4"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319084060"},{"type":"electronic","value":"9783319084077"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08407-7_4","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T10:25:59Z","timestamp":1404555959000},"page":"51-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Trajectory Data Pattern Mining"],"prefix":"10.1007","author":[{"given":"Elio","family":"Masciari","sequence":"first","affiliation":[]},{"given":"Gao","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Carlo","family":"Zaniolo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,6]]},"reference":[{"key":"4_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB (1994)"},{"key":"4_CR2","unstructured":"Cheung, W., Zaiane, O.R.: Incremental mining of frequent patterns without candidate generation or support. In: DEAS (2003)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Cheung, W., Za\u00efane, O.R.: Incremental mining of frequent patterns without candidate generation or support constraint. In: IDEAS, pp. 111\u2013116 (2003)","DOI":"10.1109\/IDEAS.2003.1214917"},{"key":"4_CR4","unstructured":"Leung, C., et al.: Cantree: A tree structure for efficient incremental mining of frequent patterns. In: ICDM (2005)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Park, J.S., et al.: An effective hash-based algorithm for mining association rules. In: SIGMOD (1995)","DOI":"10.1145\/223784.223813"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Brin, S., et al.: Dynamic itemset counting and implication rules for market basket data. In: SIGMOD (1997)","DOI":"10.1145\/253260.253325"},{"key":"4_CR7","unstructured":"Chi, Y., et al.: Moment: Maintaining closed frequent itemsets over a stream sliding window (2004)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/11871637_17","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"J Fischer","year":"2006","unstructured":"Fischer, J., Heun, V., Kramer, S.: Optimal string mining under frequency constraints. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 139\u2013150. Springer, Heidelberg (2006)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Giannotti, F., Nanni, M., Pinelli, F., Pedreschi, D.: Trajectory pattern mining. In: KDD, pp. 330\u2013339 (2007)","DOI":"10.1145\/1281192.1281230"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Gonzalez, H., Han, J., Li, X., Klabjan, D.: Warehousing and analyzing massive RFID data sets. In: ICDE, p. 83 (2006)","DOI":"10.1109\/ICDE.2006.171"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Hai, P.N., Poncelet, P., Teisseire, M.: GeT_Move: an efficient and unifying spatio-temporal pattern mining algorithm for moving objects. In: Hollm\u00e9n, J., Klawonn, F., Tucker, A. (eds.) IDA 2012. LNCS, vol. 7619, pp. 276\u2013288. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-34156-4_26"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD (2000)","DOI":"10.1145\/342009.335372"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-85920-8_18","volume-title":"Progress in Pattern Recognition, Image Analysis and Applications","author":"R Hern\u00e1ndez-Le\u00f3n","year":"2008","unstructured":"Hern\u00e1ndez-Le\u00f3n, R., Hern\u00e1ndez-Palancar, J., Carrasco-Ochoa, J.A., Mart\u00ednez-Trinidad, J.F.: A novel incremental algorithm for frequent itemsets mining in dynamic datasets. In: Ruiz-Shulcloper, J., Kropatsch, W.G. (eds.) CIARP 2008. LNCS, vol. 5197, pp. 145\u2013152. Springer, Heidelberg (2008)"},{"issue":"1","key":"4_CR14","first-page":"1068","volume":"1","author":"H Jeung","year":"2008","unstructured":"Jeung, H., Yiu, M.L., Zhou, X., Jensen, C.S., Shen, H.T.: Discovery of convoys in trajectory databases. PVLDB 1(1), 1068\u20131080 (2008)","journal-title":"PVLDB"},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/1121995.1121998","volume":"35","author":"N Jiang","year":"2006","unstructured":"Jiang, N., Gruenwald, L.: Research issues in data stream association rule mining. SIGMOD Rec. 35(1), 14\u201319 (2006)","journal-title":"SIGMOD Rec."},{"key":"4_CR16","unstructured":"Jolliffe, I.T.: Principal Component Analysis. Springer Series in Statistics (2002)"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s10618-008-0110-5","volume":"17","author":"A K\u00fcgel","year":"2008","unstructured":"K\u00fcgel, A., Ohlebusch, E.: A space efficient solution to the frequent string mining problem for many databases. Data Min. Knowl. Discov. 17(1), 24\u201338 (2008)","journal-title":"Data Min. Knowl. Discov."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Lee, C., Lin, C., Chen, M.: Sliding window filtering: an efficient method for incremental mining on a time-variant database (2005)","DOI":"10.1016\/j.is.2004.02.001"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Lee, C.-H., Chung, C.-W.: Efficient storage scheme and query processing for supply chain management using RFID. In: SIGMOD08, pp. 291\u2013302 (2008)","DOI":"10.1145\/1376616.1376648"},{"issue":"1","key":"4_CR20","first-page":"1081","volume":"1","author":"J-G Lee","year":"2008","unstructured":"Lee, J.-G., Han, J., Li, X., Gonzalez, H.: TraClass: trajectory classification using hierarchical region-based and trajectory-based clustering. PVLDB 1(1), 1081\u20131094 (2008)","journal-title":"PVLDB"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Lee, J.-G., Han, J., Whang, K.-Y.: Trajectory clustering: a partition-and-group framework. In: SIGMOD07, pp. 593\u2013604 (2007)","DOI":"10.1145\/1247480.1247546"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Lee, J.-G., Han, J., Li, X.: Trajectory outlier detection: A partition-and-detect framework. In: ICDE, pp. 140\u2013149 (2008)","DOI":"10.1109\/ICDE.2008.4497422"},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10115-006-0032-8","volume":"11","author":"CK Leung","year":"2007","unstructured":"Leung, C.K., Khan, Q.I., Li, Z., Hoque, T.: Cantree: a canonical-order tree for incremental frequent-pattern mining. Knowl. Inf. Syst. 11(3), 287\u2013311 (2007)","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"4_CR24","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/1058150.1058158","volume":"34","author":"J Li","year":"2005","unstructured":"Li, J., Maier, D., Tufte, K., Papadimos, V., Tucker, P.A.: No pane, no gain: efficient evaluation of sliding-window aggregates over data streams. SIGMOD Rec. 34(1), 39\u201344 (2005)","journal-title":"SIGMOD Rec."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Li, Y., Han, J., Yang, J.: Clustering moving objects. In: KDD, pp. 617\u2013622 (2004)","DOI":"10.1145\/1014052.1014129"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Liu, Y., Chen, L., Pei, J., Chen, Q., Zhao, Y.: Mining frequent trajectory patterns for activity monitoring using radio frequency tag arrays. In: PerCom, pp. 37\u201346 (2007)","DOI":"10.1109\/PERCOM.2007.23"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-642-04957-6_31","volume-title":"Flexible Query Answering Systems","author":"E Masciari","year":"2009","unstructured":"Masciari, E.: Trajectory clustering via effective partitioning. In: Andreasen, T., Yager, R.R., Bulskov, H., Christiansen, H., Larsen, H.L. (eds.) FQAS 2009. LNCS, vol. 5822, pp. 358\u2013370. Springer, Heidelberg (2009)"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Masciari, E.: Warehousing and querying trajectory data streams with error estimation. In: DOLAP, pp. 113\u2013120 (2012)","DOI":"10.1145\/2390045.2390064"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Mozafari, B., Thakkar, H., Zaniolo, C.: Verifying and mining frequent patterns from large windows over data streams. In: ICDE, pp. 179\u2013188 (2008)","DOI":"10.1109\/ICDE.2008.4497426"},{"key":"4_CR30","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: an efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (2000)"},{"key":"4_CR31","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Prefixspan: mining sequential patterns by prefix-projected growth. In: ICDE, pp. 215\u2013224 (2001)"},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/11687238_40","volume-title":"Advances in Database Technology - EDBT 2006","author":"J Yang","year":"2006","unstructured":"Yang, J., Hu, M.: TrajPattern: mining sequential patterns from imprecise trajectories of mobile objects. In: Ioannidis, Y., et al. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 664\u2013681. Springer, Heidelberg (2006)"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.: CHARM: an efficient algorithm for closed itemset mining. In: SDM (2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Li, Q., Chen, Y., Xie, X.: Understanding mobility based on gps data. In: UbiComp 2008, pp. 312\u2013321 (2008)","DOI":"10.1145\/1409635.1409677"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Mining Complex Patterns"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08407-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:48:06Z","timestamp":1746294486000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-08407-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084060","9783319084077"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08407-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"6 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}