Semi-Paired Multiview Clustering Based on Nonnegative Matrix Factorization


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

Resumo

As data that have multiple views become widely available, the clusterization of such data based on nonnegative matrix factorization has been attracting greater attention. In the majority of studies, the statement in which all objects have images in all representations is considered. However, this is often not the case in practical problems. To resolve this issue, a novel semi-paired multiview clustering algorithm is proposed. For incomplete data, it is assumed that their views have the same indicator vector, and the paired matrix is introduced. The objects that are close to each other in each view must have identical indicators, which makes regularization and reconstruction of the manifold geometric structure possible. The proposed algorithm can work both with incomplete and complete data having multiple views. The experimental results obtained on four datasets prove its effectiveness compared to other modern algorithms.

Sobre autores

X. Chen

Nanjing University of Aeronautics and Astronautics

Autor responsável pela correspondência
Email: lyandcxh@nuaa.edu.cn
República Popular da China, Nanjing, 210016

I. Matveev

Federal Research Center “Computer Science and Control”, Russian Academy of Sciences

Autor responsável pela correspondência
Email: matveev@ccas.ru
Rússia, Moscow, 119333

H. Xue

School of Computer Science and Engineering, Southeast University

Email: matveev@ccas.ru
República Popular da China, Nanjing, 210096

L. Yu

Institute of Communications Engineering, Army Engineering University of PLA

Email: matveev@ccas.ru
República Popular da China, Nanjing, 210007

X. Yao

Nanjing University of Aeronautics and Astronautics

Email: matveev@ccas.ru
República Popular da China, Nanjing, 210016


Declaração de direitos autorais © Pleiades Publishing, Ltd., 2019

Este site utiliza cookies

Ao continuar usando nosso site, você concorda com o procedimento de cookies que mantêm o site funcionando normalmente.

Informação sobre cookies