多视角深度倒数非负矩阵因式分解

IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Engineering Applications of Artificial Intelligence Pub Date : 2024-10-30 DOI:10.1016/j.engappai.2024.109508
Bo Zhong , Jun-Yun Wu , Jian-Sheng Wu , Weidong Min
{"title":"多视角深度倒数非负矩阵因式分解","authors":"Bo Zhong ,&nbsp;Jun-Yun Wu ,&nbsp;Jian-Sheng Wu ,&nbsp;Weidong Min","doi":"10.1016/j.engappai.2024.109508","DOIUrl":null,"url":null,"abstract":"<div><div>Multi-view deep matrix factorization has recently gained popularity for extracting high-quality representations from multi-view data to improve the processing performance of multi-view data in pattern recognition, data mining, and machine learning. It explores the hierarchical semantics of data by performing a multi-layer decomposition on representation matrices after decomposing the data into basis and representation matrices but ignoring the basis matrices, which also contain valuable information about data. Extracting high-quality bases during the deep representation learning process can facilitate the learning of high-quality representations for multi-view data. To this end, this paper proposes a novel deep nonnegative matrix factorization architecture, named <em><strong>M</strong>ulti-view <strong>D</strong>eep <strong>R</strong>eciprocal <strong>N</strong>onnegative <strong>M</strong>atrix <strong>F</strong>actorization</em> (<strong>MDRNMF</strong>), that collaborates with high-quality basis extraction, allowing the deep representation learning and high-quality basis extraction to promote each other. Based on the representations at the top layer, this paper adaptively learns the intrinsic local similarities of data within each view to capture the view-specific information. In addition, to explore the high-order data consistency across views, this paper introduces a Schatten <span><math><mi>p</mi></math></span>-norm-based low-rank regularization on the similarity tensor stacked by the view-specific similarity matrices. In this way, the proposed method can effectively explore and leverage the view-specific and consistent information of multi-view data simultaneously. Finally, extensive experiments demonstrate the superiority of the proposed model over several state-of-the-art methods.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":7.5000,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-view deep reciprocal nonnegative matrix factorization\",\"authors\":\"Bo Zhong ,&nbsp;Jun-Yun Wu ,&nbsp;Jian-Sheng Wu ,&nbsp;Weidong Min\",\"doi\":\"10.1016/j.engappai.2024.109508\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Multi-view deep matrix factorization has recently gained popularity for extracting high-quality representations from multi-view data to improve the processing performance of multi-view data in pattern recognition, data mining, and machine learning. It explores the hierarchical semantics of data by performing a multi-layer decomposition on representation matrices after decomposing the data into basis and representation matrices but ignoring the basis matrices, which also contain valuable information about data. Extracting high-quality bases during the deep representation learning process can facilitate the learning of high-quality representations for multi-view data. To this end, this paper proposes a novel deep nonnegative matrix factorization architecture, named <em><strong>M</strong>ulti-view <strong>D</strong>eep <strong>R</strong>eciprocal <strong>N</strong>onnegative <strong>M</strong>atrix <strong>F</strong>actorization</em> (<strong>MDRNMF</strong>), that collaborates with high-quality basis extraction, allowing the deep representation learning and high-quality basis extraction to promote each other. Based on the representations at the top layer, this paper adaptively learns the intrinsic local similarities of data within each view to capture the view-specific information. In addition, to explore the high-order data consistency across views, this paper introduces a Schatten <span><math><mi>p</mi></math></span>-norm-based low-rank regularization on the similarity tensor stacked by the view-specific similarity matrices. In this way, the proposed method can effectively explore and leverage the view-specific and consistent information of multi-view data simultaneously. Finally, extensive experiments demonstrate the superiority of the proposed model over several state-of-the-art methods.</div></div>\",\"PeriodicalId\":50523,\"journal\":{\"name\":\"Engineering Applications of Artificial Intelligence\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.5000,\"publicationDate\":\"2024-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Engineering Applications of Artificial Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S095219762401666X\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Applications of Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S095219762401666X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

多视图深度矩阵因式分解最近很受欢迎,它可以从多视图数据中提取高质量的表示,从而在模式识别、数据挖掘和机器学习中提高多视图数据的处理性能。它在将数据分解为基础矩阵和表示矩阵后,通过对表示矩阵进行多层分解来探索数据的层次语义,但忽略了基础矩阵,而基础矩阵也包含数据的宝贵信息。在深度表示学习过程中提取高质量的基,可以促进多视图数据的高质量表示学习。为此,本文提出了一种新颖的深度非负矩阵因式分解架构,名为多视图深度互易非负矩阵因式分解(MDRNMF),该架构与高质量基提取相结合,使深度表示学习与高质量基提取相互促进。在顶层表示的基础上,本文自适应地学习每个视图中数据的内在局部相似性,以捕捉视图的特定信息。此外,为了探索跨视图的高阶数据一致性,本文在由视图特定相似性矩阵堆叠的相似性张量上引入了基于 Schatten p-norm 的低秩正则化。这样,本文提出的方法就能同时有效地探索和利用多视图数据的视图特定信息和一致性信息。最后,大量实验证明了所提出的模型优于几种最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multi-view deep reciprocal nonnegative matrix factorization
Multi-view deep matrix factorization has recently gained popularity for extracting high-quality representations from multi-view data to improve the processing performance of multi-view data in pattern recognition, data mining, and machine learning. It explores the hierarchical semantics of data by performing a multi-layer decomposition on representation matrices after decomposing the data into basis and representation matrices but ignoring the basis matrices, which also contain valuable information about data. Extracting high-quality bases during the deep representation learning process can facilitate the learning of high-quality representations for multi-view data. To this end, this paper proposes a novel deep nonnegative matrix factorization architecture, named Multi-view Deep Reciprocal Nonnegative Matrix Factorization (MDRNMF), that collaborates with high-quality basis extraction, allowing the deep representation learning and high-quality basis extraction to promote each other. Based on the representations at the top layer, this paper adaptively learns the intrinsic local similarities of data within each view to capture the view-specific information. In addition, to explore the high-order data consistency across views, this paper introduces a Schatten p-norm-based low-rank regularization on the similarity tensor stacked by the view-specific similarity matrices. In this way, the proposed method can effectively explore and leverage the view-specific and consistent information of multi-view data simultaneously. Finally, extensive experiments demonstrate the superiority of the proposed model over several state-of-the-art methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Engineering Applications of Artificial Intelligence
Engineering Applications of Artificial Intelligence 工程技术-工程:电子与电气
CiteScore
9.60
自引率
10.00%
发文量
505
审稿时长
68 days
期刊介绍: Artificial Intelligence (AI) is pivotal in driving the fourth industrial revolution, witnessing remarkable advancements across various machine learning methodologies. AI techniques have become indispensable tools for practicing engineers, enabling them to tackle previously insurmountable challenges. Engineering Applications of Artificial Intelligence serves as a global platform for the swift dissemination of research elucidating the practical application of AI methods across all engineering disciplines. Submitted papers are expected to present novel aspects of AI utilized in real-world engineering applications, validated using publicly available datasets to ensure the replicability of research outcomes. Join us in exploring the transformative potential of AI in engineering.
期刊最新文献
Constrained multi-objective optimization assisted by convergence and diversity auxiliary tasks A deep sequence-to-sequence model for power swing blocking of distance protection in power transmission lines A Chinese named entity recognition method for landslide geological disasters based on deep learning A deep learning ensemble approach for malware detection in Internet of Things utilizing Explainable Artificial Intelligence Evaluating the financial credibility of third-party logistic providers through a novel frank operators-driven group decision-making model with dual hesitant linguistic q-rung orthopair fuzzy information
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1