Adaptive Two-phase spatial association rules mining method

Authors

  • Chin-Feng Lee Department of Information Management , Chaoyang University of Technology, 168, Jifong E.Rd., Wufong Township, Taichung County 41349, Taiwan (R.O.C.)
  • Mei-Hsiu Chen Department of Information Management , Chaoyang University of Technology, 168, Jifong E.Rd., Wufong Township, Taichung County 41349, Taiwan (R.O.C.)

Keywords:

Spatial Database, Data Mining, Spatial Association Rules, Remote Sensed Image

Abstract

Since huge amounts of spatial data can be easily collected from various applications, ranging from remote sensing technology to geographical information system, the extraction and comprehension of spatial knowledge is a more and more important task. Many excellent studies on Remote Sensed Image (RSI) have been conducted for potential relationships of crop yield. However, most of them suffer from the performance problem because their techniques for mining association rules are based on Apriori algorithm. In this paper, two efficient algorithms, two-phase spatial association rules mining and adaptive two-phase spatial association rules mining, are proposed for address the above problem. Both methods primarily conduct two phase algorithms by creating Histogram Generators for fast generating coarse-grained spatial association rules, and further mining the fine-grained spatial association rules w.r.t the coarse-grained frequently patterns obtained in the first phase. Adaptive two-phase spatial association rules mining method conducts the idea of partition on an image for efficiently quantizing out non-frequent patterns and thus facilitate the following two phase process. Such two-phase approaches save much computations and will be shown by lots of experimental results in the paper.

Downloads

Download data is not yet available.

References

[1] R. Agrawal, and R. Srikant (1994), “Fast Algorithms for Mining Association Rules in Large Database,” Conference of Very Large Data Bases, Santiago, Chile, pp. 487-499.
[2] S. W. Changchien, and T. C. Lu (2001), “Knowledge Discovery from Object-Oriented Databases Using an Association Rules Mining Algorithm,” Processing of the 5th International Conference on Knowledge-Based Intelligent Information Engineering System & Allied Technologies 6, 7, &8.
[3] E. Clementini, P. D. Felice, and K. Koperski (2000), “Mining Multiple-Level Spatial Association Rules for Objects with a Broad Boundary,” Data and Knowledge Engineering, Vol. 34, pp. 251-270.
[4] A. Denton, W. Perrizo, Q. Ding, and Q. Ding (2002), “Efficient Hierarchical Clustering of Large Data Sets Using P-trees,” Proceeding of 15th International Conference on Computer Applications in Industry and Engineering, San Diego, CA, pp. 138-141.
[5] Q. Ding, Q. Ding, and W. Perrizo (2002), “Decision Tree Classification of Spatial Data Streams Using Peano Count Trees,” Proceeding of ACM Symposium on Applied Computing, Madrid, Spain, pp. 413-417.
[6] Q. Ding, Q. Ding, and W. Perrizo (2002), “Association Rule Mining on Remotely Sensed Images Using P-trees,” Proceedings of PAKDD 2002, pp. 66-79.
[7] M. Ester, A. Frommelt, H. P. Kriegel, and J. Sander (1998), “Algorithms for Characterization and Trend Detection in Spatial Databases,” Proceeding of 4thInternational Conference on Knowledge Discovery and Data Mining, Menlo Park, CA, pp. 44-50.
[8] M. Ester, S. Gundlach, H. P. Kriegel, and J. Sander (2000), “Spatial Data Mining: Database Primitives, Algorithms and Efficient DBMS Support,” Data Mining and Knowledge Discovery, Vol. 4, pp. 193-216.
[9] M. Ester, and H. P. Kriegel (1997),“Spatial Data Mining: A Database Approach,” Processing 5th Int. Symposium on Large Spatial Databases, Berlin, pp. 47-66.
[10] M. Ester, H. P. Kriegel, and J. Sander (1999), “Knowledge Discovery in Spatial Databases,” Conf. of 23rd German on Artificial Intelligence, Bonn, Germany, pp. 61-74.
[11] R. H. Guting (1994), “An Introduction to Spatial Database Systems,” Conference of Very Large Data Base, pp. 357-400.
[12] J. Han, and Y. Fu (1995), “Discovery of Multiple-Level Association Rules from Large Databases,” Processing 21th International Conference Very Large Data Bases, pp. 420-431.
[13] D. Holt, and M. Chung (2002), “Mining Association Rules Using Inverted Hashing and Pruning,” Information Processing Letters, Vol. 83, No. 4, pp. 211-220.
[14] K. Koperski, and J. Han (1995), “Discovery of Spatial Association Rules in Geographic Information Databases,” Proceeding Fourth Advances in Spatial Databases Symp. Springer, Berlin, pp. 47-66.
[15] K. Koperski, J. Han, and N. Stefanovic (1998), “An Efficient Two-Step Method for Classification of Spatial Data,” Proceeding of International Symposium on Spatial Data Handling, Vancouver, BC, Canada, pp. 45-54.
[16] W. Lu, J. Han, and B. C. Ooi (1993), “Discovery of General Knowledge in Large Spatial Databases,” Proceeding of Far East Workshop on Geographic Information Systems, World Scientific, Singapore, pp. 275-289.
[17] J. S. Park, M. S. Chen, and P. S. Yu (1995), “An Effective Hash-Based Algorithm for Mining Association Rules,” Proceeding of ACM-SIGMOD Conference Management of Data, San Jose, CA, pp. 175-186.
[18] W. Perrizo, Q. Ding, Q. Ding, and A. Roy (2001), “Deriving High Confidence Rules from Spatial Data using Peano Count Trees,” Proceedings of International Conference on Web-Age Information Management, Springer-Verlag, Lecture Notes in Computer Science 2118, pp. 91-102.
[19] A. Savasere, E. Omiecinski, and S. Navathe (1995), “An Efficient Algorithm for Mining Association Rules in Large Databases,” Processing 21st VLDB Conference, pp. 432-444.
[20] K. Sayood (1996), “Introduction to Data Compression,” Morgan Kauffman Publishers, San Fransisco, CA.
[21] Remote Sensing Tutorial Available http://rst.gsfc.nasa.gov/Front/tofc.html

Downloads

Published

2006-04-03

How to Cite

Lee, C.-F., & Chen, M.-H. (2006). Adaptive Two-phase spatial association rules mining method. Journal of Computer Science and Technology, 6(01), p. 36–45. Retrieved from https://journal.info.unlp.edu.ar/JCST/article/view/827

Issue

Section

Original Articles