Yan Huang
ABSTRACT
Mining co-location patterns from spatial databases may reveal types of spatial features likely located as neighbors in space. In this paper, we address the problem of mining confident co-location rules without a support threshold. First, we propose a novel measure called the maximal participation index. We show that every confident co-location rule corresponds to a co-location pattern with a high maximal participation index value. Second, we show that the maximal participation index is non-monotonic, and thus the conventional Apriori-like pruning does not work directly. We identify an interesting weak monotonic property for the index and develop efficient algorithms to mine confident co-location rules. An extensive performance study shows that our method is both effective and efficient for large spatial databases.
- R. Agarwal and R. Srikant. Fast algorithms for Mining association rules. In VLDB'94.Google Scholar
- E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. D. Ullman, and C. Yang. Finding interesting associations without support pruning. Knowledge and Data Engineering, 13(1):64--78, 2001. Google ScholarDigital Library
- N. Cressie. Statistics for spatial data. John Wiley and Sons, (ISBN:0471843369), 1991.Google Scholar
- M. Ester, H.-P. Kriegel, and X. Xu. Knowledge discovery in large spatial databases: focusing techniques for efficient class identification. In SSD'95. Google ScholarDigital Library
- Y. Huang, H. Xiong, S. Shekhar, and J. Pei. Mining confident co-location rules without a support threshold: A summary of results. In University of Minnesota Technical Report, 2002.Google Scholar
- E. M. Knorr and R. T. Ng. Extraction of spatial proximity patterns by concept generalization. In KDD'96.Google Scholar
- K. Koperski and J. Han. Discovery of Spatial Association Rules in Geographic Information Databases. In SSD'95. Google ScholarDigital Library
- Y. Morimoto. Mining Frequent Neighboring Class Sets in Spatial Databases. In KDD'01. Google ScholarDigital Library
- R. T. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In VLDB'94. Google ScholarDigital Library
- S. Shekhar and Y. Huang. Co-location Rules Mining: A Summary of Results. In SSTD'01.Google Scholar
- S. Shekhar, C. Lu, and P. Zhang. Detecting Graph-based Spatial Outliers: Algorithms and Applications. KDD'01. Google ScholarDigital Library
- S. Shekhar, P. Schrater, W. Raju, and W. Wu. Spatial Contextual Classification and Prediction Models for Mining Geospatial Data. IEEE Transactions on Multimedia (special issue on Multimedia Databases), 2002. Google ScholarDigital Library
Recommendations
Mining Frequent Itemsets without Support Threshold: With and without Item Constraints
In classical association rules mining, a minimum support threshold is assumed to be available for mining frequent itemsets. However, setting such a threshold is typically hard. In this paper, we handle a more practical problem; roughly speaking, it is ...
Mining N-most interesting itemsets without support threshold by the COFI-tree
Data mining is the discovery of interesting and hidden patterns from a large amount of collected data. Applications can be found in many organisations with large databases, for many different purposes such as customer relationships, marketing, planning, ...
An Efficient Algorithm for Mining Association Rules Using Confident Frequent Itemsets
ACCT '13: Proceedings of the 2013 Third International Conference on Advanced Computing & Communication TechnologiesIdentifying frequent item sets is one of the most important issues faced by the knowledge discovery and data mining community. There have been a number of successful algorithms developed for extracting frequent item sets in very large databases. ...
Comments