推荐系统
计算机科学
矩阵完成
矩阵分解
协同过滤
聚类分析
基质(化学分析)
稀疏矩阵
数据挖掘
情报检索
矩阵表示法
代表(政治)
算法
人工智能
群(周期表)
法学
材料科学
化学
有机化学
高斯分布
复合材料
特征向量
物理
政治
量子力学
政治学
作者
Chemmalar Selvi G.,G. Lakshmi Priya
出处
期刊:International Journal of Pervasive Computing and Communications
[Emerald (MCB UP)]
日期:2020-01-21
卷期号:17 (2): 167-183
被引量:5
标识
DOI:10.1108/ijpcc-07-2019-0055
摘要
Purpose In today’s world, the recommender systems are very valuable systems for the online users, as the World Wide Web is loaded with plenty of available information causing the online users to spend more time and money. The recommender systems suggest some possible and relevant recommendation to the online users by applying the recommendation filtering techniques to the available source of information. The recommendation filtering techniques take the input data denoted as the matrix representation which is generally very sparse and high dimensional data in nature. Hence, the sparse data matrix is completed by filling the unknown or missing entries by using many matrix completion techniques. One of the most popular techniques used is the matrix factorization (MF) which aims to decompose the sparse data matrix into two new and small dimensional data matrix and whose dot product completes the matrix by filling the logical values. However, the MF technique failed to retain the loss of original information when it tried to decompose the matrix, and the error rate is relatively high which clearly shows the loss of such valuable information. Design/methodology/approach To alleviate the problem of data loss and data sparsity, the new algorithm from formal concept analysis (FCA), a mathematical model, is proposed for matrix completion which aims at filling the unknown or missing entries without loss of valuable information to a greater extent. The proposed matrix completion algorithm uses the clustering technique where the users who have commonly rated the items and have not commonly rated the items are captured into two classes. The matrix completion algorithm fills the mean cluster value of the unknown entries which well completes the matrix without actually decomposing the matrix. Findings The experiment was conducted on the available public data set, MovieLens, whose result shows the prediction error rate is minimal, and the comparison with the existing algorithms is also studied. Thus, the application of FCA in recommender systems proves minimum or no data loss and improvement in the prediction accuracy of rating score. Social implications The proposed matrix completion algorithm using FCA performs good recommendation which will be more useful for today’s online users in making decision with regard to the online purchasing of products. Originality/value This paper presents the new technique of matrix completion adopting the vital properties from FCA which is applied in the recommender systems. Hence, the proposed algorithm performs well when compared to other existing algorithms in terms of prediction accuracy.
科研通智能强力驱动
Strongly Powered by AbleSci AI