مهدی حسین زاده اقدم

Non-negative matrix factorization (NMF) is a famous method to learn parts-based representations of nonnegative data. It has been used successfully in various applications such as information retrieval and recommender systems. Most of the current NMF methods only focus on how each decomposed matrices vector should be modeled and disregard the relation among pairwise feature vectors of users and items. In recommender systems, the relationship between users’ factors or items’ features provides better factorization. This paper proposes a constrained non-negative matrix factorization for recommender systems (CNMF-RS), which puts constraints on pairwise vectors of users and items by applying penalties using similarity. Two cost functions are proposed to generate the corresponding updating rules for finding unknown ratings. The computational complexity analysis confirmed that CNMF-RS does not raise time complexity using constraints compared with the basic NMF. Experiments on benchmark datasets indicate that the suggested update rules converge quickly and obtain outstanding results compared to other methods.