Skip to Main content Skip to Navigation
Conference papers

On the Number of Clusters in Block Clustering Algorithms

Abstract : One of the major problems in clustering is the need of specifying the optimal number of clusters in some clustering algorithms. Some block clustering algorithms suffer from the same limitation that the number of clusters needs to be specified by a human user. This problem has been subject of wide research. Numerous indices were proposed in order to find reasonable number of clusters. In this paper, we aim to extend the use of these indices to block clustering algorithms. Therefore, an examination of some indices for determining the number of clusters in CROKI2 algorithm is conducted on synthetic data sets. The purpose of the paper is to test the performance and ability of some indices to detect the proper number of clusters on rows and columns partitions obtained by a block clustering algorithm.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01125839
Contributor : Laboratoire Cedric <>
Submitted on : Sunday, March 22, 2020 - 7:47:40 PM
Last modification on : Tuesday, March 24, 2020 - 2:07:00 PM

File

art_2048.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01125839, version 1

Collections

Citation

Malika Charrad, Yves Lechevallier, Mohamed Ben Ahmed, Gilbert Saporta. On the Number of Clusters in Block Clustering Algorithms. 23rd International FLAIRS Conference, May 2010, Florida, United States. pp.392-397. ⟨hal-01125839⟩

Share

Metrics

Record views

73

Files downloads

10