A framework of spatial co-location pattern mining for ubiquitous GIS

A spatial co-location pattern represents relationships between spatial features that are frequently located in close proximity to one another. Such a pattern is one of the most important concepts for geographic context awareness of ubiquitous Geographic Information System (GIS). We constructed a framework for co-location pattern mining using the transaction-based approach, which employs maximal cliques as a transaction-type dataset; we first define transaction-type data and verify that the definition satisfies the requirements, and we also propose an efficient way to generate all transaction-type data. The constructed framework can play a role as a theoretical methodology of co-location pattern mining, which supports geographic context awareness of ubiquitous GIS.

[1]  J. V. Du Toit,et al.  Generalized Additive Models from a Neural Network Perspective , 2007 .

[2]  Yen-Liang Chen,et al.  Mining fuzzy association rules from uncertain data , 2010, Knowledge and Information Systems.

[3]  Feng Qian,et al.  Mining spatio-temporal co-location patterns with weighted sliding window , 2009, 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems.

[4]  Jaideep Srivastava,et al.  Selecting the right interestingness measure for association patterns , 2002, KDD.

[5]  R. Dubin,et al.  Spatial Autocorrelation: A Primer , 1998 .

[6]  Alicia Troncoso Lora,et al.  Mining quantitative association rules based on evolutionary computation and its application to atmospheric pollution , 2010, Integr. Comput. Aided Eng..

[7]  Yasuhiko Morimoto,et al.  Mining frequent neighboring class sets in spatial databases , 2001, KDD '01.

[8]  Chris Speed,et al.  Proceedings of the 2011 international workshop on Networking and object memories for the internet of things , 2011, UbiComp 2011.

[9]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[10]  Fahim Kawsar,et al.  Spatial co-location for device association: the connected object way , 2011, NoME-IoT '11.

[11]  Xing Xie,et al.  Density based co-location pattern discovery , 2008, GIS '08.

[12]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[13]  Shashi Shekhar,et al.  A Joinless Approach for Mining Spatial Colocation Patterns , 2006, IEEE Transactions on Knowledge and Data Engineering.

[14]  Akira Tanaka,et al.  The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..

[15]  S. Shekhar,et al.  A Join-less Approach for Mining Spatial Co-location Patterns , 2006 .

[16]  Thomas M. Cover,et al.  Elements of Information Theory: Cover/Elements of Information Theory, Second Edition , 2005 .

[17]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[18]  Shashi Shekhar,et al.  Spatial Databases: A Tour , 2003 .

[19]  Hui Xiong,et al.  Discovering colocation patterns from spatial data sets: a general approach , 2004, IEEE Transactions on Knowledge and Data Engineering.

[20]  Federica Cena,et al.  The Role of Ontologies in Context-Aware Recommender Systems , 2006, 7th International Conference on Mobile Data Management (MDM'06).

[21]  M. Celtic,et al.  Discovering partial spatio-temporal co-occurrence patterns , 2011, Proceedings 2011 IEEE International Conference on Spatial Data Mining and Geographical Knowledge Services.

[22]  Shashi Shekhar,et al.  A partial join approach for mining co-location patterns , 2004, GIS '04.

[23]  Michael Beigl,et al.  Using Spatial Co-location for Coordination in Ubiquitous Computing Environments , 1999, HUC.

[24]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[25]  S. Shekhar,et al.  Discovering Co-location Patterns from Spatial Datasets : A General Approach , 2004 .

[26]  Rafael Capilla,et al.  Context-aware architectures for building service-oriented systems , 2006, Conference on Software Maintenance and Reengineering (CSMR'06).

[27]  W. Tobler A Computer Movie Simulating Urban Growth in the Detroit Region , 1970 .

[28]  Younghee Kim,et al.  Maximal Cliques Generating Algorithm for Spatial Co-location Pattern Mining , 2011, STA.

[29]  Daniel T. Larose,et al.  Discovering Knowledge in Data: An Introduction to Data Mining , 2005 .

[30]  Hui Xiong,et al.  A Framework for Discovering Co-Location Patterns in Data Sets with Extended Spatial Objects , 2004, SDM.

[31]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[32]  Jin Soung Yoo,et al.  Mining top-k closed co-location patterns , 2011, Proceedings 2011 IEEE International Conference on Spatial Data Mining and Geographical Knowledge Services.

[33]  Chenghu Zhou,et al.  QuCOM: K nearest features neighborhood based qualitative spatial co-location patterns mining algorithm , 2011, Proceedings 2011 IEEE International Conference on Spatial Data Mining and Geographical Knowledge Services.

[34]  Ghazi Al-Naymat,et al.  Enumeration of maximal clique for mining spatial co-location patterns , 2008, 2008 IEEE/ACS International Conference on Computer Systems and Applications.

[35]  Ghazi Al-Naymat,et al.  Fast Mining of Complex Spatial Co-location Patterns Using GLIMIT , 2007, Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007).

[36]  Andrew Hunter Mnzis,et al.  The Road to Ubiquitous Geographic Information Systems Roam Anywhere-Remain Connected , 2000 .

[37]  Franco Turini,et al.  Extracting spatial association rules from spatial transactions , 2005, GIS '05.

[38]  SeungJin Lim,et al.  Fast spatial co-location mining without cliqueness checking , 2008, CIKM '08.

[39]  Frédéric Cazals,et al.  A note on the problem of reporting maximal cliques , 2008, Theor. Comput. Sci..

[40]  Lizhen Wang,et al.  Discovering both positive and negative co-location rules from spatial data sets , 2010, The 2nd International Conference on Software Engineering and Data Mining.