A survey of constrained clustering

23Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Traditional data mining methods for clustering only use unlabeled data objects as input. The aim of such methods is to find a partition of these unlabeled data objects in order to discover the underlying structure of the data. In some cases, there may be some prior knowledge about the data in the form of (a few number of) labels or constraints. Performing traditional clustering methods by ignoring the prior knowledge may result in extracting irrelevant information for the user. Constrained clustering, i.e., clustering with side information or semi-supervised clustering, addresses this problem by incorporating prior knowledge into the clustering process to discover relevant information from the data. In this chapter, a survey of advances in the area of constrained clustering will be presented. Different types of prior knowledge considered in the literature, and clustering approaches that make use of this prior knowledge will be reviewed.

Cite

CITATION STYLE

APA

Dinler, D., & Tural, M. K. (2016). A survey of constrained clustering. In Unsupervised Learning Algorithms (pp. 207–235). Springer International Publishing. https://doi.org/10.1007/978-3-319-24211-8_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free