Data Clustering with Partial Supervision

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 algorith...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Data mining and knowledge discovery Ročník 12; číslo 1; s. 47 - 78
Hlavní autoři: BOUCHACHIA, ABDELHAMID, PEDRYCZ, WITOLD
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.01.2006
Témata:
Algorithms
Classification
Clustering
Data mining
Genetic algorithms
Knowledge discovery
Regression analysis
Supervision
Support vector machines
ISSN:1384-5810, 1573-756X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:1384-5810
1573-756X
DOI:10.1007/s10618-005-0019-1