Sparse probabilistic K-means

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 19
  • Download : 0
The goal of clustering is to partition a set of data points into groups of similar data points, called clusters. Clustering algorithms can be classified into two categories: hard and soft clustering. Hard clustering assigns each data point to one cluster exclusively. On the other hand, soft clustering allows probabilistic assignments to clusters. In this paper, we propose a new model which combines the benefits of these two models: clarity of hard clustering and probabilistic assignments of soft clustering. Since the majority of data usually have a clear association, only a few points may require a probabilistic interpretation. Thus, we apply the l(1) norm constraint to impose sparsity on probabilistic assignments. Moreover, we also incorporate outlier detection in our clustering model to simultaneously detect outliers which can cause serious problems in statistical analyses. To optimize the model, we introduce an alternating minimization method and prove its convergence. Numerical experiments and comparisons with existing models show the soundness and effectiveness of the proposed model.
Publisher
ELSEVIER SCIENCE INC
Issue Date
2020-10
Language
English
Article Type
Article
Citation

APPLIED MATHEMATICS AND COMPUTATION, v.382

ISSN
0096-3003
DOI
10.1016/j.amc.2020.125328
URI
http://hdl.handle.net/10203/276958
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0