{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:54:57Z","timestamp":1742381697545},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,12,4]],"date-time":"2007-12-04T00:00:00Z","timestamp":1196726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s10707-007-0042-z","type":"journal-article","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T14:08:45Z","timestamp":1196690925000},"page":"27-55","source":"Crossref","is-referenced-by-count":36,"title":["Mining Long, Sharable Patterns in Trajectories of Moving Objects"],"prefix":"10.1007","volume":"13","author":[{"given":"Gy\u0151z\u0151","family":"Gid\u00f3falvi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torben Bach","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,4]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imilienski, and A. Swami. \u201cMining association rules between sets of items in large databases,\u201d in Proc. of SIGMOD, pp. 207\u2013216, 1993.","DOI":"10.1145\/170035.170072"},{"key":"42_CR2","unstructured":"R. Agrawal and R. Srikant. \u201cFast algorithms for mining association rules,\u201d in Proc. of VLDB, pp. 487\u2013499, 1994."},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"R. Agrawal and R. Srikant. \u201cMining sequential patterns,\u201d in Proc. of ICDE, pp. 3\u201314, 1995.","DOI":"10.1109\/ICDE.1995.380415"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"D. Burdick, M. Calimlim, and J. Gehrke. \u201cMAFIA: A maximal frequent itemset algorithm for transactional databases,\u201d in Proc. of ICDE, pp. 443\u2013452, 2001.","DOI":"10.1109\/ICDE.2001.914857"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"G. Gid\u00f3falvi and T.B. Pedersen. \u201cSpatio-temporal rule mining: Issues and techniques,\u201d in Proc. of DaWaK, pp. 275\u2013284, 2005.","DOI":"10.1007\/11546849_27"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"G. Gid\u00f3falvi and T.B.\u00a0Pedersen. \u201cST\u2013ACTS: A spatio-temporal activity simulator,\u201d in Proc. of ACM-GIS, pp. 155\u2013162, 2006.","DOI":"10.1145\/1183471.1183498"},{"key":"42_CR7","unstructured":"G. Gid\u00f3falvi and T.B.\u00a0Pedersen. \u201cCab\u2013sharing: An effective, door\u2013to\u2013door, on\u2013demand transportation service,\u201d in Proc. of ITS, 2007."},{"key":"42_CR8","unstructured":"B. Goethals. \u201cSurvey on frequent pattern mining,\u201d in http:\/\/citeseer.ist.psu.edu\/goethals03survey.html , 2003."},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"M.L Gosseling and S. Doherty. Integrated Land-Use and Transportation Models, Behavioural Foundations. Elsevier, 2005.","DOI":"10.1108\/9781786359520"},{"issue":"3","key":"42_CR10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10618-005-0002-x","volume":"11","author":"K. Gouda","year":"2005","unstructured":"K. Gouda and M.J. Zaki. \u201cGenMax: An efficient algorithm for mining maximal frequent itemsets,\u201d in Data Mining and Knowledge Discovery, Vol. 11(3):223\u2013242, 2005.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"42_CR11","unstructured":"C.S. Jensen, D. Pfoser, and Y. Theodoridis. \u201cNovel approaches to the indexing of moving object trajectories,\u201d in Proc. of VLDB, pp. 395\u2013406, 2000."},{"key":"42_CR12","unstructured":"C.S. Jensen, H. Lahrmann, S. Pakalnis, and S. Runge. \u201cThe INFATI data.\u201d Time Center TR\u201379,\u201d in www.cs.aau.dk\/TimeCenter , 2004."},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"N. Mamoulis, H. Cao, G. Kollios, M. Hadjieleftheriou, Y. Tao, and D. W. Cheung. \u201cMining, indexing, and querying historical spatiotemporal data,\u201d in Proc. of KDD, pp. 236\u2013245, 2004.","DOI":"10.1145\/1014052.1014080"},{"key":"42_CR14","unstructured":"J. Pei, J. Han, and R. Mao. \u201cCLOSET: An efficient algorithm for mining frequent closed itemsets,\u201d in Proc. of DMKD, pp. 11\u201320, 2000."},{"issue":"3","key":"42_CR15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10291-003-0069-z","volume":"7","author":"M. Quddus","year":"2003","unstructured":"M. Quddus, W. Ochieng, L. Zhao, and R. Noland. \u201cA general map matching algorithm for transport telematics applications,\u201d in GPS Solutions Journal, Vol. 7(3):157\u2013167, 2003.","journal-title":"GPS Solutions Journal"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"X. Shang, K.-U. Sattler, and I. Geist. \u201cEfficient frequent pattern mining in relational databases\u201d in Proc. of LWA, pp. 84\u201391, 2004.","DOI":"10.1145\/1066677.1066928"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"I. Tsoukatos and D. Gunopulos. \u201cEfficient mining of spatiotemporal patterns,\u201d in Proc. of SSTD, pp. 425\u2013442, 2001.","DOI":"10.1007\/3-540-47724-1_22"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"M. Vlachos, D. Gunopoulos, and G. Kollios. \u201cDiscovering similar multidimensional trajectories,\u201d in Proc. of ICDE, pp. 673\u2013685, 2002.","DOI":"10.1109\/ICDE.2002.994784"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"J. Wang, J. Han, and J. Pei. \u201cCLOSET+: Searching for the best strategies for mining frequent closed itemsets,\u201d in Proc. of KDD, pp. 236\u2013245, 2003.","DOI":"10.1145\/956750.956779"},{"key":"42_CR20","unstructured":"D. Xin, J. Han, X. Yan, and H. Cheng. \u201cMining compressed frequent-pattern sets,\u201d in Proc. of VLDB, pp. 709\u2013720, 2005."},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"X. Yan, J. Han, and R. Afshar. \u201cCloSpan: Mining closed sequential patterns in large datasets.\u201d in Proc. of SDM, pp. 166\u2013177, 2003.","DOI":"10.1137\/1.9781611972733.15"},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"M.J. Zaki and C.J. Hsiao. \u201cCHARM: an efficient algorithm for closed itemset mining,\u201d in Proc. of SDM, pp. 71\u201380, 2002.","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-007-0042-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-007-0042-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-007-0042-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T03:04:21Z","timestamp":1684119861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-007-0042-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,4]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1007\/s10707-007-0042-z","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,4]]}}}