Self-weighting multi-view spectral clustering based on nuclear norm

作者:

Highlights:

• In order to implement clustering task, the proposed approach fully utilizes multiple view features to learn a consensus representation. Specifically, it makes the common consensus representation be close to each view initial affinity matrix as much as possible. Moreover, to capture principal components of different views, the nuclear norm is applied to the learned consensus representation.

• Considering that each view feature is inclined to explore specific properties, therefore, the proposed method assigns different weight for each view feature in the form of exponential flatten.

• An efficient alternative iteration algorithm is exploited to solve the proposed optimization problem. In addition, extensive experiments are conducted on four multi-view data sets without noises and one multi-view data set with“salt and pepper” noises to demonstrate the superiority of proposed SMSC_NN method.

摘要

•In order to implement clustering task, the proposed approach fully utilizes multiple view features to learn a consensus representation. Specifically, it makes the common consensus representation be close to each view initial affinity matrix as much as possible. Moreover, to capture principal components of different views, the nuclear norm is applied to the learned consensus representation.•Considering that each view feature is inclined to explore specific properties, therefore, the proposed method assigns different weight for each view feature in the form of exponential flatten.•An efficient alternative iteration algorithm is exploited to solve the proposed optimization problem. In addition, extensive experiments are conducted on four multi-view data sets without noises and one multi-view data set with“salt and pepper” noises to demonstrate the superiority of proposed SMSC_NN method.

论文关键词:Unsupervised learning,Multi-view clustering,Nuclear norm,Self-weighting

论文评审过程:Received 6 December 2020, Revised 6 November 2021, Accepted 8 November 2021, Available online 12 November 2021, Version of Record 3 December 2021.

论文官网地址:https://doi.org/10.1016/j.patcog.2021.108429