A clustering technique using density difference

Proceedings of ICSCN 2007: International Conference on Signal Processing Communications and Networking

Volumn , Issue , 2007, Pages 585-588

  Borah, B ^a   Bhattacharyya, D K ^b  

^a TEZPUR UNIVERSITY   (India)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; SPURIOUS SIGNAL NOISE;

CLUSTER LOCAL DENSITY; NEIGHBORHOOD SIZES;

SIGNAL PROCESSING;

EID: 34548178307     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSCN.2007.350675     Document Type: Conference Paper

References (7)

1. Jain A.K., Murty M.N., Flyn, P.J. (1999), "Data Clustering: A Review", ACM Computing Surveys, Vol.31, No3.
2. Ester, M., Kriegel, H.-P., Sander, J., and Xu X. (1996), A density-based algorithm for discovering clusters in large spatial data sets with noise. Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining. Portland, OR, pp.226-231.
3. Guha, S., Rastogi, R., Shim K. (1998), "CURE: An Efficient Clustering Algorithm for Large Data sets", Published in the Proceedings of the ACM SIGMOD Conference.
4. Xu X., Ester M., Kriegel H.-P., Sander J. (1998), A Nonparametric Clustering Algorithm for Knowledge Discovery in Large Spatial Data sets, Proc. IEEE Int. Conf. on Data Engineering, IEEE Computer Society Press, 1998.
5. Karypis G., Han E. H. and Kumar V. (1999), CHAMELEON: A hierarchical clustering algorithm using dynamic modeling, Computer 32(8): 68-75, 1999.
6. Ankerst M., Breunig M., Kriegel H., Sander J., OPTICS: Ordering Points to Identify the Clustering Structure, Proc. ACM SIGMOD'99 Int. Conf. on Management of Data.
7. http://www.glaros.dtc.umn.edu/gkhome/cluto/cluto/download