Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

k-Proximal plane clustering

k-Proximal plane clustering Instead of clustering data points to cluster center points in k-means, k-plane clustering (kPC) clusters data points to the center planes. However, kPC only concerns on within-cluster data points. In this paper, we propose a novel plane-based clustering, called k-proximal plane clustering (kPPC). In kPPC, each center plane is not only close to the objective data points but also far away from the others by solving several eigenvalue problems. The objective function of our kPPC comprises the information from between- and within-clusters data points. In addition, our kPPC is extended to nonlinear case by kernel trick. A determinative strategy using a Laplace graph to initialize data points is established in our kPPC. The experiments conducted on several artificial and benchmark datasets show that the performance of our kPPC is much better than both kPC and k-means. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Machine Learning and Cybernetics Springer Journals

Loading next page...
1
 
/lp/springer_journal/k-proximal-plane-clustering-vGb4NuHtNc

References (63)

Publisher
Springer Journals
Copyright
Copyright © 2016 by Springer-Verlag Berlin Heidelberg
Subject
Engineering; Computational Intelligence; Artificial Intelligence (incl. Robotics); Control, Robotics, Mechatronics; Complex Systems; Systems Biology; Pattern Recognition
ISSN
1868-8071
eISSN
1868-808X
DOI
10.1007/s13042-016-0526-y
Publisher site
See Article on Publisher Site

Abstract

Instead of clustering data points to cluster center points in k-means, k-plane clustering (kPC) clusters data points to the center planes. However, kPC only concerns on within-cluster data points. In this paper, we propose a novel plane-based clustering, called k-proximal plane clustering (kPPC). In kPPC, each center plane is not only close to the objective data points but also far away from the others by solving several eigenvalue problems. The objective function of our kPPC comprises the information from between- and within-clusters data points. In addition, our kPPC is extended to nonlinear case by kernel trick. A determinative strategy using a Laplace graph to initialize data points is established in our kPPC. The experiments conducted on several artificial and benchmark datasets show that the performance of our kPPC is much better than both kPC and k-means.

Journal

International Journal of Machine Learning and CyberneticsSpringer Journals

Published: Apr 13, 2016

There are no references for this article.