DENCLUE-M: Boosting DENCLUE algorithm by mean approximation on grids

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

Volumn 2762, Issue , 2003, Pages 202-213

  Li, Cunhua ^a,b   Sun, Zhihui ^a   Song, Yuqing ^a  

^a SOUTHEAST UNIVERSITY   (China)

^b HUAIHAI INSTITUTE OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; DATA MINING; INFORMATION MANAGEMENT;

CLOSE PROXIMITY; DATA MINING APPLICATIONS; DENSITY-BASED ALGORITHM; GRID PARTITION; LARGE AMOUNTS; MEMORY USAGE; ORIGINAL ALGORITHMS;

CLUSTERING ALGORITHMS;

EID: 33845908041     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45160-0_20     Document Type: Article

References (9)

1. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 335-398 (2000)
2. Jain, A. K., Murty, M. N., Flynn, P. J.: Data Clustering: A Review. ACM Computing Surveys, 31(3), (1999) 264-323
3. th VLDB Conf., Edinburgh, Scotland (1999)
4. th VLDB Conf., (1998) 428-439, New York
5. Aggrawal, R., Gehrke, J., Raghawan, D. P.: Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. In Proc. ACM SIGMOD Int. Conf. On Management of Data, Seattle, WA, (1998) 94-105
6. rd VLDB Conf., Athens, Greece, (1998) 186-195
7. Hinneburg, A., Keim, D.A.: An efficient approach to clustering in large multimedia databases with noise. In Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining (KDD'98), New York, (1998) 58-65
8. Scott, D.: Multivariate Density Estimation. Wiley and Sons (1992)
9. Berchtold, S., Keim, D., Kriegel, H.P.: The X-tree: An Index Structure for High- Dimensional Data. In Proc. Int. Conf. on Very Large Databases, (1996) 28-39