Some refinements of rough k-means clustering

  • Authors:
  • Georg Peters

  • Affiliations:
  • Department of Computer Science/Mathematics, Munich University of Applied Sciences, Lothstrasse 34, 80335 Munich, Germany

  • Venue:
  • Pattern Recognition
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

Lingras et al. proposed a rough cluster algorithm and successfully applied it to web mining. In this paper we analyze their algorithm with respect to its objective function, numerical stability, the stability of the clusters and others. Based on this analysis a refined rough cluster algorithm is presented. The refined algorithm is applied to synthetic, forest and microarray gene expression data.