arXiv Analytics

Sign in

arXiv:1901.09178 [cs.LG]AbstractReferencesReviewsResources

A general model for plane-based clustering with loss function

Zhen Wang, Yuan-Hai Shao, Lan Bai, Chun-Na Li, Li-Ming Liu

Published 2019-01-26Version 1

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 the samples. Thereinto, the loss of a sample derives from both within-cluster and between-cluster. In theory, the termination conditions are discussed, and we prove that the general model terminates in a finite number of steps at a local or weak local optimal point. Furthermore, based on this general model, we propose a plane-based clustering method by introducing a new loss function to capture the data distribution precisely. Experimental results on artificial and public available datasets verify the effectiveness of the proposed method.

Related articles: Most relevant | Search more
arXiv:1903.02893 [cs.LG] (Published 2019-03-07)
Only sparsity based loss function for learning representations
arXiv:2103.01400 [cs.LG] (Published 2021-03-02)
Smoothness Analysis of Loss Functions of Adversarial Training
arXiv:2006.04751 [cs.LG] (Published 2020-06-08)
The Golden Ratio of Learning and Momentum