A Converged Deep Graph Semi-NMF Algorithm for Learning Data Representation

Deep nonnegative matrix factorization (DMF) is a particularly useful technique for learning data representation in low-dimensional space. To further obtain the complex hidden information and keep the geometrical structures of the high-dimensional data, we propose a novel deep matrix factorization model with the graph regularization (called DGsnMF). For solving the model with multi-variables, we design a forward–backward splitting scheme. After that, the convergence analysis is attached to the proposed algorithm and it is proved to converge to a critical point. Empirical experiments on benchmark datasets show that the proposed method is superior to the compared methods.