Neural Computing and Applications

, Volume 26, Issue 1, pp 199–211

Local k-proximal plane clustering

  • Zhi-Min Yang
  • Yan-Ru Guo
  • Chun-Na Li
  • Yuan-Hai Shao
Original Article

DOI: 10.1007/s00521-014-1707-9

Cite this article as:
Yang, ZM., Guo, YR., Li, CN. et al. Neural Comput & Applic (2015) 26: 199. doi:10.1007/s00521-014-1707-9

Abstract

k-Plane clustering (kPC) and k-proximal plane clustering (kPPC) cluster data points to the center plane, instead of clustering data points to cluster center in k-means. However, the cluster center plane constructed by kPC and kPPC is infinitely extending, which will affect the clustering performance. In this paper, we propose a local k-proximal plane clustering (LkPPC) by bringing k-means into kPPC which will force the data points to center around some prototypes and thus localize the representations of the cluster center plane. The contributions of our LkPPC are as follows: (1) LkPPC introduces localized representation of each cluster center plane to avoid the infinitely confusion. (2) Different from kPPC, our LkPPC constructs cluster center plane that makes the data points of the same cluster close to both the same center plane and the prototype, and meanwhile far away from the other clusters to some extent, which leads to solve eigenvalue problems. (3) Instead of randomly selecting the initial data points, a Laplace graph strategy is established to initialize the data points. (4) The experimental results on several artificial datasets and benchmark datasets show the effectiveness of our LkPPC.

Keywords

k-Plane clusteringk-Proximal plane clusteringk-MeansEigenvalue problemLaplace graph

Copyright information

© The Natural Computing Applications Forum 2014

Authors and Affiliations

  • Zhi-Min Yang
    • 1
  • Yan-Ru Guo
    • 2
  • Chun-Na Li
    • 1
  • Yuan-Hai Shao
    • 1
  1. 1.Zhijiang CollegeZhejiang University of TechnologyHangzhouPeople’s Republic of China
  2. 2.College of ScienceZhejiang University of TechnologyHangzhouPeople’s Republic of China