Robust distance-based clustering with applications to spatial data mining

Algorithmica (New York)

Volumn 30, Issue 2, 2001, Pages 216-242

  Estivill Castro, V ^a   Houle, M E ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

Clustering; Combinatorial optimization; Data mining; Delaunay triangulation; Exploratory data analysis; Medoids; Noise; p Median problem; Spatial databases

Indexed keywords

ACOUSTIC NOISE; APPROXIMATION THEORY; GEOGRAPHIC INFORMATION SYSTEMS; OPTIMIZATION; TREES (MATHEMATICS); TRIANGULATION;

COMBINATORIAL OPTIMIZATION;

DATA MINING;

EID: 0012941002     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0010-1     Document Type: Article

References (93)

1. P. Agarwal, M. Sharir, and E. Welzl. The discrete 2-center problem. In Proceedings of the 13th ACM Symposium on Computational Geometry, pages 147-155, 1997.
2. M. S. Aldenderfer and R. K. Blashfield. Cluster Analysis. Sage, Beverly Hills, CA, 1984.
3. M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander. OPTICS: Ordering points to identify the clustering structure. SIGMOD Record, 28(2):49, 1999. (Proceedings of ACM SIGMOD 99 International Conference on Management of Data.)
4. S. Aronoff. Geographic Information Systems: A Management Perspective, 3rd edition. WDL, Ottawa, 1993.
5. S. Arora, P. Raghavan, and S. Rao. Approximation schemes for Euclidean k-medians and related problems. In Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (STOC). ACM Press, New York, 1998.
6. M. J. A. Berry and G. Linoff. Data Mining Techniques-for Marketing, Sales and Customer Support. Wiley, New York, 1997.
7. G. Bianchi and R. Church. A non-binary encoded genetic algorithm for a facility location problem. Working Paper, Department of Geography, University of California, Santa Barbara, CA, 1992.
8. B. Bozkaya, J. Zhang, and E. Erkut. An effective genetic algorithm for the p-median problem. Paper presented at INFORMS Conference in Dallas, October 1997.
9. P. S. Bradley and U. Fayyad. Refining the initial points in k-means clustering. In Proceedings of the Fifteenth International Conference on Machine Learning, pages 91-99. Morgan Kaufmann, San Mateo, CA, 1998.
10. P. S. Bradley, U. Fayyad, and C. Reina. Scaling clustering algorithms to large databases. In R. Agrawal and P. Stolorz, editors, Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pages 9-15. AAAI Press, Menlo Park, CA, 1998.
11. Y. Cai, N. Cercone, and J. Han. Attribute-oriented induction in relational databases. In G. Piatetsky-Shapiro and W. J. Frawley, editors, Knowledge Discovery in Databases, pages 213-228. AAAI Press, Menlo Park, CA, 1991.
12. P. Cheeseman, M. Self, J. Kelly, W.Taylor, D. Freeman, and J. Stutz. Bayesian classification. In Proceedings of the Seventh National Conference on Artificial Intelligence, pages 607-611. Morgan Kaufmann, Palo Alto, CA, 1988.
13. V. Cherkassky and F. Muller. Learning from Data-Concept, Theory and Methods. Wiley, New York, 1998.
14. D. K. Y. Chiu, A. K. C. Wong, and B. Cheung. Information discovery through hierarchical maximum entropy discretization and synthesis. In G. Piatetsky-Shapiro and W. J. Frawley, editors, Knowledge Discovery in Databases, pages 125-140. AAAI Press, Menlo Park, CA, 1991.
15. T. H. Cormen, C. E. Leiserson and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
16. G. Cornuejols, M. Fisher, and G. Nemhauser. Location of bank accounts to optimize float: An analystic study of exact and approximate algorithms. Management Science, 23:789-910, 1977.
17. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likehood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B, 39:1-38, 1977.
18. P. Densham and G. Rushton. A more efficient heuristic for solving large p-median problems. Papers in Regional Science, 71:307-329, 1992.
19. M. T. Dickerson, R. L. S. Drysdale, and J.-R. Sack. Simple algorithms for enumerating interpoint distances and finding k nearest neighbours. International Journal of Computational Geometry &. Applications, 2(3):221-239, 1992.
20. D. Dowe, R. A. Baxter, J. J. Oliver, and C. Wallace. Point estimation using the Kullback-Leibler loss function and MML. In X. Wu, R. Kotagiri, and K. K. Korb, editors, Proceedings of Second Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-98), pages 87-95, Melbourne, 1998. Lecture Notes in Artificial Intelligence 1394. Springer-Verlag, New York, 1998.
21. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. Wiley, New York, 1973.
22. M. J. Egenhofer. Geographic database systems: Issues and research needs. In Proceedings of the 15th ACM-SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, page 80. ACM Press, New York, 1996.
23. C. Eldershaw and M. Hegland. Cluster analysis using triangulation. In B. J. Noye, M. D. Teibner, and A. W. Gill, editors, Proceedings of Computational Techniques with Applications Conference (CTAC91), pages 201-208. World Scientific, Singapore, 1997.
24. D. Eppstein, M. S. Paterson, and F. F. Yao. On nearest-neighbour graphs. Discrete & Computational Geometry, 17:263-282, 1997.
25. M. Ester, A. Frommelt, H. P. Kriegel, and J. Sander. Algorithms for characterization of trend detection in spatial databases. In R. Agrawal and P. Stolorz, editors, Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pages 44-50. AAAI Press, Menlo Park, CA, 1998.
26. M. Ester, H. P. Kriegel, and J. Sander. Spatial data mining: A database approach. In A. School and A. Voisard, editors, Advances in Spatial Databases, 5th International Symposium (SDD-91), pages 47-66. Lecture Notes in Computer Science 1262. Springer-Verlag, Berlin, 1997.
27. 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, editors, Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), pages 226-231. AAAI Press, Menlo Park, CA, 1996.
28. M. Ester, H. P. Kriegel, and X. Xu. Knowledge discovery in large spatial databases: Focusing techniques for efficient class identification. In M. J. Egenhofer and J. R. Herring, editors, Advances in Spatial Databases (SDD-95), pages 70-82, Portland, ME, 1995. Lecture Notes in Computer Science 951. Springer-Verlag, Berlin, 1995.
29. V. Estivill-Castro and A. T. Murray. Discovering associations in spatial data-an efficient medoid based approach. In X. Wu, R. Kotagiri, and K. K. Korb, editors, Proceedings of the 2nd Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-98), pages 110-121, Melbourne, 1998. Lecture Notes in Artificial Intelligence 1394. Springer-Verlag, New York, 1998.
30. V. Estivill-Castro and A. T. Murray. Mining spatial data via clustering. In T. K. Poiker and N. Chrisman, editors, Proceedings of the 8th International Symposium on Spatial Data Handling (SDH-98), pages 522-532. International Geographical Union, 1998.
31. V. Estivill-Castro and A. T. Murray. Spatial clustering for data mining with genetic algorithms. In Proceedings of the International ICSC Symposium on Engineering of Intelligent Systems (EIS-98). CD-ROM ISBN 3-906454-11-8, 1998.
32. V. Estivill-Castro and R. Torres-Velázquez. Hybrid genetic algorithm for solving the p-median problem. In A. Yao, R. I. McKay, C. S. Newton, J.-H. Kim, and T. Furuhashi, editors, Proceedings of Second Asia-Pacific Conference On Simulated Evolution and Learning (SEAL-98), pages 18-25. Lecture Notes in Artificial Intelligence 1585. Springer-Verlag, New York, 1999.
33. U. Fayyad, C. Reina, and P. S. Bradley. Initialization of iterative refinement clustering algorithms. In R. Agrawal and P. Stolorz, editors, Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pages 194-198. AAAI Press, Menlo Park, CA, 1998.
34. R. L. Francis. Facility Layout and Location: An Analytical Approach. Prentice-Hall, Englewood Cliffs, NJ, 1974.
35. A. A. Freitas and S. H. Lavington. Mining Very Large Databases with Parallel Processing. Kluwer, London, 1998.
36. M. Garza-Jinich, P. Meer, and V. Medina. Robust retrieval of three-dimensional structures from image stacks. Medical Image Analysis, 3(1):21-35, 1999.
37. F. Glover. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 5:533-549, 1986.
38. M. Goodchild and V. Noronha. Location-allocation for small computers. Monograph 8, University of Iowa, 1983.
39. R. P. Haining. Spatial Data Analysis in the Social and Enviromental Sciences. Cambridge University Press, Cambridge, 1990.
40. J. Han, S. Chee, and J. Y. Chiang. Issues for on-line analytical mining of data warehouses. In Proceedings of 1998 SIGMOD-96 Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD-98), Seattle, WA, 1998.
41. K. Han, J. Koperski and N. Stefanovic. GeoMiner: A system prototype for spatial data mining. SIGMOD Record, 26(2):553-556, 1997.
42. J. Hershberger and S. Suri. Finding tailored partitions. Journal of Algorithms, 12:431-463, 1991.
43. A. Hitchinson. Algorithmic Learning. Graduate Texts in Computer Science. Clarendon Press, Oxford, 1994.
44. M. Horn. Analysis and computation schemes for p-median heuristics. Environment and Planning A, 28:1699-1708, 1996.
45. C. Hosage and M. Goodchild. Discrete space location-allocation solutions from genetic algorithms. Annals of Operations Research, 6:35-46, 1986.
46. Z. Huang. Clustering large data sets with mixed numeric and categorical values. In Proceedings of the First Asia-Pacific Conference on Knowledge Discovery and Data Mining. World Scientific, Singapore, 1997.
47. Z. Huang. A fast clustering algorithm to cluster very large categorical data sets in data mining. In SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (SIGMOD-DMKD97), Tucson, AZ, May 1997.
48. M. Jambu and M.-O. Leebaux. Cluster Analysis and Data Analysis. North-Holland, Amsterdam, 1983.
49. I.-S. Kang, T.-W. Kim, and K.-J. Li. A spatial data mining method by Delaunay triangulation. In Proceedings of the Fifth ACM Workshop on Geographic Information Systems, Las Vegas, NV, 1997.
50. L. Kaufman and P. J. Rousseeuw. Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York, 1990.
51. E. M. Knorr, R. T. Ng, and D. L. Shilvock. Finding boundary shape matching relations in spatial data. In A. School and A. Voisard, editors. Advances in Spatial Databases, 5th International Symposium (SDD-91), pages 29-46. Lecture Notes in Computer Science 1262. Springer-Verlag, Berlin, 1997.
52. K. Koperski and J. Han. Discovery of spatial association in geographic information databases. In M. J. Egenhofer and J. R. Herring, editors, Advances in Spatial Databases - Proceedings of the 4th International Symposium (SDD-95), pages 47-66, Portland, ME, 1995. Lecture Notes in Computer Science 951. Springer-Verlag, Berlin, 1995.
53. K. Koperski, J. Han, and J. Adhikari. Mining knowledge in geographical data. Communications of the ACM, to appear.
54. D. Krznaric and C. Levcopoulos. Fast algorithms for complete linkage clustering. Discrete & Computational Geometry, 19:131-145, 1998.
55. W. Lu, J. Han, and B. C. Ooi. Discovery of general knowledge in large spatial datasets. In Proceedings of the 1993 Far East Workshop on Knowledge and Data Engineering (FEGIS-93), pages 275-279, Singapore, June 1993.
56. J. MacQueen. Some methods for classification and analysis of multivariate observations. In L. Le Cam and J. Neyman, editors, Proceedings of the 5th Berkley Symposium on Mathematical Statistics and Probability, volume 1, pages 281-297, 1967.
57. Z. A. Melzak. Companion to Concrete Mathematics; Mathematical Techniques and Various Applications. Wiley, New York, 1973.
58. A. T. Murray and R. L. Church. Applying simulated annealing to location-planning models. Journal of Heuristics, 2:31-53, 1996.
59. A. T. Murray and V. Estivill-Castro. Cluster discovery techniques for exploratory spatial data analysis. International Journal of Geographic Information Systems, 12(5):431-443, 1998.
60. F. Murtagh. Comments of "Parallel algorithms for hierarchical clustering and cluster validity". IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(10):1056-1057, 1992.
61. S. Narula, U. Ogbu, and H. Samuelsson. An algorithm for the p-median problem. Operations Research, 25:709-713, 1977.
62. R. T. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In J. Bocca, M. Jarke, and C. Zaniolo, editors. Proceedings of the 20th Conference on Very Large Data Bases (VLDB), pages 144-155, Santiago, Morgan Kaufmann, San Mateo, CA, 1994.
63. B.-W. Oh, J.-K. Yun, and K.-J. Han. ASK-ME: A spatial data mining system based on clustering. Bulletin of the International Rough Set Society, 3(1/2):11-17, March 1999.
64. A. Okabe, B. Boots, and K. Sugihara. Spatial Tesselations - Concepts and Applications of Voronoi Diagrams. Wiley, New York, 1992. ISBN 0471-93430-5.
65. S. Openshaw. Two exploratory space-time-attribute pattern analysers relevant to GIS In S Fothing ham and P. Rogerson, editors, Spatial Analysis and CIS, pages 83-104. Taylor and Francis London,
66. S. Openshaw, M. Charlton, C. Wymer, and A. Craft. A Mark 1 geographical analysis machine for the automated analysis of point data sets. International Journal of Geographical Information Systems 1(4):335-358, 1987.
67. S. Openshaw and I. Turton. A parallel Kohonen algorithm for the classification of large spatial datasets. Computers and Geosciences, 22(9):1019-1026, 1996.
68. J. O'Rourke. Computational Geometry in C. Cambridge University Press, Cambridge, 1994.
69. F. P. Preparata and M. I. Shamos. Computational Geometry An Introduction. Springer-Verlag, New York, 1985.
70. C. ReVelle and R. Swain. Central facilities location. Geographical Analysis, 2:30-42, 1970.
71. J. Rissanen. Stochastic complexity. Journal of the Royal Statistical Society, Series B, 49(3):223-239, 1987.
72. J. Rissanen. Fast universal coding with context models. IEEE Transactions on Information Theory, 45(4):1065-1071, May 1999.
73. 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.
74. K. Rosing. An optimal method for solving the (generalized) multi-Weber problem. European Journal of Operations Research, 58:414-426, 1992.
75. K. Rosing, E. Hillsman, and H. Rosing. A note comparing optimal and heuristic solutions to the p-median problem. Geographical Analysis, 11:86-89, 1979.
76. K. E. Rosing, C. S. ReVelle, and H. Rosing-Voyelaar. The p-median and its linear programming relaxation: An approach to large problems. Journal of the Operational Research Society, 30:815-823, 1979.
77. P. J. Rousseeuw and A. M. Leroy. Robust Regression and Outlier Detection. Wiley, New York, 1987.
78. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1989.
79. R. J. Schalkoff. Pattern Recognition-Statistical, Structural and Neural Approaches. Wiley, New York, 1992.
80. E. Schikuta. Grid-clustering: An efficient hierarchical clustering method for very large data sets. In Proceedings of the 13th International Conference on Pattern Recognition, volume 2, pages 101-105, 1996.
81. E. Schikuta and M. Erhart. The BANG-clustering system: Grid-based data analysis. In Proceedings of the Second International Symposium IDA-97. Lecture Notes in Computer Science 1280. Springer-Verlag, Berlin, 1997.
82. P. Sorensen. Analysis and design of heuristics for the p-median location-allocation problem. Master's thesis, Department of Geography, University of California, Santa Barbara, CA, 1994.
83. M. B. Teitz and P. Bart. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16:955-961, 1968.
84. C. S. Wallace and D.M. Boulton. An information measure for classification. Computer Journal, 11:185-195, 1968.
85. C. S. Wallace and D. L. Dowe. Minimum message length and Kolmogorov complexity. Computer Journal (special issue on Kolmogorov complexity), 42(4):270-283, 1999.
86. C. S. Wallace and P. R. Freeman. Estimation and inference by compact coding. Journal of the Royal Statistical Society, Series B, 49(3):240-265, 1987.
87. W. Wang, J. Yang, and R. Muntz. STING: A statistical information grid approach to spatial data mining. In M. Jarke, editor, Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB), pages 186-195, Athens, August 1997. Morgan Kaufmann, San Mateo, CA, 1997.
88. C. Watson-Gandy. A note on the centre of gravity in depot location. Management Science, 18:B478-481, 1972.
89. J. Weaver and R. Church. A median location model with nonclosest facility service. Transportation Science, 19:107-119, 1985.
90. R. Webster and M. A. Oliver. Statistical Methods in Soil and Land Resource Survey. Oxford University Press, Oxford, 1990.
91. D. Wishart. Supplement, CLUSTAN User Manual, third edition. Prigram Library Unit, Edinburgh University, Edinburgh, 1982.
92. X. Xu, M. Ester, H. P. Kriegel, and J. Sander. A distribution-based clustering algorithm for mining large spatial databases. In Proceedings of the 14th International Conference on Data Engineering, pages 324-333, Orlando, FL, February 1998. IEEE Computer Society Press, Los Alamitos, CA, 1998.
93. 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. (Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data.)