共查询到20条相似文献,搜索用时 15 毫秒
1.
The major aim of recommender algorithms has been to predict accurately the rating value of items. However, it has been recognized that accurate prediction of rating values is not the only requirement for achieving user satisfaction. One other requirement, which has gained importance recently, is the diversity of recommendation lists. Being able to recommend a diverse set of items is important for user satisfaction since it gives the user a richer set of items to choose from and increases the chance of discovering new items. In this study, we propose a novel method which can be used to give each user an option to adjust the diversity levels of their own recommendation lists. Experiments show that the method effectively increases the diversity levels of recommendation lists with little decrease in accuracy. Compared to the existing methods, the proposed method, while achieving similar diversification performance, has a very low computational time complexity, which makes it highly scalable and allows it to be used in the online phase of the recommendation process. 相似文献
2.
王森 《计算机工程与科学》2015,37(9):1794-1798
目前大多数推荐算法都是以提高用户对未知商品的评分预测值为主要目标。然而预测准确率并不是增加用户满意度的唯一标准,推荐列表的多样性也是衡量推荐质量的一个重要指标。提出了一种新的推荐方法,在保证推荐列表准确率的条件下,通过调节商品类的权重来提高推荐商品的多样性。实验表明,该方法不仅具有较低的时间复杂度和高度的可扩展性,而且与其他方法相比能够获得更好的推荐效果。 相似文献
3.
World Wide Web - Pointwise prediction and Learning to Rank (L2R) are two hot strategies to model user preference in recommender systems. Currently, these two types of approaches are often... 相似文献
4.
Recommendation is the process of identifying and recommending items that are more likely to be of interest to a user. Recommender systems have been applied in variety of fields including e-commerce web pages to increase the sales through the page by making relevant recommendations to users. In this paper, we pose the problem of recommendation as an interpolation problem, which is not a trivial task due to the high dimensional structure of the data. Therefore, we deal with the issue of high dimension by representing the data with lower dimensions using High Dimensional Model Representation (HDMR) based algorithm. We combine this algorithm with the collaborative filtering philosophy to make recommendations using an analytical structure as the data model based on the purchase history matrix of the customers. The proposed approach is able to make a recommendation score for each item that have not been purchased by a customer which potentiates the power of the classical recommendations. Rather than using benchmark data sets for experimental assessments, we apply the proposed approach to a novel industrial data set obtained from an e-commerce web page from apparels domain to present its potential as a recommendation system. We test the accuracy of our recommender system with several pioneering methods in the literature. The experimental results demonstrate that the proposed approach makes recommendations that are of interest to users and shows better accuracy compared to state-of-the-art methods. 相似文献
5.
6.
Userrank for item-based collaborative filtering recommendation 总被引:1,自引:0,他引:1
With the recent explosive growth of the Web, recommendation systems have been widely accepted by users. Item-based Collaborative Filtering (CF) is one of the most popular approaches for determining recommendations. A common problem of current item-based CF approaches is that all users have the same weight when computing the item relationships. To improve the quality of recommendations, we incorporate the weight of a user, userrank, into the computation of item similarities and differentials. In this paper, a data model for userrank calculations, a PageRank-based user ranking approach, and a userrank-based item similarities/differentials computing approach are proposed. Finally, the userrank-based approaches improve the recommendation results of the typical Adjusted Cosine and Slope One item-based CF approaches. 相似文献
7.
World Wide Web - Human-AI collaborative decision-making tools are being increasingly applied in critical domains such as healthcare. However, these tools are often seen as closed and intransparent... 相似文献
8.
Hongchen Wu Xinjun Wang Zhaohui Peng Qingzhong Li 《Journal of Network and Computer Applications》2013,36(6):1642-1650
Collaborative recommendation (CR) is a popular method of filtering items that may interest social users by referring to the opinions of friends and acquaintances in the network and computer applications. However, CR involves a cold-start problem, in which a newly established recommender system usually exhibits low recommending accuracy because of insufficient data, such as lack of ratings from users. In this study, we rigorously identify active users in social networks, who are likely to share and accept a recommendation in each data cluster to enhance the performance of the recommendation system and solve the cold-start problem. This novel modified CR method called div-clustering is presented to cluster Web entities in which the properties are specified formally in a recommendation framework, with the reusability of the user modeling component considered. We improve the traditional k-means clustering algorithm by applying supplementary works such as compensating for nominal values supported by the knowledge base, as well as computing and updating the k value. We use the data from two different cases to test for accuracy and demonstrate high quality in div-clustering against a baseline CR algorithm. The experimental results of both offline and online evaluations, which also consider in detail the volunteer profiles, indicate that the CR system with div-clustering obtains more accurate results than does the baseline system. 相似文献
9.
Kwok-Wai Cheung Kwok-Ching Tsui Jiming Liu 《IEEE transactions on systems, man, and cybernetics. Part A, Systems and humans : a publication of the IEEE Systems, Man, and Cybernetics Society》2004,34(1):143-148
With the advent of the World Wide Web, providing just-in-time personalized product recommendations to customers now becomes possible. Collaborative recommender systems utilize correlation between customer preference ratings to identify "like-minded" customers and predict their product preference. One factor determining the success of the recommender systems is the prediction accuracy, which in many cases is limited by lacking adequate ratings (the sparsity problem). Recently, the use of latent class model (LCM) has been proposed to alleviate this problem. In this paper, we first study how the LCM can be extended to handle customers and products outside the training set. In addition, we propose the use of a pair of LCMs (called dual latent class model-DLCM), instead of a single LCM, to model customers' likes and dislikes separately for enhancing the prediction accuracy. Experimental results based on the EachMovie dataset show that DLCM outperforms both LCM and the conventional correlation-based method when the available ratings are sparse. 相似文献
10.
《Expert systems with applications》2014,41(8):3879-3900
Recommender systems are software tools and techniques for suggesting items in an automated fashion to users tailored their preferences. Collaborative Filtering (CF) techniques, which attempt to predict what information will meet a user’s needs from the neighborhoods of like-minded people, are becoming increasingly popular as ways to overcome the information overload. The multi-criteria based CF presents a possibility to provide accurate recommendations by considering the user preferences in multiple aspects and several methods have been proposed for improving the accuracy of these systems. However, the problem of multi-criteria recommendations with a single and overall rating is still considered an optimization problem. In addition, increasing the accuracy in predicting the appropriate items tailored to the users’ preferences is on of the main challenges in these systems. Hence, in this research new recommendation methods using Adaptive Neuro-Fuzzy Inference Systems (ANFIS) and Self-Organizing Map (SOM) clustering are proposed to improve predictive accuracy of criteria CF. In this research, SOM enables us to generate high quality clusters of dataset and ANFIS is used for discovering knowledge (fuzzy rules) from users’ ratings in multi-criteria dataset, generating appropriate membership functions (MFs), overall rating prediction and input selection. Using exhaustive search method for input selection, the effective inputs are determined to build the ANFIS models in all generated clusters. Furthermore, new fuzzy-based algorithms, Weighted Fuzzy MC-CF (WFuMC-CF), Fuzzy Euclidean MC-CF (FuEucMC-CF) and Fuzzy Average MC-CF (FuAvgMC-CF), are presented for prediction task in multi-criteria CF. FuEucMC-CF and FuAvgMC-CF algorithms uses the fuzzy-based Euclidian distance and fuzzy-based average similarity, respectively, the WFuMC-CF algorithm uses fuzzy-based user- and item-based prediction in a weighted approach. Experimental results on real-world dataset demonstrate that the proposed hybrid methods remarkably improve the accuracy of multi-criteria CF in relation to the previous methods based on multi-criteria ratings. 相似文献
11.
在智慧电网中,电力公司可以主动推荐定制的售电方案给潜在用户,但现有的推荐算法存在着精确度不高、方案不合理等缺点.为解决以上问题,基于协同过滤策略,开发一种电力计划推荐方案.通过提供一些容易获得的家电产品数据,对居民用户进行不同方案的预测评级,为用户选择合适的方案和合理的电价.在实验阶段,通过不同的数值实验评价该方法的性能,实验结果表明,EPR算法在推荐结果的准确性上优于其它策略. 相似文献
12.
兴趣点(POI)推荐可以帮助用户发现其没有访问过但可能感兴趣的地点,是重要的基于位置的服务之一。时间在POI推荐中是一个重要因素,而现有POI推荐模型并没有较好地考虑时间因素,因此通过考虑时间因素来提出融入时间的POI协同推荐(TUCF)算法,从而提高POI推荐的效果。首先,分析基于位置的社交网络(LBSN)的用户签到数据,以探索用户签到的时间关系;然后,利用时间关系对用户签到数据进行平滑处理,以融入时间因素并缓解数据稀疏性;最后,根据基于用户的协同过滤方法,在不同时间推荐不同POI给用户。在真实签到数据集上的实验结果表明,与基于用户的协同过滤(U)算法相比,TUCF算法的精确率和召回率分别提高了63%和69%;与具有平滑增强时间偏好的协同过滤(UTE)算法相比,TUCF算法的精确率和召回率分别提高了8%和12%;并且TUCF算法的平均绝对误差(MAE)比U算法和UTE算法分别减小了1.4%和0.5%。 相似文献
13.
针对目前协同过滤推荐精度受损,且出现冷启动的问题,提出一种经过改进的协同过滤推荐算法。其主要思想是针对两种不同情况的目标项目采用不同的相似性计算方法。一种项目为新项目,分别通过信息熵法和项目属性相似性计算项目评分,然后通过平衡因子实现新项目评分的组合;另一种项目为非新项目,通过权重因子动态组合项目的属性相似性和评分相似性,获得最近邻居的评分推荐。实验结果表明,该算法能提高推荐算法的稳定性和精确度,同时解决冷启动问题。 相似文献
14.
The concept of Privacy-Preserving has recently been proposed in response to the concerns of preserving personal or sensible
information derived from data mining algorithms. For example, through data mining, sensible information such as private information
or patterns may be inferred from non-sensible information or unclassified data. There have been two types of privacy concerning
data mining. Output privacy tries to hide the mining results by minimally altering the data. Input privacy tries to manipulate
the data so that the mining result is not affected or minimally affected.
For output privacy in hiding association rules, current approaches require hidden rules or patterns to be given in advance
[10, 18–21, 24, 27]. This selection of rules would require data mining process to be executed first. Based on the discovered
rules and privacy requirements, hidden rules or patterns are then selected manually. However, for some applications, we are
interested in hiding certain constrained classes of association rules such as collaborative recommendation association rules
[15, 22]. To hide such rules, the pre-process of finding these hidden rules can be integrated into the hiding process as long
as the recommended items are given. In this work, we propose two algorithms, DCIS (Decrease Confidence by Increase Support) and DCDS (Decrease Confidence by Decrease Support), to automatically hiding collaborative recommendation association rules without pre-mining and selection of hidden
rules. Examples illustrating the proposed algorithms are given. Numerical simulations are performed to show the various effects
of the algorithms. Recommendations of appropriate usage of the proposed algorithms based on the characteristics of databases
are reported.
Leon Wang received his Ph.D. in Applied Mathematics from State University of New York at Stony Brook in 1984. From 1984 to 1987, he
was an assistant professor in mathematics at University of New Haven, Connecticut, USA. From 1987 to 1994, he joined New York
Institute of Technology as a research associate in the Electromagnetic Lab and assistant/associate professor in the Department
of Computer Science. From 1994 to 2001, he joined I-Shou University in Taiwan as associate professor in the Department of
Information Management. In 1996, he was the Director of Computing Center. From 1997 to 2000, he was the Chairman of Department
of Information Management. In 2001, he was Professor and director of Library, all in I-Shou University. In 2002, he was Associate
Professor and Chairman in Information Management at National University of Kaohsiung, Taiwan. In 2003, he rejoined New York
Institute of Technology. Dr.Wang has published 33 journal papers, 102 conference papers, and 5 book chapters, in the areas
of data mining, machine learning, expert systems, and fuzzy databases, etc. Dr. Wang is a member of IEEE, Chinese Fuzzy System
Association Taiwan, Chinese Computer Association, and Chinese Information Management Association.
Ayat Jafari received the Ph.D. degree from City University of New York. He has conducted considerable research in the areas of Computer
Communication Networks, Local Area Networks, and Computer Network Security, and published many technical articles. His interests
and expertise are in the area of Computer Networks, Signal Processing, and Digital Communications. He is currently the Chairman
of the Computer Science and Electrical Engineering Department of New York Institute of Technology.
Tzung-Pei Hong received his B.S. degree in chemical engineering from National Taiwan University in 1985, and his Ph.D. degree in computer
science and information engineering from National Chiao-Tung University in 1992. He was a faculty at the Department of Computer
Science in Chung-Hua Polytechnic Institute from 1992 to 1994, and at the Department of Information Management in I-Shou University
from 1994 to 2001. He was in charge of the whole computerization and library planning for National University of Kaohsiung
in Preparation from 1997 to 2000, and served as the first director of the library and computer center in National University
of Kaohsiung from 2000 to 2001 and as the Dean of Academic Affairs from 2003 to 2006. He is currently a professor at the Department
of Electrical Engineering and at the Department of Computer Science and Information Engineering. His current research interests
include machine learning, data mining, soft computing, management information systems, and www applications. Springer 相似文献
15.
为解决时序模型不能有效获取用户和项目交互序列的语义关系,以及因参数共享而导致的信息丢失问题,提出基于自注意力的协同演进推荐模型(BSFRNN).将循环神经网络提取的序列特征和自注意力机制提取的语义特征进行融合表征用户以及项目的短期特征,将矩阵分解描述的长期特征和短期时序特征进行融合,将融合的特征向量通过多层感知机进行预... 相似文献
16.
协同过滤是迄今为止个性化推荐系统中采用最广泛最成功的推荐技术,但现有方法是将用户不同时间的兴趣等同考虑,时效性不足,而且推荐精度也有待进一步提高。鉴于此提出一种改进的协同过滤算法,针对用户近邻计算和项目评分的预测两个关键步骤,提出基于项目相关性的用户相似性计算方法,以便邻居用户更准确,同时在预测评分的过程中增加时间权限,使得接近采集时间的点击兴趣在推荐过程中具有更大权值。实验结果表明,该算法在提高了推荐精度的同时实现了实时推荐。 相似文献
17.
Multimedia Tools and Applications - As one of the most popular and successfully applied recommendation methods, collaborative filtering aims to extract low-dimensional user and item representation... 相似文献
18.
为提高社会化电子商务推荐服务的精确度和有效性,综合考虑交易评价得分、交易次数、交易金额、直接信任、推荐信任等影响社会化电子商务用户信任关系的因素,设计了一种信任感知协同过滤推荐方法.该方法利用置信因子计算用户间的信任关系,采用余弦相关度法计算用户间的相似度,引入调和因子综合用户信任关系和用户相似度对商品预测评分的影响,以平均绝对误差(MAE)、评分覆盖率和用户覆盖率作为评价指标.实验结果表明,与标准协同过滤推荐方法、基于规范矩阵因式分解的推荐方法相比,信任感知协同过滤推荐方法将MAE降低到0.162,并将评分覆盖率和用户覆盖率分别提高到77%和80%,能够解决交易评价较少商品的推荐问题. 相似文献
19.
The core of recommendation models is estimating the probability that a user will like an item based on historical interactions.Existing collaborative filtering ... 相似文献
20.
为提升推荐系统的准确率,针对传统协同过滤(CF)推荐算法没有有效使用位置信息的问题,提出了一种基于位置的非对称相似性度量的协同过滤推荐算法(LBASCF)。首先,分别利用用户-商品评分矩阵和用户历史消费位置,计算出用户间的余弦相似性和基于位置的非对称相似性;其次,将余弦相似性与基于位置的相似性融合,得到一个新的非对称用户相似性,融合后的相似性能够同时反映用户在位置上和兴趣上的偏好;最后,根据用户的最近邻居对商品的评分向用户推荐新的商品。用某点评数据集和Foursquare数据集对算法的有效性进行了评估。在某点评数据集实验结果证明,与CF相比,LBASCF的召回率和精确率分别提高了1.64%和0.37%;与位置感知协同过滤推荐系统(LARS)方法比较,LBASCF的召回率和精确率分别提高了1.53%和0.35%。实验结果表明,LBASCF相对于CF和LARS在基于位置服务的应用中能够有效提高系统的推荐质量。 相似文献