Title
Directly solving normalized cut for multi-view data
Abstract
•The new method learns a set of implicit weights for each view to identify its quality, and the view weights can be adjusted by an additional parameter for better results.•A parameter p is introduced to adjust the distribution of these view weights to obtain better results.•An iterative algorithm with linear time complexity is proposed to directly optimize the new model without eigen-decomposition and post-processing.
Year
DOI
Venue
2022
10.1016/j.patcog.2022.108809
Pattern Recognition
Keywords
DocType
Volume
Clustering,Graph cut,Multi-view
Journal
130
ISSN
Citations 
PageRank 
0031-3203
0
0.34
References 
Authors
22
4
Name
Order
Citations
PageRank
Chen Wang114146.56
Xiaojun Chen21298107.51
Feiping Nie37061309.42
Joshua Zhexue Huang4136582.64