2013
DOI: 10.3233/ida-130618
|View full text |Cite
|
Sign up to set email alerts
|

Enhancing K-Means using class labels

Abstract: Clustering is a relevant problem in machine learning where the main goal is to locate meaningful partitions of unlabeled data. In the case of labeled data, a related problem is supervised clustering, where the objective is to locate classuniform clusters. Most current approaches to supervised clustering optimize a score related to cluster purity with respect to class labels. In particular, we present Labeled K-Means (LK-Means), an algorithm for supervised clustering based on a variant of K-Means that incorpora… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 26 publications
(19 reference statements)
0
3
0
Order By: Relevance
“…All the collected ERPs are first divided into four groups according to the category of the corresponding emergencies, i.e., natural disasters, accident disasters, public health incidents, and social security incidents. Then, we apply an enhanced k-Means clustering algorithm [27] to each group of ERPs to derive a more fine-grained category of ERPs. Finally, 33 clusters are obtained, each taken as the category label of ERPs.…”
Section: ) Web Crawlingmentioning
confidence: 99%
“…All the collected ERPs are first divided into four groups according to the category of the corresponding emergencies, i.e., natural disasters, accident disasters, public health incidents, and social security incidents. Then, we apply an enhanced k-Means clustering algorithm [27] to each group of ERPs to derive a more fine-grained category of ERPs. Finally, 33 clusters are obtained, each taken as the category label of ERPs.…”
Section: ) Web Crawlingmentioning
confidence: 99%
“…These techniques (SSSKMIV, SSSKMCSQ, SSSKMIV SSE ) have some similarities with the k-means semi-supervised segmentation algorithm, proposed in Peralta et al 19 which is called LK-Means. This methodology has many similarities to SSS techniques, but also has a number of clear differences.…”
Section: Variationmentioning
confidence: 99%
“…Other efforts do not estimate probability densities at all, such as "supervised clustering" (Eick et al, 2004). Many applications of this paradigm exist (Finley and Joachims, 2005;Al-Harbi and Rayward-Smith, 2006;DiCicco and Patel, 2010;Peralta et al, 2013;Ramani and Jacob, 2013;Grbovic et al, 2013;Peralta et al, 2016;Flammarion et al, 2016;Ismaili et al, 2016;Yoon et al, 2016;Dhurandhar et al, 2017).…”
Section: Case Study: Prediction-constrained Mixture Modelsmentioning
confidence: 99%