IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v633y2024ics0378437123009603.html
   My bibliography  Save this article

Multi-view K-means clustering algorithm based on redundant and sparse feature learning

Author

Listed:
  • Kong, Guoping
  • Ma, Yingcang
  • Xing, Zhiwei
  • Xin, Xiaolong

Abstract

In recent years, multi-view clustering has been widely concerned and studied. Being its data generally has high dimension and noise, how to effectively deal with redundant features in data from various views and improve the clustering effect is an important issue in multi-view clustering. In this paper, a robust multi-view clustering algorithm Multi-view K-means clustering algorithm based on redundant and sparse feature learning (RSFMVKM) considering redundancy and sparse feature learning is proposed, which can effectively reduce the dimensions of data from different views. Firstly, the K-means algorithm is extended to multi-view clustering, and the importance of each views is represented by learning the weight of each view. Secondly, the sparse feature representation is obtained by applying the norm constraint to the projection matrix in a single view, and the cosine similarity is used to depict the redundancy matrix, which can remove the redundant information and improve the clustering effect. Moreover, the proposed algorithm can effectively avoid the generation of empty classes, and the clustering index matrix is discrete, so the clustering results can be obtained directly. Finally, the proposed algorithm is compared with six state-of-the-art multi-view clustering algorithms on six public datasets, and the experimental results show that the algorithm is effective.

Suggested Citation

  • Kong, Guoping & Ma, Yingcang & Xing, Zhiwei & Xin, Xiaolong, 2024. "Multi-view K-means clustering algorithm based on redundant and sparse feature learning," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 633(C).
  • Handle: RePEc:eee:phsmap:v:633:y:2024:i:c:s0378437123009603
    DOI: 10.1016/j.physa.2023.129405
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437123009603
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2023.129405?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:633:y:2024:i:c:s0378437123009603. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.