A hybrid spatial data clustering method for site selection: The data driven approach of GIS mining

This article applies customer service to be the research background. Spatial data mining method is proposed to solve site selection of the service center. Firstly, a new data model for recording all the information of customer management is given, which transforms the traditional model-driven strategy to data-oriented method. Secondly, a hybrid spatial clustering method named OETTC-MEANS-CLASA algorithm is proposed. It has the advantages of applying k-means algorithm to reduce the result space and using simulated annealing method (CLASA) as result-searching strategy to find more qualified solutions. On the basis of GIS functions, we design deeper analytical function to take spatial obstacle factors, spatial environmental factors, spatial terrain factors, spatial traffic factors and cost factors into account. The result of the experiment declares that the algorithm does better at the both aspects of perform efficiency and result quality.

[1]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[2]  Jeng-Shyang Pan,et al.  An Efficient K -Medoids-Based Algorithm Using Previous Medoid Index, Triangular Inequality Elimination Criteria, and Partial Distance Search , 2002, DaWaK.

[3]  Nebojsa Stefanovic.  Design and implementation of on-line analytical processing (OLAP) of spatial data , 1997 .

[4]  Oded Berman,et al.  Competitive facility location and design problem , 2007, Eur. J. Oper. Res..

[5]  José Muñoz,et al.  A neural model for the p-median problem , 2008, Comput. Oper. Res..

[6]  Jiawei Han,et al.  CLARANS: A Method for Clustering Objects for Spatial Data Mining , 2002, IEEE Trans. Knowl. Data Eng..

[7]  Anthony K. H. Tung,et al.  Spatial clustering in the presence of obstacles , 2001, Proceedings 17th International Conference on Data Engineering.

[8]  Anthony K. H. Tung,et al.  Spatial clustering methods in data mining : A survey , 2001 .

[9]  Weili Wu,et al.  Modelling spatial dependencies for mining geospatial data: An introduction , 2001 .

[10]  Hans-Peter Kriegel,et al.  Clustering for Mining in Large Spatial Databases , 1998, Künstliche Intell..

[11]  Peng Zhang,et al.  A new approximation algorithm for the k-facility location problem , 2006, Theor. Comput. Sci..

[12]  Ge Lin.  Comparing spatial clustering tests based on rare to common spatial events , 2004, Comput. Environ. Urban Syst..

[13]  Min-Yuan Cheng,et al.  Automating utility route design and planning through GIS , 2001 .

[14]  M. S. Rosenbaum,et al.  Spatial management of geotechnical data for site selection , 1998 .

[15]  Roy Ladner,et al.  Fuzzy Set Approaches to Spatial Data Mining of Association Rules , 2003, Trans. GIS.

[16]  John F. Roddick,et al.  A comparative study and extensions to k-medoids algorithms , 2001 .

[17]  Piotr Jankowski,et al.  Integrating Geographical Information Systems and Multiple Criteria Decision-Making Methods , 1995, Int. J. Geogr. Inf. Sci..

[18]  Tao Chen,et al.  Efficient discovery of multilevel spatial association rules using partitions , 2005, Inf. Softw. Technol..

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

[20]  Jiawei Han,et al.  Object-Based Selective Materialization for Efficient Implementation of Spatial Data Cubes , 2000, IEEE Trans. Knowl. Data Eng..

[21]  Mark S. Daskin,et al.  Strategic facility location: A review , 1998, Eur. J. Oper. Res..

[22]  Chi-Hoon Lee,et al.  Clustering spatial data in the presence of obstacles: a density-based approach , 2002, Proceedings International Database Engineering and Applications Symposium.

[23]  Anthony K. H. Tung,et al.  Constraint-based clustering in large databases , 2001, ICDT.

[24]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[25]  Maro Vlachopoulou,et al.  Geographic information systems in warehouse site selection decisions , 2001 .

[26]  L. Buydens,et al.  SpaRef: a clustering algorithm for multispectral images , 2003 .

[27]  Sam Yuan Sung,et al.  A hybrid EM approach to spatial clustering , 2006, Comput. Stat. Data Anal..

[28]  The GIS book : understanding the value and implementation of geographic information systems , 1997 .

[29]  Vladimir Marianov,et al.  The Queueing Maximal availability location problem: A model for the siting of emergency vehicles , 1996 .

[30]  P. Nikolakaki,et al.  A GIS site-selection process for habitat creation: estimating connectivity of habitat patches , 2004 .

[31]  R E Schofield,et al.  French and british studies. , 1978, Science.

[32]  Panos Kalnis,et al.  Efficient OLAP Operations in Spatial Data Warehouses , 2001, SSTD.

[33]  Berkant Barla Cambazoglu,et al.  Clustering spatial networks for aggregate query processing: A hypergraph approach , 2008, Inf. Syst..

[34]  Guillermo Ayala,et al.  Clustering of spatial point patterns , 2006, Comput. Stat. Data Anal..

[35]  Lixun Zhang,et al.  Optimizing the size and locations of facilities in competitive multi-site service systems , 2008, Comput. Oper. Res..

[36]  Oded Berman,et al.  Locating Multiple Competitive Facilities: Spatial Interaction Models with Variable Expenditures , 2002, Ann. Oper. Res..

[37]  A. Yeh,et al.  An integrated GIS and location-allocation approach to public facilities planning : An example of open space planning , 1996 .

[38]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[39]  Guillermo Ayala,et al.  Morphometric Analysis of Human Corneal Endothelium by Means of Spatial Point Patterns , 2002, Int. J. Pattern Recognit. Artif. Intell..