Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Hypergraph Regularized Lp Smooth Nonnegative Matrix Factorization for Data Representation

Version 1 : Received: 19 May 2023 / Approved: 22 May 2023 / Online: 22 May 2023 (10:20:53 CEST)

A peer-reviewed article of this Preprint also exists.

Xu, Y.; Lu, L.; Liu, Q.; Chen, Z. Hypergraph-Regularized Lp Smooth Nonnegative Matrix Factorization for Data Representation. Mathematics 2023, 11, 2821. Xu, Y.; Lu, L.; Liu, Q.; Chen, Z. Hypergraph-Regularized Lp Smooth Nonnegative Matrix Factorization for Data Representation. Mathematics 2023, 11, 2821.

Abstract

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.

Keywords

hypergraph regularization; Lp smooth; nonnegative matrix factorization; data clustering

Subject

Computer Science and Mathematics, Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.