Creating polygon models for spatial clusters

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

Volumn 8502 LNAI, Issue , 2014, Pages 493-499

  Akdag, Fatih ^a   Eick, Christoph F ^a   Chen, Guoning ^a  

^a University of Houston   (United States)

Author keywords

Polygon Emptiness Measure; Polygon Fitness Function; Polygon Models for Point Sets; Spatial Clustering; Spatial data mining

Indexed keywords

HEALTH; INTELLIGENT SYSTEMS;

FITNESS FUNCTIONS; POINT SET; POLYGON EMPTINESS MEASURE; SPATIAL CLUSTERING; SPATIAL DATA MINING;

GEOMETRY;

EID: 84903648217     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-08326-1_50     Document Type: Conference Paper

References (10)

1. Cao, Z., Wang, S., Forestier, G., Puissant, A., Eick, C.F.: Analyzing the Composition of Cities Using Spatial Clustering. In: Proc. 2nd ACM SIGKDD International Workshop on Urban Computing, Chicago, Illinois (2013)
2. Wang, S., Chen, C.S., Rinsurongkawong, V., Akdag, F., Eick, C.F.: A Polygon-based Methodology for Mining Related Spatial Datasets. In: Proc. of ACM SIGSPATIAL International Workshop on Data Mining for Geoinformatics (DMG), San Jose (2010)
3. Galton, A., Duckham, M.: What is the region occupied by a set of points? In: Raubal, M., Miller, H.J., Frank, A.U., Goodchild, M.F. (eds.) GIScience 2006. LNCS, vol. 4197, pp. 81-98. Springer, Heidelberg (2006) (Pubitemid 44609884)
4. Duckham, M., Kulik, L., Worboys, M., Galton, A.: Efficient generation of simple polygons for characterizing the shape of a set of points in the plane. Pattern Recognition 41, 3224-3236 (2008)
5. Edelsbrunner, H., Kirkpatrick, D.G., Seidel, R.: On the shape of a set of points in the plane. IEEE Transactions on Information Theory 29, 551-559 (1983)
6. Chaudhuri, A.R., Chaudhuri, B.B., Parui, S.K.: A novel approach to computation of the shape of a dot pattern and extraction of its perceptual border. Computer Vision and Image Understanding 68, 57-275 (1997)
7. Moreira, A., Santos, M.Y.: Concave hull: a k-nearest neighbours approach for the computation of the region occupied by a set of points. In: International Conference on Computer Graphics Theory and Applications GRAPP (2007)
8. Chen, C.S., Rinsurongkawong, V., Eick, C.F., Twa, M.D.: Change Analysis in Spatial Data by Combining Contouring Algorithms with Supervised Density Functions. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS, vol. 5476, pp. 907-914. Springer, Heidelberg (2009)
9. Brinkhoff, T., Kriegel, H.-P., Schneider, R., Braun, A.: Measuring the Complexity of Polygonal Objects. In: Proc. of the Third ACM International Workshop on Advances in Geographical Information Systems, pp. 109-117 (1995)
10. Salvador, S., Chan, P.: Determining the Number of Clusters/Segments in Hierarchical clustering/Segmentation Algorithm. In: ICTAI, pp. 576-584 (2004)