Biased unconstrained non-negative matrix factorization for clustering

• Impact Factor:8.139
• DOI number:10.1016/j.knosys.2021.108040
• Affiliation of Author(s):西南交通大学
• Journal:KNOWLEDGE-BASED SYSTEMS
• Place of Publication:NETHERLANDS
• Key Words:Non-negative matrix factorization;Unconstrained regularization;Stochastic gradient descent;Clustering
• Abstract:Clustering remains a challenging research hotspot in data mining. Non-negative matrix factorization (NMF) is an effective technique for clustering, which aims to find the product of two non-negative low-dimensional matrices that approximates the original matrix. Since the matrices must satisfy the non-negative constraints, the Karush–Kuhn–Tucker conditions need to be used to obtain the update rules for the matrices, which limits the choice of update methods. Moreover, this method has no learning rate and the updating process is completely dependent on the data itself. In addition, the two low-dimensional matrices in NMF are randomly initialized, and the clustering performance of the model is reduced. To address these problems, this paper proposes a biased unconstrained non-negative matrix factorization (BUNMF) model, which integrates the norm and adds bias. Specifically, BUNMF uses a non-linear activation function to make elements of the matrices to remain non-negative, and converts the constrained problem into an unconstrained problem. The matrices are renewed by sequentially updating the matrices’ elements using stochastic gradient descent to obtain an update rule with a learning rate. Furthermore, the BUNMF model is constructed by three different activation functions and their iteration update algorithms are given through detailed reasoning. Finally, experimental results on eight public datasets show the effectiveness of the proposed model.
• Co-author:Fan Zhang,Tianrui Li,Shi-Jinn Horng
• First Author:Ping Deng
• Indexed by:Academic papers
• Correspondence Author:Hongjun Wang
• Document Code:20220311460171
• Discipline:Engineering
• First-Level Discipline:Computer Science and Technology
• Volume:Volume 239
• Issue:5 March 2022
• Page Number:108040
• ISSN No.:0950-7051
• Translation or Not:no
• Date of Publication:2021-12-29