TY - JOUR
T1 - Robust Deep Matrix Factorization with Low-rank and Hypergraph Learning for Multi-view Data Processing
AU - Pan, Baicheng
AU - Che, Hangjun
AU - Li, Chenglu
AU - Li, Hongfei
N1 - This work was supported in part by the National Natural Science Foundation of China (Grant No. 62476229, 62473321), the Science and Technology Research Program of Chongqing Municipal Education Commission (Grant No. KJQN202200207, KJQN202400203), and the Open Fund of Key Laboratory of Cyber-Physical Fusion Intelligent Computing (South-Central Minzu University), State Ethnic Affairs Commission (Grant No. CPFIC202303).
Publisher Copyright:
© 1975-2011 IEEE.
PY - 2025/1/3
Y1 - 2025/1/3
N2 - As the advancement of sensing technology and cyber-physical equipment, the complexity and dimensionality of the data from consumer internet of things have increased dramatically. Processing the complex and multi-view data to analyze the consumption characteristics becomes a significant issue. Deep matrix factorization (DMF) is a widely spread method with the ability to learn intrinsic components in data based on its multiple-layers structures. However, the multiple-layers structures may magnify noises in data and the standard DMF cannot reflect the manifold and low-rank structures on the coefficient matrix well. In the paper, a robust deep matrix factorization with low-rank and hypergraph learning (RDMFLRH) model is proposed for multi-view data processing. Firstly, an arc tangent loss function with less sensitivity to noises and outlines is introduced to enhance robustness. Additionally, low-rank and hypergraph learning are adopted to extract the relationships between clusters and maintain the binary manifold structures from the original space. Then, an optimization algorithm based on the multiplicative update rule is developed to solve the proposed model with convergence proven theoretically and experimentally. Finally, abundant experiments on real-world and noisy datasets validate the superiority of the proposed method, improving around 1% to 10% performance compared with the comparison state-of-the-art methods.
AB - As the advancement of sensing technology and cyber-physical equipment, the complexity and dimensionality of the data from consumer internet of things have increased dramatically. Processing the complex and multi-view data to analyze the consumption characteristics becomes a significant issue. Deep matrix factorization (DMF) is a widely spread method with the ability to learn intrinsic components in data based on its multiple-layers structures. However, the multiple-layers structures may magnify noises in data and the standard DMF cannot reflect the manifold and low-rank structures on the coefficient matrix well. In the paper, a robust deep matrix factorization with low-rank and hypergraph learning (RDMFLRH) model is proposed for multi-view data processing. Firstly, an arc tangent loss function with less sensitivity to noises and outlines is introduced to enhance robustness. Additionally, low-rank and hypergraph learning are adopted to extract the relationships between clusters and maintain the binary manifold structures from the original space. Then, an optimization algorithm based on the multiplicative update rule is developed to solve the proposed model with convergence proven theoretically and experimentally. Finally, abundant experiments on real-world and noisy datasets validate the superiority of the proposed method, improving around 1% to 10% performance compared with the comparison state-of-the-art methods.
KW - deep matrix factorization
KW - hypergraph learning
KW - Multi-view data processing
KW - robust matrix factorization
UR - http://www.scopus.com/inward/record.url?scp=85215706801&partnerID=8YFLogxK
U2 - 10.1109/TCE.2025.3525523
DO - 10.1109/TCE.2025.3525523
M3 - Journal article
AN - SCOPUS:85215706801
SN - 0098-3063
JO - IEEE Transactions on Consumer Electronics
JF - IEEE Transactions on Consumer Electronics
ER -