IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 2    
Website: http://www.ijser.org
scirp IJSER >> Volume 3,Issue 2,February 2012
A Framework for Spatial Data Mining
Full Text(PDF, )  PP.23-35  
Author(s)
. Uppalaiah, Dr. N. Subhash Chandra, A. Srinivas, Prof. T. Ajay Kumar and M,Suman
KEYWORDS
Database Primitives for Spatial Data Mining, Algorithms for Spatial Data Mining, Efficient DBMS Support Based on Neighborhood Indices
ABSTRACT
Our framework for spatial data mining heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a single run of a typical algorithm. Therefore, providing general concepts for neighborhood relations as well as an efficient implementation of these concepts will allow a tight integration of spatial data mining algorithms with a spatial database management system. This will speed up both, the development and the execution of spatial data mining algorithms. In this paper, we define neighborhood graphs and paths and a small set of database primitives for their manipulation. We show that typical spatial data mining algorithms are well supported by the proposed basic operations. For finding significant spatial patterns, only certain classes of paths "leading away" from a starting object are relevant. We discuss filters allowing only such neighborhood paths which will significantly reduce the search space for spatial data mining algorithms. Furthermore, we introduce neighborhood indices to speed up the processing of our database primitives. We implemented the database primitives on top of a commercial spatial database management system. The effectiveness and efficiency of the proposed approach was evaluated by using an analytical cost model and an extensive experimental study on a geographic database.
References
[1][AIS 93] Agrawal R., Imielinski T., Swami A.: “Database Mining: A Performance Perspective”, IEEE Transactions on Knowledge and Data Engineering, Vol. 5, No. 6, 1993, pp. 914-925.

[2][BF 91] Bill, Fritsch: “Fundamentals of Geographical Information Systems: Hardware, Software and Data” (in German), Wichmann Publishing, Heidelberg, Germany, 1991.

[3][Ege 91] Egenhofer M. J.: “Reasoning about Binary Topological Relations”, Proc. 2nd Int. Symp. on Large Spatial Databases, Zurich, Switzerland, 1991, pp. 143-160.

[4][EKS 97] Ester M., Kriegel H.-P., Sander J.: “Spatial Data Mining: A Database Approach”, Proc. 5th Int. Symp. on Large Spatial Databases, Berlin, Germany, 1997, pp. 47-66.

[5][EFKS 98] Ester M., Frommelt A., Kriegel H.-P., Sander J.: “Algorithms for Characterization and Trend Detection in Spatial Databases”, Proc. 4th Int. Conf. on Knowledge Discovery and Data Mining, New York City, NY, 1998, pp. 44-50.

[6][FPS 96] Fayyad U. M., .J., Piatetsky-Shapiro G., Smyth P.: “From Data Mining to Knowledge Discovery: An Overview”, in: Advances in Knowledge Discovery and Data Mining, AAAI Press, Menlo Park, 1996, pp. 1 - 34.

[7][Gue 94] Gueting R. H.: “An Introduction to Spatial Database Systems”, Special Issue on SpatialDatabase Systems of the VLDB Journal, Vol. 3, No. 4, October 1994.

[8][Gut 84] Guttman A.: “R-trees: A Dynamic Index Structure for Spatial Searching“, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1984, pp. 47-54.

[9][Ill 97] Informix Inc.: ”Illustra User’s Guide”, Version 3.3, 1997.

[10][KH 95] Koperski K. and Han J.: “Discovery of Spatial Association Rules in Geographic Information Databases”, Proc. 4th Int. Symp. on Large Spatial Databases (SSD ‟95),Portland, ME, 1995, pp 47-66.

[11][KHA 96] Koperski K., Adhikary J., Han J.: “Knowledge Discovery in Spatial Databases: Progress and Challenges”, Proc. SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Technical Report 96-08, University of BritishColumbia, Vancouver, Canada, 1996.

[12][KHS 98] Koperski K. , Han J., Stefanovic N.: “An Efficient Two-Step Method for Classification of Spatial Data”, Proc. Symposium on Spatial Data Handling (SDH „98), Vancouver, Canada, 1998.

[13][LH 92] Lu W., Han J.: “Distance-Associated Join Indices for Spatial Range Search”, Proc. 8th Int. Conf. on Data Engineering, Phoenix, AZ, 1992, pp. 284-292.

[14][NH 94] Ng R. T., Han J.:“Efficient and Effective Clustering Methods for Spatial Data Mining”,Proc. 20th Int. Conf. on Very Large Data Bases, Santiago, Chile, 1994, pp. 144-155.

[15][Rot 91] Rotem D.: “Spatial Join Indices”, Proc. 7th Int. Conf. on Data Engineering, Kobe, Japan, 1991, pp. 500-509.

[16][SEKX 98] Sander J., Ester M., Kriegel H.-P., Xu X.: “Density-Based Clustering in Spatial Databases: A New Algorithm and its Applications”, Data Mining and Knowledge Discovery, an International Journal, Kluwer Academic Publishers, Vol.2, No. 2, 1998.

[17][Val 87] Valduriez P.: “Join Indices“, ACM Transactions on Database Systems, Vol. 12, No. 2, 1987, pp. 218-246.

Untitled Page