用谱正则化和期望最大化算法学习矩阵补全中的低秩高斯联合模型

Gang Wu, Ratnesh Kumar
{"title":"用谱正则化和期望最大化算法学习矩阵补全中的低秩高斯联合模型","authors":"Gang Wu, Ratnesh Kumar","doi":"10.1109/BigDataCongress.2018.00035","DOIUrl":null,"url":null,"abstract":"Completing a partially-known matrix, is an important problem in the field of data science and useful for many related applications, e.g., collaborative filtering for recommendation systems, global positioning in large-scale sensor networks. Low-rank and Gaussian models are two popular classes of models used in matrix completion, both of which have proven success. In this paper, we introduce a single model that leverage the features of both low-rank and Gaussian models. We develop a novel method based on Expectation Maximization (EM) that involves spectral regularization (for low-rank part) as well as maximum likelihood maximization (for learning Gaussian parameters). We also test our framework on real-world movie rating data, and provide comparison results with some of the common methods used for matrix completion.","PeriodicalId":177250,"journal":{"name":"2018 IEEE International Congress on Big Data (BigData Congress)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Learning a Joint Low-Rank and Gaussian Model in Matrix Completion with Spectral Regularization and Expectation Maximization Algorithm\",\"authors\":\"Gang Wu, Ratnesh Kumar\",\"doi\":\"10.1109/BigDataCongress.2018.00035\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Completing a partially-known matrix, is an important problem in the field of data science and useful for many related applications, e.g., collaborative filtering for recommendation systems, global positioning in large-scale sensor networks. Low-rank and Gaussian models are two popular classes of models used in matrix completion, both of which have proven success. In this paper, we introduce a single model that leverage the features of both low-rank and Gaussian models. We develop a novel method based on Expectation Maximization (EM) that involves spectral regularization (for low-rank part) as well as maximum likelihood maximization (for learning Gaussian parameters). We also test our framework on real-world movie rating data, and provide comparison results with some of the common methods used for matrix completion.\",\"PeriodicalId\":177250,\"journal\":{\"name\":\"2018 IEEE International Congress on Big Data (BigData Congress)\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Congress on Big Data (BigData Congress)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BigDataCongress.2018.00035\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Congress on Big Data (BigData Congress)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BigDataCongress.2018.00035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

完成部分已知矩阵是数据科学领域的一个重要问题,对于许多相关应用都很有用,例如推荐系统的协同过滤,大规模传感器网络中的全球定位。低秩模型和高斯模型是矩阵补全中常用的两类模型,它们都已被证明是成功的。在本文中,我们引入了一个单一的模型,它利用了低秩模型和高斯模型的特征。我们开发了一种基于期望最大化(EM)的新方法,该方法涉及谱正则化(用于低秩部分)和最大似然最大化(用于学习高斯参数)。我们还在真实世界的电影评级数据上测试了我们的框架,并提供了与用于矩阵补全的一些常用方法的比较结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Learning a Joint Low-Rank and Gaussian Model in Matrix Completion with Spectral Regularization and Expectation Maximization Algorithm
Completing a partially-known matrix, is an important problem in the field of data science and useful for many related applications, e.g., collaborative filtering for recommendation systems, global positioning in large-scale sensor networks. Low-rank and Gaussian models are two popular classes of models used in matrix completion, both of which have proven success. In this paper, we introduce a single model that leverage the features of both low-rank and Gaussian models. We develop a novel method based on Expectation Maximization (EM) that involves spectral regularization (for low-rank part) as well as maximum likelihood maximization (for learning Gaussian parameters). We also test our framework on real-world movie rating data, and provide comparison results with some of the common methods used for matrix completion.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信