{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T12:52:36Z","timestamp":1696942356007},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,5,1]],"date-time":"2014-05-01T00:00:00Z","timestamp":1398902400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10844-014-0311-x","type":"journal-article","created":{"date-parts":[[2014,4,30]],"date-time":"2014-04-30T00:27:00Z","timestamp":1398817620000},"page":"147-182","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Algorithms for spatial collocation pattern mining in a limited memory environment: a summary of results"],"prefix":"10.1007","volume":"43","author":[{"given":"Pawel","family":"Boinski","sequence":"first","affiliation":[]},{"given":"Maciej","family":"Zakrzewicz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,1]]},"reference":[{"key":"311_CR1","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). San Francisco: Morgan Kaufmann Publishers Inc."},{"issue":"2","key":"311_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A. (1993). Mining association rules between sets of items in large databases. SIGMOD Record, 22(2), 207\u2013216.","journal-title":"SIGMOD Record"},{"key":"311_CR3","unstructured":"Anselin, L. (1989). What is special about spatial data? Alternative perspectives on spatial data analysis (pp. 63\u201377). Santa Barbara."},{"key":"311_CR4","unstructured":"Chuang, K.T., & Chen, M.S. (2005). Frequent pattern discovery with memory constraint. In Proceedings of the 14th ACM international conference on information and knowledge management, CIKM \u201905 (pp. 345\u2013s346). New York: ACM."},{"issue":"2","key":"311_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/971697.602261","volume":"14","author":"DJ DeWitt","year":"1984","unstructured":"DeWitt, D.J., Katz, R.H., Olken, F., Shapiro, L.D., Stonebraker, M.R., Wood, D.A. (1984). Implementation techniques for main memory database systems. SIGMOD Record, 14(2), 1\u20138. doi: 10.1145\/971697.602261 .","journal-title":"SIGMOD Record"},{"key":"311_CR6","first-page":"37","volume":"17","author":"U Fayyad","year":"1996","unstructured":"Fayyad, U., Piatetsky-Shapiro, G., Smyth, P. (1996). From data mining to knowledge discovery in databases. AI Magazine, 17, 37\u201354.","journal-title":"AI Magazine"},{"key":"311_CR7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/3-540-57155-8_261","volume-title":", Algorithms and data structures, LNCS, Vol. 709","author":"T Graf","year":"1993","unstructured":"Graf, T., & Hinrichs, K. (1993). A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects In F, Dehne, JR, Sack, N, Santoro, S, Whitesides (Eds.), , Algorithms and data structures, LNCS (Vol. 709, pp. 349\u2013360). Heidelberg: Springer."},{"issue":"2","key":"311_CR8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/971697.602266","volume":"14","author":"A Guttman","year":"1984","unstructured":"Guttman, A. (1984). R-trees: a dynamic index structure for spatial searching. SIGMOD Record, 14(2), 47\u201357.","journal-title":"SIGMOD Record"},{"issue":"2","key":"311_CR9","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1145\/253262.253404","volume":"26","author":"J Han","year":"1997","unstructured":"Han, J., Koperski, K., Stefanovic, N. (1997). Geominer: a system prototype for spatial data mining. SIGMOD Record, 26(2), 553\u2013556. doi: 10.1145\/253262.253404 .","journal-title":"SIGMOD Record"},{"key":"311_CR10","unstructured":"Huang, Y., Xiong, H., Shekhar, S., Pei, J. (2003). Mining confident co-location rules without a support threshold. In Proceedings of the 2003 ACM symposium on applied computing, SAC \u201903 (pp. 497\u2013501). New York: ACM."},{"key":"311_CR11","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1109\/TKDE.2004.90","volume":"16","author":"Y Huang","year":"2004","unstructured":"Huang, Y., Shekhar, S., Xiong, H. (2004). Discovering co-location patterns from spatial datasets: a general approach. IEEE Transactions on Knowledge and Data Engineering, 16, 472\u2013485.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"311_CR12","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10707-006-9827-8","volume":"10","author":"Y Huang","year":"2006","unstructured":"Huang, Y., Pei, J., Xiong, H. (2006). Mining co-location patterns with rare events from spatial data sets. Geoinformatica, 10(3), 239\u2013260. doi: 10.1007\/s10707-006-9827-8 .","journal-title":"Geoinformatica"},{"issue":"1","key":"311_CR13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF03037022","volume":"1","author":"M Kitsuregawa","year":"1983","unstructured":"Kitsuregawa, M., Tanaka, H., Moto-Oka, T. (1983). Application of hash to data base machine and its architecture. New Generation Computer, 1(1), 63\u201374.","journal-title":"New Generation Computer"},{"key":"311_CR14","unstructured":"Koperski, K., & Han, J. (1995). Discovery of spatial association rules in geographic information databases. In Proceedings of the 4th international symposium on advances in spatial databases (pp. 47\u201366). London: Springer-Verlag."},{"key":"311_CR15","unstructured":"Koperski, K., Adhikary, J., Han, J. (1996). Spatial data mining: progress and challenges. In SIGMOD workshop on research issues on data mining and knowledge discovery (DMKD) (pp. 1\u201310)."},{"key":"311_CR16","unstructured":"Lin, Z., & Lim, S. (2009). Optimal candidate generation in spatial co-location mining. In Proceedings of the 2009 ACM symposium on applied computing, SAC \u201909 (pp. 1441\u20131445). New York: ACM."},{"key":"311_CR17","doi-asserted-by":"crossref","unstructured":"Miller, H.J., & Han, J. (2001). Geographic data mining and knowledge discovery. Bristol: Taylor & Francis, Inc.","DOI":"10.4324\/9780203468029"},{"key":"311_CR18","unstructured":"Morimoto, Y. (2001). Mining frequent neighboring class sets in spatial databases. In Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201901 (pp. 353\u2013358). New York: ACM."},{"key":"311_CR19","doi-asserted-by":"crossref","unstructured":"Munro, R., Chawla, S, Sun, P. (2003). Complex spatial relationships. In Proceedings of the 3rd IEEE international conference on data mining (ICDM).","DOI":"10.1109\/ICDM.2003.1250924"},{"issue":"5","key":"311_CR20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0306-4379(03)00035-8","volume":"29","author":"A Nanopoulos","year":"2004","unstructured":"Nanopoulos, A., & Manolopoulos, Y. (2004). Memory-adative association rules mining. Information Systems, 29(5), 365\u2013384.","journal-title":"Information Systems"},{"key":"311_CR21","unstructured":"Prodan, R., & Fahringer, T. (2007). Grid computing: experiment management, tool integration, and scientific workflows. Berlin, Heidelberg: Springer-Verlag."},{"issue":"1","key":"311_CR22","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/846170.846173","volume":"1","author":"JF Roddick","year":"1999","unstructured":"Roddick, J.F., & Spiliopoulou, M. (1999). A bibliography of temporal, spatial and spatio-temporal data mining research. SIGKDD Exploration Newsletter, 1(1), 34\u201338.","journal-title":"SIGKDD Exploration Newsletter"},{"key":"311_CR23","unstructured":"Shekhar, S., & Chawla, S. (2003). Spatial databases: a tour. Prentice Hall."},{"key":"311_CR24","unstructured":"Shekhar, S., & Huang, Y. (2001). Discovering spatial co-location patterns: a summary of results In C.S. Jensen, M. Schneider, B. Seeger, V.J. Tsotras (Eds.), , SSTD (Vol. 2121, pp. 236\u2013256). Heidelberg:LNCS Springer."},{"key":"311_CR25","unstructured":"Shekhar, S., & Huang, Y. (2002). The multi-resolution co-location miner: a new algorithm to find co-location patterns in spatial dataset. Technical Report 02-019, University of Minnesota."},{"key":"311_CR26","doi-asserted-by":"crossref","unstructured":"Verhein, F., & Al-Naymat, G. (2007). Fast mining of complex spatial co-location patterns using glimit.International Conference on Data Mining Workshops, 679\u2013684.","DOI":"10.1109\/ICDMW.2007.49"},{"key":"311_CR27","unstructured":"Wan, Y., Zhou, J., Bian, F. (2008). Codem: a novel spatial co-location and de-location patterns mining algorithm. In Proceedings of the 2008 5th international conference on fuzzy systems and knowledge discovery, FSKD \u201908 (Vol. 02, pp. 576\u2013580). Washington: IEEE Computer Society."},{"key":"311_CR28","unstructured":"Wang, L., Bao, Y., Lu, J., Yip, J. (2008). A new join-less approach for co-location pattern mining. In Q. Wu, X. He, Q.V. Nguyen, W. Jia, M.L. Huang (Eds.), CIT (pp. 197\u2013202). Sydney: IEEE."},{"issue":"2","key":"311_CR29","doi-asserted-by":"crossref","first-page":"69","DOI":"10.2174\/1874133900903020069","volume":"3","author":"L Wang","year":"2009a","unstructured":"Wang, L., Bao, Y., Lu, J. (2009a). Efficient discovery of spatial co-location patterns using the icpi-tree. The Open Information Systems Journal, 3(2), 69\u201380.","journal-title":"The Open Information Systems Journal"},{"issue":"19","key":"311_CR30","doi-asserted-by":"crossref","first-page":"3370","DOI":"10.1016\/j.ins.2009.05.023","volume":"179","author":"L Wang","year":"2009b","unstructured":"Wang, L., Zhou, L., Lu, J., Yip, J. (2009b). An order-clique-based approach for mining maximal co-locations. Information Sciences, 179(19), 3370\u20133382. doi: 10.1016\/j.ins.2009.05.023 .","journal-title":"Information Sciences"},{"key":"311_CR31","unstructured":"Webb, G.I. (2000). Efficient search for association rules. In Proceedings of the 6th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201900 (pp. 99\u2013107). New York: ACM."},{"issue":"3","key":"311_CR32","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/1010614.1010616","volume":"22","author":"X Wu","year":"2004","unstructured":"Wu, X., Zhang, C., Zhang, S. (2004). Efficient mining of both positive and negative association rules. ACM Transactions on Information Systems, 22(3), 381\u2013405. doi: 10.1145\/1.010614.1010616 .","journal-title":"ACM Transactions on Information Systems"},{"key":"311_CR33","unstructured":"Xiao, X., Xie, X., Luo, Q., Ma, W.Y. (2008). Density based co-location pattern discovery. In Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, GIS \u201908 (pp. 29:1\u201329:10). New York: ACM."},{"key":"311_CR34","doi-asserted-by":"crossref","unstructured":"Yoo, J.S., & Shekhar, S. (2004). A partial join approach for mining co-location patterns. In D. Pfoser, I.F. Cruz, M. Ronthaler (Eds.), GIS (pp. 241\u2013249). ACM.","DOI":"10.1145\/1032222.1032258"},{"key":"311_CR35","unstructured":"Yoo, J.S., Shekhar, S., Celik, M. (2005). A join-less approach for co-location pattern mining: a summary of results. In Proceedings of the IEEE international conference on data mining (pp. 813\u2013816). Washington: IEEE Computer Society."},{"key":"311_CR36","unstructured":"Zeitouni, K. (2000). A survey on spatial data mining methods databases and statistics. In Point of views, information resources management association international conference (IRMA 2000), data warehousing and mining track."},{"key":"311_CR37","unstructured":"Zhang, X., Mamoulis, N., Cheung, D.W., Shou, Y. (2004). Fast mining of spatial collocations. In Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201904 (pp. 384\u2013393). New York: ACM."}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-014-0311-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-014-0311-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-014-0311-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T00:37:08Z","timestamp":1565397428000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-014-0311-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["311"],"URL":"https:\/\/doi.org\/10.1007\/s10844-014-0311-x","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,1]]}}}