Discovering associations in spatial data-an efficient medoid based approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1394, Issue , 1998, Pages 110-121

  Estivill Castro, Vladimir ^a   Murray, Alan T ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

GEOGRAPHIC INFORMATION SYSTEMS; HEURISTIC ALGORITHMS;

CLUSTERING APPROACH; COMPUTATIONAL TIME; DATA MINING APPLICATIONS; HEURISTIC SEARCH; HIERARCHICAL METHOD; SPATIAL CLUSTERING; SPATIAL DATA MINING; SPATIAL DATABASE;

DATA MINING;

EID: 79957944034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64383-4_10     Document Type: Conference Paper

References (15)

1. Y. Cai, N. Cercone, and J. Han. Attribute-oriented induction in relational databases. In G. Piatetsky-Shapiro and W.J. Erawley, Knowledge Discovery in Databases, 213-228, Menlo Park, CA. USA, 1991. AAAI Press.
2. M. Ester, H.P. Kriegel, and J. Sander. Spatial data mining: A database approach. In A. School and A. Voisrad, Advances in Spatial Databases, 5th Int. Symp., SDD-97, 47-66, Berlin, Germany, 1997. Springer-Verlag LNCS 1262.
3. M. Ester, H.P. Kriegel, S. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In E. Simoudis, J. Han, and U. Fayyad, Proc. of the 2nd Ini. Conf. on Knowledge Discovery and Data Mining (KDD-96), 226-231, Menlo Park, CA, 1996. AAAI, AAAI Press.
4. V. Estivill-Castro and A.T. Murray. Mining spatial data via clustering. Technical Report #5/97, FIT, QUT, Brisbane 4000, Australia, 1997.
5. A. Ghozeil and D.B. Fogel. Discovering patterns in spatial data using evolutionary programming. In J.R. Koza, Genetic Programming: Proc. of the First Annual Conf., 521-527, Cambridge, MA, 1996. MIT Press.
6. M Goodchild and V. Noronha. Location-allocation for small computers. Monograph 8, University of Iowa, 1983.
7. K. Han, J. Koperski and N. Stefanovic. GeoMiner: A system prototype for spatial data mining. SIGMOD Record, 26(2):553-556, 1997.
8. D.S. Johnson, C.H. Papadimitrou, and M. Yanakakis. How easy is local search? Journal of Computer System Sciences, 37:79-100, 1988.
9. L. Kaufman and P.J. Rousseuw. Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, NY, US, 1990.
10. A.T. Murray and R.L. Church. Applying simulated annealing to location-planning models. Journal of Heuristics, 2:31-53, 1996.
11. A.T. Murray and V. Estivill-Castro. Cluster discovery techniques for exploratory spatial data analysis. Int. J. of GIS (to appear).
12. R.T. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In J. Bocca, M. Jarke, and C. Zaniolo, Proc. of the 20th Conf. on Very Large Data Bases (VLDB), 144-155, San Francisco, CA, 1994. Morgan Kaufmann.
13. D. Rolland, E. Schilling and J. Current. An efficient tabu search procedure for the p-median problem. European Journal of Operations Research, 96:329-342, 1996.
14. P. Sorensen. Analysis and design of heuristics for the p-median location-allocation problem. Master’s thesis, Dep. of Geography, U. California, Santa Barbara, 1994.
15. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. SIGMOD Record, 25(2):103-114, June 1996.