Skip to main content

Robust Nonnegative Matrix Factorization with Ordered Structure Constraints.

Wang, J., Tian, F., Liu, C., Yu, H., Wang, X. and Tang, X.C., 2017. Robust Nonnegative Matrix Factorization with Ordered Structure Constraints. In: International Joint Conference on Neural Networks (IJCNN), 14-19 May 2017, Alaska, USA.

Full text available as:

ijcnn2017_final.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.


Official URL:


Nonnegative matrix factorization (NMF) as a popular technique to find parts- based representations of nonnegative data has been widely used in real-world applications. Often the data which these applications process, such as motion sequences and video clips, are with ordered structure, i.e., consecutive neighbouring data samples are very likely share similar features unless a sudden change occurs. Therefore, traditional NMF assumes the data samples and features to be independently distributed, making it not proper for the analysis of such data. In this paper, we propose an ordered robust NMF (ORNMF) by capturing the embedded ordered structure to improve the accuracy of data representation. With a novel neighbour penalty term, ORNMF enforces the similarity of neighbouring data. ORNMF also adopts the $L_{2,1}$-norm based loss function to improve its robustness against noises and outliers. A new iterative updating optimization algorithm is derived to solve ORNMF's objective function. The proofs of the convergence and correctness of the scheme are also presented. Experiments on both synthetic and real-world datasets have demonstrated the effectiveness of ORNMF.

Item Type:Conference or Workshop Item (Paper)
Group:Faculty of Science & Technology
ID Code:29417
Deposited By: Symplectic RT2
Deposited On:03 Jul 2017 15:00
Last Modified:14 Mar 2022 14:05


Downloads per month over past year

More statistics for this item...
Repository Staff Only -