A fast clustering algorithm for data with a few labeled instances

0Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

The diameter of a cluster is the maximum intracluster distance between pairs of instances within the same cluster, and the split of a cluster is the minimum distance between instances within the cluster and instances outside the cluster. Given a few labeled instances, this paper includes two aspects. First, we present a simple and fast clustering algorithm with the following property: if the ratio of the minimum split to the maximum diameter (RSD) of the optimal solution is greater than one, the algorithm returns optimal solutions for three clustering criteria. Second, we study the metric learning problem: learn a distance metric to make the RSD as large as possible. Compared with existing metric learning algorithms, one of our metric learning algorithms is computationally efficient: it is a linear programming model rather than a semidefinite programming model used by most of existing algorithms. We demonstrate empirically that the supervision and the learned metric can improve the clustering quality.

Cite

CITATION STYLE

APA

Yang, J., Xiao, Y., Wang, J., Ma, Q., & Shen, Y. (2015). A fast clustering algorithm for data with a few labeled instances. Computational Intelligence and Neuroscience, 2015. https://doi.org/10.1155/2015/196098

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