Discovering spatial patterns accurately with effective noise removal

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2004, Pages 43-50

  Qian, Yu ^a   Zhang, Kang ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

clustering; data mining; noise removal; pattern discovery

Indexed keywords

BENCHMARK DATA; CLUSTERING DATA; CLUSTERING TECHNIQUES; DATA POINTS; DATA SETS; DOMAIN SPECIFIC; EXPERIMENTAL STUDIES; HIER-ARCHICAL CLUSTERING; NATURAL CLUSTERS; NOISE REMOVAL; PATTERN DISCOVERY; REAL IMAGES; SPATIAL DATABASE; SPATIAL PATTERNS;

DATA MINING; DATA VISUALIZATION; VISUALIZATION;

CLUSTER ANALYSIS;

EID: 33644548445     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1008694.1008701     Document Type: Conference Paper

References (13)

1. Ankerst, M., Breunig, M., Kriegel, H. P., and Sander, J. (1999). OPTICS: Ordering Points To Identify the Clustering Structure. Proc. 1999 ACM-SIGMOD Conf. on Management of Data (SIGMOD'99), pp. 49-60.
2. Batagelj, V., Mrvar, A., and Zaversnik, M. (2000). Partitioning approaches to clustering in graphs, Proc. Graph Drawing'1999, LNCS, pp. 90-97.
3. Ertoz, L., Steinbach, M., and Kumar, V. (2003), Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data, In Proc. of SIAM DM'03.
4. Ester, M., Kriegel, H. P., Sander, J., and Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining (KDD-96), AAAI Press, pp. 226-231.
5. Han, J., Kamber, M., and Tung, A. K. H. (2001). Spatial clustering methods in data mining: A survey, H. Miller and J. Han (eds.), Geographic Data Mining and Knowledge Discovery, Taylor and Francis.
6. th Int'l Conf. Knowledge Discovery and Data Mining (KDD-2001), ACM Press, New York, pp. 281-286.
7. Jain, A. K., and Dubes, R. C. (1988). Algorithms for Clustering Data, Prentice-Hall advanced reference series. Prentice-Hall, Inc., Upper Saddle River, NJ.
8. Karypis, G., Han, E., and Kumar, V. (1999). CHAMELEON, A hierarchical clustering algorithm using dynamic modeling, IEEE Computer, Vol.32, pp. 68-75.
9. McQueen, J. (1967). Some methods for classification and analysis of multivariate observations, Proc. of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 281-297.
10. Qian, Y., Zhang, G., and Zhang, K. (2004) FACADE: A Fast and Effective Approach to the Discovery of Dense Clusters in Noisy Spatial Data, In Proc. ACM SIGMOD 2004 Conference, Paris, France, 13-18 June 2004, ACM Press. (Demo Abstract)
11. Qian, Y. and Zhang, K. (2004) GraphZip: a fast and automatic compression method for spatial data clustering. In Proc. of the 2004 ACM Symposium on Applied Computing (SAC'04), pp. 571-575.
12. Seidman, S. B. (1983). Network structure and minimum degree. Social Networks, 5, pp. 269-287.
13. http://www.cs.umn.edu/~ertoz/snn/