Ranking preserving nonnegative matrix factorization

Authors: Wang, J., Tian, F., Liu, W., Wang, X., Zhang, W. and Kenji, Y.

http://eprints.bournemouth.ac.uk/31142/

Start date: 13 July 2018

This data was imported from Scopus:

Authors: Wang, J., Tian, F., Liu, W., Wang, X., Zhang, W. and Yamanishi, K.

http://eprints.bournemouth.ac.uk/31142/

Journal: IJCAI International Joint Conference on Artificial Intelligence

Volume: 2018-July

Pages: 2776-2782

ISBN: 9780999241127

ISSN: 1045-0823

© 2018 International Joint Conferences on Artificial Intelligence. All right reserved. Nonnegative matrix factorization (NMF), a well-known technique to find parts-based representations of nonnegative data, has been widely studied. In reality, ordinal relations often exist among data, such as data i is more related to j than to q. Such relative order is naturally available, and more importantly, it truly reflects the latent data structure. Preserving the ordinal relations enables us to find structured representations of data that are faithful to the relative order, so that the learned representations become more discriminative. However, this cannot be achieved by current NMFs. In this paper, we make the first attempt towards incorporating the ordinal relations and propose a novel ranking preserving nonnegative matrix factorization (RPNMF) approach, which enforces the learned representations to be ranked according to the relations. We derive iterative updating rules to solve RPNMF's objective function with convergence guaranteed. Experimental results with several datasets for clustering and classification have demonstrated that RPNMF achieves greater performance against the state-of-the-arts, not only in terms of accuracy, but also interpretation of orderly data structure.

The data on this page was last updated at 05:18 on July 19, 2019.