• Corpus ID: 59316756

A general model for plane-based clustering with loss function

  title={A general model for plane-based clustering with loss function},
  author={Zhen Wang and Yuan-Hai Shao and Lan Bai and Chunna Li and Li-Ming Liu},
In this paper, we propose a general model for plane-based clustering. The general model contains many existing plane-based clustering methods, e.g., k-plane clustering (kPC), proximal plane clustering (PPC), twin support vector clustering (TWSVC) and its extensions. Under this general model, one may obtain an appropriate clustering method for specific purpose. The general model is a procedure corresponding to an optimization problem, where the optimization problem minimizes the total loss of… 
Robust k-subspace discriminant clustering
By introducing the L1-norm discriminant and local information to each subspace, k SDC realizes robust dimensionality reduction and clustering, and its optimization problems can be solved through an effective alternating direction method of multipliers.
Pinball Loss Twin Support Vector Clustering
Twin Support Vector Clustering (TWSVC) is a clustering algorithm inspired by the principles of Twin Support Vector Machine (TWSVM). TWSVC has already outperformed other traditional plane based
Comprehensive Review On Twin Support Vector Machines
This review presents a rigorous analysis of recent research in TWSVM and TSVR simultaneously mentioning their limitations and advantages.
Multiple Flat Projections for Cross-manifold Clustering
This article proposes multiple flat projections clustering (MFPC) for cross-manifold clustering, a series of nonconvex matrix optimization problems is solved by a proposed recursive algorithm and a nonlinear version of MFPC is extended via kernel tricks to deal with a more complex cross- manifold learning situation.


Ramp-based twin support vector clustering
The ramp functions are introduced into plane-based clustering and a ramp-based twin support vector clustering (RampTWSVC) is proposed, which is very robust to the samples far from the cluster center, because its within-clusters and between-cluster scatters are measured by the bounded ramp functions.
Local k-proximal plane clustering
A local k-proximal plane clustering (LkPPC) is proposed 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.
Discriminative Embedded Clustering: A Framework for Grouping High-Dimensional Data
A novel framework referred to as discriminative embedded clustering which alternates them iteratively is proposed which outperforms related state-of-the-art clustering approaches and existing joint dimensionality reduction and clustering methods.
Proximal Plane Clustering via Eigenvalues
This paper proposes a proximal plane clustering, which the clustering plane in k-plane clustering is improved to be such a plane that is closer to the objective data points and far away from the others, which leads to solve the eigenvalue problems.
k-Proximal plane clustering
A novel plane-based clustering, called k-proximal plane clustering (kPPC), where each center plane is not only close to the objective data points but also far away from the others by solving several eigenvalue problems.
Robust Subspace Clustering by Cauchy Loss Function
This paper proposes a subspace clustering method based on Cauchy loss function (CLF) that uses CLF to penalize the noise term for suppressing the large noise mixed in the real data and theoretically proves the grouping effect, which means that highly correlated data can be grouped together.
Extensions of Kmeans-Type Algorithms: A New Clustering Framework by Integrating Intracluster Compactness and Intercluster Separation
Experimental studies demonstrate that the proposed algorithms outperform the state-of-the-art kmeans-type clustering algorithms with respect to four metrics: accuracy, RandIndex, Fscore, and normal mutual information.
k-Plane Clustering
A finite new algorithm is proposed for clustering m given points in n-dimensional real space into k clusters by generating k planes that constitute a local solution to the nonconvex problem of
Kernel k-means: spectral clustering and normalized cuts
The generality of the weighted kernel k-means objective function is shown, and the spectral clustering objective of normalized cut is derived as a special case, leading to a novel weightedkernel k-Means algorithm that monotonically decreases the normalized cut.
Fuzzy least squares twin support vector clustering
The experimental results show that the proposed fuzzy least squares twin support vector clustering (F-LS-TWSVC) achieves comparable clustering accuracy to that of TWSVC with comparatively lesser computational time.