A semi-supervised clustering algorithm for data exploration

  • Authors:
  • Abdelhamid Bouchachia;Witold Pedrycz

  • Affiliations:
  • University of Klagenfurt, Dept. of Informatics-Systems, Klagenfurt, Austria;Dept. Electrical and Computer Engineering, University of Alberta, Edmonton, Canada

  • Venue:
  • IFSA'03 Proceedings of the 10th international fuzzy systems association World Congress conference on Fuzzy sets and systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper is concerned with clustering of data that is partly labelled. It discusses a semi-supervised clustering algorithm based on a modified fuzzy C-Means (FCM) objective function. Semi-supervised clustering finds its application in different situations where data is neither entirely nor accurately labelled. The novelty of this approach is the fact that it takes into consideration the structure of the data and the available knowledge (labels) of patterns. The objective function consists of two components. The first concerns the unsupervised clustering while the second keeps the relationship between classes (available labels) and the clusters generated by the first component. The balance between the two components is tuned by a scaling factor. The algorithm is experimentally evaluated.