Fast single-link clustering method based on tolerance rough set model

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

Volumn 5908 LNAI, Issue , 2009, Pages 414-422

  Patra, Bidyut Kr ^a   Nandi, Sukumar ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING METHODS; CLUSTERING QUALITY; CLUSTERING RESULTS; DATA SETS; DATABASE SCANS; LARGE DATASETS; REAL-WORLD DATASETS; ROUGH SET MODELS; SPEED-UPS; TOLERANCE ROUGH SET THEORY;

CLUSTERING ALGORITHMS; FUZZY SETS; GRANULAR COMPUTING;

ROUGH SET THEORY;

EID: 76649088376     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10646-0_50     Document Type: Conference Paper

References (14)

1. Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys 31, 264-323 (1999)
2. Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: Optics: Ordering points to identify the clustering structure. SIGMOD Rec. 28, 49-60 (1999)
3. Sneath, A., Sokal, P.H.: Numerical Taxonomy. Freeman, London (1973)
4. Pawlak, Z.: Rough sets. Int.J. of Computer and Information Sc. 11, 341-356 (1982)
5. Lin, T.Y., Cercone, N. (eds.): Rough Sets and Data Mining: Analysis of Imprecise Data. Kluwer Academic Publishers, Norwell (1996)
6. Zhou, J., Sander, J.: Data bubbles for non-vector data: speeding-up hierarchical clustering in arbitrary metric spaces. In: VLDB 2003, pp. 452-463 (2003)
7. Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae 27, 245-253 (1996)
8. Slowinski, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Trans. on Knowl. and Data Eng. 12, 331-336 (2000)
9. Hartigan, J.A.: Clustering Algorithms. John Wiley & Sons, Inc., New York (1975)
10. Zhang, T., Ramakrishnan, R., Livny, M.: Birch: An efficient data clustering method for very large databases. In: ACM SIGMOD Conference, pp. 103-114 (1996)
11. Breunig, M.M., Kriegel, H.P., Sander, J.: Fast hierarchical clustering based on compressed data and optics. In: Zighed, D.A., Komorowski, J., Žytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.1910, pp. 232-242. Springer, Heidelberg (2000)
12. Ho, T.B., Nguyen, N.B.: Nonhierarchical document clustering based on a tolerance rough set model. Int. J. Intell. Syst. 17, 199-212 (2002)
13. Kumar, P., Krishna, P.R., Bapi, R.S., De, S.K.: Rough clustering of sequential data. Data Knowl. Eng. 63, 183-199 (2007)
14. Rand, W.M.: Objective Criteria for Evaluation of Clustering Methods. J. of American Statistical Association 66, 846-850 (1971)