No abstract

Non-negative matrix factorization (NMF) is widely used as a powerful matrix factorization tool in data representation. However, the traditional NMF, measured by Euclidean distance or Kullback–Leibler distance, does not take into account the internal implied geometric information of the dataset and cannot measure the distance between samples as well as possible. To remedy the defects, in this paper, we propose the NMF method with Earth mover’s distance as a metric, for short GSNMF-EMD. It combines graph regularization and L1/2 smooth constraints. The GSNMF-EMD method takes into account the intrinsic implied geometric information of the dataset and can produce more sparse and stable local solutions. Experiments on two specific image datasets showed that the proposed method outperforms related state-of-the-art methods.

Nonnegative matrix factorization (NMF) has been shown to be a strong data representation technique, with applications in text mining, pattern recognition, image processing, clustering and other fields. In this paper, we propose a hypergraph regularized Lp smooth nonnegative matrix factorization (HGSNMF), by incorporating hypergraph regularization and Lp smoothing constraint terms into the standard NMF. The hypergraph regularization term can capture the intrinsic geometry structure of the high dimension space data more comprehensively than simple graph, the Lp smoothing constraint may yield a smooth and more accurate solution to the optimization problem. The updating rules are given using multiplicative update techniques, and the convergence of HGSNMF is theoretically investigated. The experimental results on four different data sets show that the proposed method has better clustering effect than the related state-of-the-art methods in the vast majority of cases.

Given a complex idempotent matrix A, we derive simple, sufficient and necessary conditions for a matrix X being a nontrivial solution of the Yang-Baxter-like matrix equation AXA = XAX, discriminating commuting solutions from non-commuting ones. On this basis, we construct all the commuting solutions of the nonlinear matrix equation.

In an $m$-person symmetric game, all players are identical and indistinguishable. In this paper, we find that the payoff tensor of the player $k$ in an $m$-person symmetric game is $k$-mode symmetric, and the payoff tensors of two different individuals are the transpose of each other. Furthermore, we reformulate the $m$-person symmetric game as a tensor complementary problem and demonstrate that locating a symmetric Nash equilibrium is equivalent to finding a solution to the resulting tensor complementary problem. Finally, we use the hyperplane projection algorithm to solve the resulting tensor complementary problem, and we present some numerical results to find the symmetric Nash equilibrium.