Back to Search
Start Over
Semi-supervised clustering methods
- Source :
- WIREs Comp Stat, 2013, 5(5): 349-361
- Publication Year :
- 2013
-
Abstract
- Cluster analysis methods seek to partition a data set into homogeneous subgroups. It is useful in a wide variety of applications, including document processing and modern genetics. Conventional clustering methods are unsupervised, meaning that there is no outcome variable nor is anything known about the relationship between the observations in the data set. In many situations, however, information about the clusters is available in addition to the values of the features. For example, the cluster labels of some observations may be known, or certain observations may be known to belong to the same cluster. In other cases, one may wish to identify clusters that are associated with a particular outcome variable. This review describes several clustering algorithms (known as "semi-supervised clustering" methods) that can be applied in these situations. The majority of these methods are modifications of the popular k-means clustering method, and several of them will be described in detail. A brief description of some other semi-supervised clustering algorithms is also provided.<br />Comment: 28 pages, 5 figures
- Subjects :
- Statistics - Methodology
Computer Science - Learning
Statistics - Machine Learning
Subjects
Details
- Database :
- arXiv
- Journal :
- WIREs Comp Stat, 2013, 5(5): 349-361
- Publication Type :
- Report
- Accession number :
- edsarx.1307.0252
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.1002/wics.1270