A Novel Correlation-Based CUR Matrix Decomposition Method

Arash Hemmati, H. Nasiri, M. Haeri, M. Ebadzadeh
{"title":"A Novel Correlation-Based CUR Matrix Decomposition Method","authors":"Arash Hemmati, H. Nasiri, M. Haeri, M. Ebadzadeh","doi":"10.1109/ICWR49608.2020.9122286","DOIUrl":null,"url":null,"abstract":"Web data such as documents, images, and videos are examples of large matrices. To deal with such matrices, one may use matrix decomposition techniques. As such, CUR matrix decomposition is an important approximation technique for high-dimensional data. It approximates a data matrix by selecting a few of its rows and columns. However, a problem faced by most CUR decomposition matrix methods is that they ignore the correlation among columns (rows), which gives them lesser chance to be selected; even though, they might be appropriate candidates for basis vectors. In this paper, a novel CUR matrix decomposition method is proposed, in which calculation of the correlation, boosts the chance of selecting such columns (rows). Experimental results indicate that in comparison with other methods, this one has had higher accuracy in matrix approximation.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"2017 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 6th International Conference on Web Research (ICWR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWR49608.2020.9122286","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Web data such as documents, images, and videos are examples of large matrices. To deal with such matrices, one may use matrix decomposition techniques. As such, CUR matrix decomposition is an important approximation technique for high-dimensional data. It approximates a data matrix by selecting a few of its rows and columns. However, a problem faced by most CUR decomposition matrix methods is that they ignore the correlation among columns (rows), which gives them lesser chance to be selected; even though, they might be appropriate candidates for basis vectors. In this paper, a novel CUR matrix decomposition method is proposed, in which calculation of the correlation, boosts the chance of selecting such columns (rows). Experimental results indicate that in comparison with other methods, this one has had higher accuracy in matrix approximation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的基于关联的CUR矩阵分解方法
文档、图像和视频等Web数据就是大型矩阵的例子。为了处理这样的矩阵,可以使用矩阵分解技术。因此,CUR矩阵分解是一种重要的高维数据逼近技术。它通过选择其中的一些行和列来近似一个数据矩阵。然而,大多数CUR分解矩阵方法面临的一个问题是,它们忽略了列(行)之间的相关性,这使得它们被选中的机会较小;尽管它们可能是基向量的合适候选者。本文提出了一种新的CUR矩阵分解方法,通过计算相关性,增加了选择此类列(行)的机会。实验结果表明,与其他方法相比,该方法具有较高的矩阵逼近精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Hierarchical Three-module Method of Text Classification in Web Big Data RePersian:An Efficient Open Information Extraction Tool in Persian Personalization of E-Learning Environment Using the Kolb's Learning Style Model A Multiagent Approach To Web Service Composition Based On TROPOS Methodology Analyzing the Robustness of Web Service Networks
×
引用
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