Data clustering with partial supervision

This source preferred by Hamid Bouchachia

This data was imported from DBLP:

Authors: Bouchachia, A. and Pedrycz, W.

Journal: Data Min. Knowl. Discov.

Volume: 12

Pages: 47-78

DOI: 10.1007/s10618-005-0019-1

This data was imported from Scopus:

Authors: Bouchachia, A. and Pedrycz, W.

Journal: Data Mining and Knowledge Discovery

Volume: 12

Issue: 1

Pages: 47-78

ISSN: 1384-5810

DOI: 10.1007/s10618-005-0019-1

Clustering with partial supervision finds its application in situations where data is neither entirely nor accurately labeled. This paper discusses a semi-supervised clustering algorithm based on a modified version of the fuzzy C-Means (FCM) algorithm. The objective function of the proposed algorithm consists of two components. The first concerns traditional unsupervised clustering while the second tracks 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. Comprehensive experimental studies are presented. First, the discrimination of the proposed algorithm is discussed before its reformulation as a classifier is addressed. The induced classifier is evaluated on completely labeled data and validated by comparison against some fully supervised classifiers, namely support vector machines and neural networks. This classifier is then evaluated and compared against three semi-supervised algorithms in the context of learning from partly labeled data. In addition, the behavior of the algorithm is discussed and the relation between classes and clusters is investigated using a linear regression model. Finally, the complexity of the algorithm is briefly discussed. © 2005 Springer Science+Business Media, Inc.

The data on this page was last updated at 04:42 on November 17, 2017.