Clustering with obstacles for Geographical Data Mining

ISPRS Journal of Photogrammetry and Remote Sensing

Volumn 59, Issue 1-2, 2004, Pages 21-34

  Estivill Castro, Vladimir ^a   Lee, Ickjai ^b  

^a GRIFFITH UNIVERSITY   (Australia)

^b JAMES COOK UNIVERSITY   (Australia)

Author keywords

association analysis; clustering; delaunay triangulation; Geographical Data Mining; large spatial databases

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; INFORMATION ANALYSIS;

CLUSTERING; SPATIAL DATABASES; SPATIAL PROXIMITY;

DATA MINING;

ALGORITHM; CLUSTER ANALYSIS; GIS; METHODOLOGY; SPATIAL DATA; TRIANGULATION;

EID: 3342918440     PISSN: 09242716     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.isprsjprs.2003.12.003     Document Type: Article

References (50)

1. Aho A., Hopcroft J., Ullman J. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley Publishing, Reading, MA
2. Ahuja N., Tuceryan M. Extraction of early perceptual structure in dot patterns: integrating region, boundary, and component gestalt. Computer Vision, Graphics, and Image Processing. 48(3):1989;304-356
3. Bezdek J. Pattern Recognition with Fuzzy Objective Function Algorithms. 1981;Plenum, New York
4. Celeux G., Govaret G. Gaussian parsimonious clustering models. Pattern Recognition. 28(5):1995;781-793
5. Cherkassky V., Muller F. Learning from Data - Concept, Theory and Methods. 1998;Wiley, New York, USA
6. Eldershaw C., Hegland M. Cluster analysis using triangulation. Noye B., Teibner M., Gill A. Proceedings of Computational Techniques with Applications CTAC97. 1997;201-208 World Scientific, Singapore
7. Ester M., Kriegel H., Sander S., Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise. Simoudis E., Han J., Fayyad U. Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96). 1996;226-231 AAAI Press, Menlo Park, CA
8. Estivill-Castro V. Hybrid genetic algorithms are better for spatial clustering. Mizoguchi R., Slaney J. Proceedings of Sixth Pacific Rim International Conference on Artificial Intelligence PRICAI 2000, Melbourne, Australia. Lecture Notes in Computer Science. vol. 1886:2000;424-434 Springer-Verlag, Heidelberg
9. Estivill-Castro V. Why so many clustering algorithms: a position paper. SIGKDD Explorations. 4(1):2002;65-75
10. Estivill-Castro V., Murray A. Discovering associations in spatial data - an efficient medoid based approach. Wu X., Kotagiri R., Korb K. Proceedings of the 2nd Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-98), Melbourne, Australia. Lecture Notes in Computer Science. vol. 1394:1998;110-121 Springer-Verlag, Heidelberg
11. Estivill-Castro V., Houle M. Robust clustering of large geo-referenced data sets. Zhong N., Zhou L. Proceedings of the 3rd Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-99). Lecture Notes in Computer Science. vol. 1574:1999;327-337 Springer-Verlag, Heidelberg
12. Estivill-Castro V., Lee I. AUTOCLUST+: automatic clustering of point - data sets in the presence of obstacles. Roddick J., Hornsby K. Proceedings of the International Workshop on Temporal, Spatial and Spatio-Temporal Data Mining - TSDM2000, in conjunction with the 4th European Conference on Principles and Practices of Knowledge Discovery and Databases, Lyon, France. Lecture Notes in Computer Science. vol. 2007:2001;133-146 Springer-Verlag, Heidelberg
13. Estivill-Castro V., Lee I. Data mining techniques for autonomous exploration of large volumes of geo-referenced crime data. Pullar D. Proceedings of the 6th International Conference on Geocomputation. 2001;University of Queensland, Brisbane. CD-ROM, ISBN 1864995637
14. Estivill-Castro V., Lee I. Argument free clustering for large spatial point-data sets. Computers, Environment and Urban Systems. 26(4):2002;315-334
15. Estivill-Castro V., Lee I. Multilevel clustering and its visualization for exploratory data analysis. GeoInformatica. 6(2):2002;123-152
16. Fraley C., Raftery A. How many clusters? Which clustering method? Answers via model-based cluster analysis. Computer Journal. 41(8):1998;578-588
17. Gold C.M. Problems with handling spatial data - the Voronoi approach. CISM Journal ACSGC. 45(1):1991;65-80
18. Gold C.M. The meaning of Neighbour. Frank A.U., Campari I., Formentini U. Theories and Methods of Spatio-Temporal Reasoning in Geographic Space. Lecture Notes in Computer Science. vol. 639:1992;220-235 Springer-Verlag, Heidelberg
19. Grabmeier J., Rudolph A. Techniques of Cluster Algorithms in Data Mining. Data Mining and Knowledge Discovery. 6(4):2002;303-360
20. Guha S., Rastogi R., Shim K. CURE: an efficient clustering algorithm for large databases. Proceedings of ACM SIGMOD International Conference on Management of Data. vol. 27:1998;73-84 ACM Press, New York
21. Hastie T., Tibshirani R., Friedman J.H. The Elements of Statistical Learning: Data Mining, Inference, and Prediction. 2001;Springer-Verlag, New York
22. Kang I.-S., Kim T.-W., Li K.-J. A spatial data mining method by Delaunay triangulation. Proceedings of the Fifth ACM Workshop on Geographic Information Systems, Las Vegas, Nevada. 1997;35-39 ACM Press, New York
23. Karypis G., Han E.-H., Kumar V. Chameleon: hierarchical clustering using dynamic modeling. IEEE Computer. 32(8):1999;68-75. (Special Issue on Data Analysis and Mining)
24. Keil M., Gutwin G. The Delaunay triangulation closely approximates the complete graph. Denhe F., Sack J.-R., Santoro N. Proceedings of the First Workshop on Algorithms and Data Structures WADS-89. Lecture Notes in Computer Science. vol. 382:1989;47-56 Springer-Verlag, Heidelberg
25. Knorr E., Ng R., Shilvock D. Finding boundary shape matching relations in spatial data. Scholl M., Voisard A. Advances in Spatial Databases, 5th International Symposium, SDD-97. Lecture Notes in Computer Science. vol. 1262:1997;29-46 Springer-Verlag, Heidelberg
26. Koperski K., Han J. Discovery of spatial association rules in geographic information databases. Egenhofer M.J., Herring J.R. Proceedings 4th International Symposium on Advances in Spatial Databases. Lecture Notes in Computer Science. vol. 951:1995;47-66 Springer-Verlag, Heidelberg
27. Kuhn H. A note on Fermat's problem. Mathematical Programming. 4(1):1973;98-107
28. Lee I., Estivill-Castro V. Effective and efficient boundary-based clustering for three-dimensional geoinformation studies. Lu H., Spaccapietra S. Proceedings of the Third International Symposium on Cooperative Database Systems for Advanced Applications CODAS, April 23-24, Beijing, China. 2001;87-96
29. Liotta, G., 1996. Low Degree Algorithm for Computing and Checking Gabriel Graphs. Technical Report 96-28, Department of Computer Science, Brown University.
30. Miller H., Han J. Geographic Data Mining and Knowledge Discovery. Research Monographs in Geographic Information Systems. 2001;Taylor and Francis, London
31. Murray A., Estivill-Castro V. Cluster discovery techniques for exploratory spatial data analysis. International Journal of Geographical Information Systems. 12(5):1998;431-443
32. Ng R., Han J. Efficient and effective clustering methods for spatial data mining. Bocca J., Jarke M., Zaniolo C. Proceedings of the 20th Conference on Very Large Data Bases (VLDB), Santiago, Chile. 1994;144-155 Morgan Kaufmann Publishers, San Mateo, CA
33. Openshaw S. Two exploratory space-time-attribute pattern analysers relevant to GIS. Fotheringham S., Rogerson P. Spatial Analysis and GIS. 1994;83-104 Taylor and Francis, London
34. Openshaw S. Geographical data mining: key design issues. Proceedings of the 4th GeoComputation 99 (on CD-ROM):1999;. At http://www.geocomputation.org/ 1999/051/gc_051.htm (accessed 12 Dec. 2003)
35. Openshaw S., Alvanides S. Applying geocomputation to the analysis of spatial distributions. Longley P.A., Goodchild M.F., Maguire D.J., Rhind D.W. Second edition Geographical Information Systems: Principles and Technical Issues. vol. 1:1999;267-282 Wiley, New York
36. Openshaw S., Charlton M., Wymer C., Craft A. A Mark 1 geographical analysis machine for the automated analysis of point data sets. International Journal of Geographical Information Systems. 1(4):1987;335-358
37. Posse, C., 1999. Hierarchical Model-Based Clustering for Large Datasets. Technical Report 363, Department of Statistics, University of Washington.
38. Rousseeuw P., Leroy A. Robust Regression and Outlier Detection. 1987;Wiley, New York, USA
39. Schikuta E., Erhart M. The BANG-clustering system: grid-based data analysis. Liu X., Cohen P., Berthold M. Proceedings of the Second International Symposium Intelligent Data Analysis IDA-97. Lecture Notes in Computer Science. vol. 1280:1997;513-524 Springer-Verlag, Heidelberg
40. Shekhar S., Huang Y. Discovering spatial co-location patterns: a summary of results. Jensen C., Schneider M., Seeger B., Tsotras V. Proceedings of the 7th International Symposium on Spatial and Temporal Databases SSTD-2001, Redondo Beach, CA. Lecture Notes in Computer Science. vol. 2121:2001;236-256 Springer-Verlag, Heidelberg
41. Son E.-J., Kang I.-S., Kim T.-W., Li K.-J. A spatial data mining method by clustering analysis. Proceedings of the Sixth International Symposium on Advances in Geographical Information Systems ACM-GIS. 1998;157-158 ACM Press, New York
42. Tsoukatos I., Gunopulos D. Efficient mining of spatiotemporal patterns. Jensen C., Schneider M., Seeger B., Tsotras V. Proceedings of the 7th International Symposium on Spatial and Temporal Databases SSTD-2001, Redondo Beach, CA. Lecture Notes in Computer Science. vol. 2121:2001;425-442 Springer-Verlag, Heidelberg
43. Tung A., Hou J., Han J. COE: clustering with obstacles entities: a preliminary study. Terano T., Liu H., Chen A. Proceedings of the 4th Pacific-Asia conference on Knowledge Discovery and Data Mining, Kyoto, Japan. Lecture Notes in Computer Science. vol. 1805:2000;165-168 Springer-Verlag, Heidelberg
44. Tung A.K.H., Hou J., Han J. Spatial clustering in the presence of obstacles. Proceedings of the International Conference on Data Engineering. 2001;359-367 IEEE Computer Society, Los Alamitos, CA
45. Veloso M., Stone P., Han K. CMUnited-97: RoboCup-97 small-robot world champion team. AI Magazine. 19(3):1998;61-69
46. Wang W., Yang J., Muntz R. STING: a statistical information grid approach to spatial data mining. Jarke M. Proceedings of the 23rd International Conference on Very Large Data Bases, Athens, Greece. 1997;186-195 Morgan Kaufmann Publishers, San Mateo, CA
47. Wang W., Yang J., Muntz R. STING+: an approach to active spatial data mining. Kitsuregawa M., Maciaszek L., Papazoglou K., Pu C. Proceedings of the Fifteenth International Conference on Data Engineering, Sydney, Australia. 1999;116-125 IEEE Computer Society, Los Alamitos, CA
48. Witten I., Frank E. Data Mining - Practical Machine Learning Tools and Technologies with JAVA Implementations. 2000;Morgan Kaufmann Publishers, San Mateo, CA
49. Zahn C. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers. 20(1):1971;68-86
50. Zhang T., Ramakrishnan R., Livny M. BIRCH: an efficient data clustering method for very large databases. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data. SIGMOD Record. vol. 25 (2):1996;103-114