{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:48:57Z","timestamp":1781106537679,"version":"3.54.1"},"reference-count":20,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10,1]]},"abstract":"<p>This paper proposes a new approach to trajectory pattern mining, which attempts to discover frequent movement patterns from the trajectories of moving objects. For dealing with a large volume of trajectory data, traditional approaches quantize them by a grid with a fixed resolution. However, an appropriate resolution often varies across different areas of trajectories. Simply increasing the resolution cannot capture broad patterns and consumes unnecessarily large computational resources. To solve the problem, the authors propose a hierarchical grid-based approach with quadtree search. The approach initially searches for frequent patterns with a coarse grid and drills down into a finer grid level to discover more minute patterns. The algorithm is naturally parallelized and implemented in the MapReduce programming model to accelerate the computation. The authors\u2019 evaluative experiments on real-word data show the effectiveness of the authors\u2019 approach in mining complex patterns with lower computational cost than the previous work.<\/p>","DOI":"10.4018\/ijghpc.2013100106","type":"journal-article","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T11:43:40Z","timestamp":1394192620000},"page":"79-96","source":"Crossref","is-referenced-by-count":9,"title":["Parallel Distributed Trajectory Pattern Mining Using Hierarchical Grid with MapReduce"],"prefix":"10.4018","volume":"5","author":[{"given":"Kazuhiro","family":"Seki","sequence":"first","affiliation":[{"name":"Kobe University, Kobe, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryota","family":"Jinno","sequence":"additional","affiliation":[{"name":"Kobe University, Kobe, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kuniaki","family":"Uehara","sequence":"additional","affiliation":[{"name":"Kobe University, Kobe, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijghpc.2013100106-0","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998). Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of the 1998 ACM Sigmod International Conference on Management of Data (pp. 94\u2013105).","DOI":"10.1145\/276305.276314"},{"key":"ijghpc.2013100106-1","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases (pp. 487\u2013499)."},{"key":"ijghpc.2013100106-2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tourman.2006.05.010"},{"key":"ijghpc.2013100106-3","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2007.10.003"},{"issue":"1","key":"ijghpc.2013100106-4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm.","volume":"39","author":"A. P.Dempster","year":"1977","journal-title":"Journal of the Royal Statistical Society. Series B. Methodological"},{"key":"ijghpc.2013100106-5","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (pp. 226\u2013231)."},{"key":"ijghpc.2013100106-6","doi-asserted-by":"crossref","unstructured":"Giannotti, F., Nanni, M., Pinelli, F., & Pedreschi, D. (2007). Trajectory pattern mining. In Proceedings of the 13th ACM Sigkdd International Conference on Knowledge Discovery and Data Mining (pp. 330\u2013339).","DOI":"10.1145\/1281192.1281230"},{"key":"ijghpc.2013100106-7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015812206586"},{"key":"ijghpc.2013100106-8","unstructured":"Institution for Transport Policy Studies (Ed.). (2000). Annual report of city planning. National legislative document publisher."},{"key":"ijghpc.2013100106-9","doi-asserted-by":"crossref","unstructured":"Jeung, H., Shen, H. T., & Zhou, X. (2007). Mining trajectory patterns using hidden Markov models. In Proceedings of the 9th International Conference on Data Warehousing and Knowledge Discovery (pp. 470\u2013480).","DOI":"10.1007\/978-3-540-74553-2_44"},{"key":"ijghpc.2013100106-10","doi-asserted-by":"crossref","unstructured":"Lee, J.-G., Han, J., & Whang, K.-Y. (2007). Trajectory clustering: a partition-and-group framework. In Proceedings of the 2007 ACM Sigmod International Conference on Management of Data (pp. 593\u2013604).","DOI":"10.1145\/1247480.1247546"},{"key":"ijghpc.2013100106-11","doi-asserted-by":"publisher","DOI":"10.2200\/S00274ED1V01Y201006HLT007"},{"key":"ijghpc.2013100106-12","doi-asserted-by":"publisher","DOI":"10.1080\/13658816.2012.682578"},{"key":"ijghpc.2013100106-13","first-page":"283","article-title":"Surgical workflow monitoring based on trajectory data mining.","volume":"2010","author":"A.Nara","year":"2010","journal-title":"Proceedings of JSAI-ISAI Workshops"},{"key":"ijghpc.2013100106-14","doi-asserted-by":"crossref","unstructured":"Orenstein, J. A. (1986). Spatial query processing in an object-oriented database system. In Proceedings of the 1986 ACM Sigmod International Conference on Management of Data (pp. 326\u2013336).","DOI":"10.1145\/16856.16886"},{"key":"ijghpc.2013100106-15","doi-asserted-by":"crossref","unstructured":"Palma, A. T., Bogorny, V., Kuijpers, B., & Alvares, L. O. (2008). A clustering-based approach for discovering interesting places in trajectories. In Proceedings of the 2008 ACM Symposium on Applied Computing (pp. 863\u2013868).","DOI":"10.1145\/1363686.1363886"},{"key":"ijghpc.2013100106-16","doi-asserted-by":"crossref","unstructured":"Verhein, F. (2009). Mining complex spatio-temporal sequence patterns. In Proceedings of the 9th Siam International Conference on Data Mining (pp. 605\u2013616).","DOI":"10.1137\/1.9781611972795.52"},{"key":"ijghpc.2013100106-17","doi-asserted-by":"crossref","unstructured":"Verhein, F., & Chawla, S. (2006). Mining spatio-temporal association rules, sources, sinks, stationary regions and thoroughfares in object mobility databases. In Proceedings of the 11th International Conference on Database Systems for Advanced Applications (pp. 187\u2013201).","DOI":"10.1007\/11733836_15"},{"key":"ijghpc.2013100106-18","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-007-0079-5"},{"key":"ijghpc.2013100106-19","unstructured":"Wang, W., Yang, J., & Muntz, R. R. (1997). STING: A statistical information grid approach to spatial data mining. In Proceedings of the 23rd International Conference on Very Large Data Bases (pp. 186\u2013195)."}],"container-title":["International Journal of Grid and High Performance Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=102758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T17:44:05Z","timestamp":1716572645000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijghpc.2013100106"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2013,10,1]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,10]]}},"URL":"https:\/\/doi.org\/10.4018\/ijghpc.2013100106","relation":{},"ISSN":["1938-0259","1938-0267"],"issn-type":[{"value":"1938-0259","type":"print"},{"value":"1938-0267","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,1]]}}}