Conference ProceedingsOPEN ACCESS

Collaborative rough clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3776 LNCS 768-773
DOI: 10.1007/11590316_124
4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A novel collaborative clustering is proposed through the use of rough sets. The Davies-Bouldin clustering validity index is extended to the rough framework, to generate the optimal number of clusters during collaboration. © Springer-Verlag Berlin Heidelberg 2005.

Author supplied keywords

Cite

CITATION STYLE

APA

Mitra, S., Banka, H., & Pedrycz, W. (2005). Collaborative rough clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3776 LNCS, pp. 768–773). https://doi.org/10.1007/11590316_124

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free