Mining frequent geographic patterns with knowledge constraints

The large amount of patterns generated by frequent pattern mining algorithms has been extensively addressed in the last few years. In geographic pattern mining, besides the large amount of patterns, many are well known geographic domain associations. Existing algorithms do not warrant the elimination of all well known geographic dependences since no prior knowledge is used for this purpose. This paper presents a two step method for mining frequent geographic patterns without associations that are previously known as non-interesting. In the first step the input space is reduced as much as possible. This is as far as we know still the most efficient method to reduce frequent patterns. In the second step, all remaining geographic dependences that can only be eliminated during the frequent set generation are removed in an efficient way. Experiments show an elimination of more than 50% of the total number of frequent patterns, and which are exactly the less interesting.

[1]  Shashi Shekhar,et al.  A join-less approach for co-location pattern mining: a summary of results , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[2]  Peretz Shoval,et al.  Database Reverse Engineering: From the Relational to the Binary Relationship model , 1993, Data Knowl. Eng..

[3]  H. Kriegel,et al.  Spatial Data Mining: Database Primitives, Algorithms and Efficient DBMS Support , 2000, Data Mining and Knowledge Discovery.

[4]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[5]  Michelangelo Ceci,et al.  Discovery of spatial association rules in geo-referenced census data: A relational mining approach , 2003, Intell. Data Anal..

[6]  Dino Pedreschi,et al.  ExAMiner: optimized level-wise frequent pattern mining with monotone constraints , 2003, Third IEEE International Conference on Data Mining.

[7]  Eliseo Clementini,et al.  Mining multiple-level spatial association rules for objects with a broad boundary , 2000, Data Knowl. Eng..

[8]  Nicolas Pasquier,et al.  Discovering Frequent Closed Itemsets for Association Rules , 1999, ICDT.

[9]  James H. Cross,et al.  Reverse engineering and design recovery: a taxonomy , 1990, IEEE Software.

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

[11]  Mohammed J. Zaki.  Generating non-redundant association rules , 2000, KDD '00.

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

[13]  Ramakrishnan Srikant,et al.  Mining generalized association rules , 1995, Future Gener. Comput. Syst..

[14]  Padhraic Smyth,et al.  From Data Mining to Knowledge Discovery in Databases , 1996, AI Mag..

[15]  Fabien Robineau,et al.  OpenGIS Simple Features Specification For SQL, Revision 0 , 1997 .

[16]  Jiawei Han,et al.  Discovery of Spatial Association Rules in Geographic Information Databases , 1995, SSD.

[17]  Stephen McKearney,et al.  Reverse Engineering Databases for Knowledge Discovery , 1996, KDD.

[18]  V. Bogorny,et al.  Towards Elimination of Well Known Geographic Patterns in Spatial Association Rule Mining , 2006, 2006 3rd International IEEE Conference Intelligent Systems.

[19]  Vania Bogorny,et al.  Towards the Reduction of Spatial Joins for Knowledge Discovery in Geographic Databases Using Geo-Ontologies and Spatial Integrity Constraints , 2005 .

[20]  Robert Laurini,et al.  A Methodology for Spatial Consistency Improvement of Geographic Databases , 2000, GeoInformatica.

[21]  Jiawei Han,et al.  Discovery of Multiple-Level Association Rules from Large Databases , 1995, VLDB.

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

[23]  Vania Bogorny,et al.  GEOARM: an Interoperable Framework to Improve Geographic Data Preprocessing and Spatial Association Rule Mining , 2006, SEKE.

[24]  Wynne Hsu,et al.  Pruning and summarizing the discovered associations , 1999, KDD '99.