首页> 外文会议>2018 IEEE International Congress on Big Data >Learning a Joint Low-Rank and Gaussian Model in Matrix Completion with Spectral Regularization and Expectation Maximization Algorithm
【24h】

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.
机译:完成部分已知的矩阵是数据科学领域中的重要问题,并且对于许多相关应用有用,例如,推荐系统的协作过滤,大规模传感器网络中的全球定位。低秩模型和高斯模型是矩阵完成中使用的两种流行模型,它们都已被证明是成功的。在本文中,我们介绍了一个利用低秩和高斯模型的特征的单一模型。我们开发了一种基于期望最大化(EM)的新颖方法,该方法涉及频谱正则化(针对低阶部分)以及最大似然最大化(针对学习高斯参数)。我们还根据真实电影收视率数据测试了我们的框架,并提供了一些与矩阵完成常用的方法相比较的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号