Classification with incomplete training information using a cluster ensemble and low-rank matrix decomposition
2020 ◽
Vol 4
(78)
◽
pp. 54-62
Keyword(s):
Low Rank
◽
The paper is devoted to solve the pattern recognition problem with incomplete learning data. The solution method, which combines similarity graph with Laplacian Regularization and collective clustering is proposed. The low-rank decomposition of co-association matrix for cluster ensemble is used, which allows to speed up the computations and keep memory. Experimental results on test tasks and on real hyperspectral image demonstrate the effectiveness of proposed method, including with noisy data.