共查询到20条相似文献，搜索用时 31 毫秒
1.
Sajad Ahmadian Majid Meghdadi Mohsen Afsharchi 《Information processing & management》2018,54(4):707-725
Recommender systems are techniques to make personalized recommendations of items to users. In e-commerce sites and online sharing communities, providing high quality recommendations is an important issue which can help the users to make effective decisions to select a set of items. Collaborative filtering is an important type of the recommender systems that produces user specific recommendations of the items based on the patterns of ratings or usage (e.g. purchases). However, the quality of predicted ratings and neighbor selection for the users are important problems in the recommender systems. Selecting suitable neighbors set for the users leads to improve the accuracy of ratings prediction in recommendation process. In this paper, a novel social recommendation method is proposed which is based on an adaptive neighbor selection mechanism. In the proposed method first of all, initial neighbors set of the users is calculated using clustering algorithm. In this step, the combination of historical ratings and social information between the users are used to form initial neighbors set for the users. Then, these neighbor sets are used to predict initial ratings of the unseen items. Moreover, the quality of the initial predicted ratings is evaluated using a reliability measure which is based on the historical ratings and social information between the users. Then, a confidence model is proposed to remove useless users from the initial neighbors of the users and form a new adapted neighbors set for the users. Finally, new ratings of the unseen items are predicted using the new adapted neighbors set of the users and the interested items are recommended to the active user. Experimental results on three real-world datasets show that the proposed method significantly outperforms several state-of-the-art recommendation methods. 相似文献
2.
针对创新社区日益增长的海量信息阻碍了用户对知识进行有效获取和创造的现状,将模糊形式概念分析（FFCA）理论应用于创新社区领先用户的个性化知识推荐研究。首先识别出创新社区领先用户并对其发帖内容进行文本挖掘得到用户——知识模糊形式背景,然后构建带有相似度的模糊概念格对用户偏好进行建模,最后基于模糊概念格和协同过滤的推荐算法为领先用户提供个性化知识推荐有序列表。以手机用户创新社区为例,验证了基于FFCA的领先用户个性化知识推荐方法的可行性,有助于满足用户个性化知识需求,促进用户更好地参与社区知识创新。 相似文献
3.
[目的/意义]为提高知识付费平台用户感知服务质量,文章构建了融合用户画像与协同过滤的个性化推荐模型。[方法/过程]首先根据用户特性构建画像标签体系,利用TF-IDF、熵值法、k-means等方法确定用户特征标签;其次分别基于用户画像与改进后的协同过滤算法计算用户相似度,通过调和权重得到用户综合相似度;最后利用Top-N进行个性化推荐。[结果/讨论]通过知乎live付费用户信息进行验证,发现本文算法在推荐结果的准确率以及召回率上,相比其单一方法均有较大提升,且满意度高于知乎live平台。 相似文献
4.
Modeling user profiles is a necessary step for most information filtering systems – such as recommender systems – to provide personalized recommendations. However, most of them work with users or items as vectors, by applying different types of mathematical operations between them and neglecting sequential or content-based information. Hence, in this paper we study how to propose an adaptive mechanism to obtain user sequences using different sources of information, allowing the generation of hybrid recommendations as a seamless, transparent technique from the system viewpoint. As a proof of concept, we develop the Longest Common Subsequence (LCS) algorithm as a similarity metric to compare the user sequences, where, in the process of adapting this algorithm to recommendation, we include different parameters to control the efficiency by reducing the information used in the algorithm (preference filter), to decide when a neighbor is considered useful enough to be included in the process (confidence filter), to identify whether two interactions are equivalent (δ-matching threshold), and to normalize the length of the LCS in a bounded interval (normalization functions). These parameters can be extended to work with any type of sequential algorithm.We evaluate our approach with several state-of-the-art recommendation algorithms using different evaluation metrics measuring the accuracy, diversity, and novelty of the recommendations, and analyze the impact of the proposed parameters. We have found that our approach offers a competitive performance, outperforming content, collaborative, and hybrid baselines, and producing positive results when either content- or rating-based information is exploited. 相似文献
5.
《Information processing & management》2016,52(3):459-477
Nowadays, the increasing demand for group recommendations can be observed. In this paper we address the problem of recommendation performance for groups of users (group recommendation). We focus on the performance of very Top-N recommendations, which are important when recommending the long lasting items (only a few such items are consumed per session, e.g. movie). To improve existing group recommenders we propose a mixed hybrid recommender for groups combining content-based and collaborative strategies. The principle of proposed group recommender is to generate content and collaborative recommendations for each user, apply an aggregation strategy to solve the group conflict preferences for the content and collaborative sets separately, and finally reorder the collaborative candidates based on the content-based ones. It is based on an idea that candidates recommended by both recommendation strategies at the same time are presumably more appropriate for the group than the candidates recommended by individual strategies. The evaluation is performed by several experiments in the multimedia domain (as typical representative for group recommendations). Both, online and offline experiments were performed in order to compare real users’ satisfaction to the standard group recommenders and also, to compare performance of proposed approach to the state-of-the-art recommenders based on the MovieLens dataset. Finally, we experimented with the proposed hybrid recommender to generate the recommendation for a group of size one (i.e. single user recommendation). Obtained results, support our hypothesis that proposed mixed hybrid approach improves the precision of the recommendation for groups of users and for the single-user recommendation respectively on very Top-N recommended items. 相似文献
6.
《Information processing & management》2022,59(2):102842
The matrix factorization model based on user-item rating data has been widely studied and applied in recommender systems. However, data sparsity, the cold-start problem, and poor explainability have restricted its performance. Textual reviews usually contain rich information about items’ features and users’ sentiments and preferences, which can solve the problem of insufficient information from only user ratings. However, most recommendation algorithms that take sentiment analysis of review texts into account are either fine- or coarse-grained, but not both, leading to uncertain accuracy and comprehensiveness regarding user preference. This study proposes a deep learning recommendation model (i.e., DeepCGSR) that integrates textual review sentiments and the rating matrix. DeepCGSR uses the review sets of users and items as a corpus to perform cross-grained sentiment analysis by combining fine- and coarse-grained levels to extract sentiment feature vectors for users and items. Deep learning technology is used to map between the extracted feature vector and latent factor through the rating-based matrix factorization model and obtain deep, nonlinear features to predict the user's rating of an item. Iterative experiments on e-commerce datasets from Amazon show that DeepCGSR consistently outperforms the recommendation models LFM, SVD++, DeepCoNN, TOPICMF, and NARRE. Overall, comparing with other recommendation models, the DeepCGSR model demonstrated improved evaluation results by 14.113% over LFM, 13.786% over SVD++, 9.920% over TOPICMF, 5.122% over DeepCoNN, and 2.765% over NARRE. Meanwhile, the DeepCGSR has great potential in fixing the overfitting and cold-start problems. Built upon previous studies and findings, the DeepCGSR is the state of the art, moving the design and development of the recommendation algorithms forward with improved recommendation accuracy. 相似文献
7.
[目的/意义]将情境感知技术引入图书馆以提高服务的智能化，已成为数字图书馆的发展趋势之一。为了提高情境感知模型中推荐结果的准确度。[方法/过程]本文研究并提出了一种融合了朴素贝叶斯算法与情景感知功能的协同推荐模型，并通过实验对推荐效果进行了评估。具体为：首先，获取用户的当前任务和情景信息，同时提取历史信息库用户的行为偏好；其次基于属性加权贝叶斯算法计算用户的行为相似度，继而进行协同推荐；通过计算目标情景中所有情景属性对所推荐资源的影响的权值，对协同推荐所得评分进行加权处理，形成最终的预测预测；最后通过实验对模型进行检验。[结果/结论]结果表明：使用该模型得出的推荐结果优于传统的协同推荐结果。因此该模型能够更好地为为个性化信息服务提供支持。 相似文献
8.
[目的/意义]在社会化标注系统自组织运行的基础上，构建个性化信息推荐的多维度融合与优化模型，进而在大数据环境下，为用户提供精准的个性化信息推荐服务，从而进一步丰富个性化信息推荐的理论体系以及拓展个性化信息推荐的研究方法。[方法/过程]首先，对每一种个性化信息推荐方法的优点和不足进行深入分析；然后，将基于图论（社会网络关系）、基于协同过滤以及基于内容（主题）3种个性化信息推荐方法进行多维度深度融合，构建个性化信息推荐多维度融合模型；最后，对社会化标注系统中个性化信息推荐多维度融合模型进行优化，从而解决个性化推荐过程中用户"冷启动"、数据稀疏性和用户偏好漂移等问题。[结果/结论]通过综合考虑现有的基于图论（社会网络关系）、基于协同过滤以及基于内容（主题）的个性化信息推荐方法各自的贡献和不足，实现3种方法之间的多维度深度融合，并结合心理认知、用户情境以及时间、空间等优化因素，最终构建出社会化标注系统中个性化信息推荐多维度融合与优化模型。 相似文献
9.
互联网时代,个性化推荐系统逐渐被应用到各个不同的领域,随之个性化推荐算法也成为目前研究的热点。然而,传统的推荐算法往往存在着冷启动、数据稀疏等问题。本文在对传统推荐算法研究的基础上,提出了一种基于相似传播和情景聚类的协同过滤推荐算法,根据计算用户间的情景相似度对用户进行聚类,然后根据相似传播原理找出目标用户更多的最近邻居,最后根据预测目标用户对项目的评分进行推荐。借助网上公共数据集在Matlab上实现了该算法并验证了算法的有效性。实验结果表明,本文所提算法的准确性相比传统算法有所提高,同时缓解了传统推荐算法存在的冷启动和数据稀疏性等问题。 相似文献
10.
《Information processing & management》2022,59(3):102936
Session-based recommendation aims to predict items that a user will interact with based on historical behaviors in anonymous sessions. It has long faced two challenges: (1) the dynamic change of user intents which makes user preferences towards items change over time; (2) the uncertainty of user behaviors which adds noise to hinder precise preference learning. They jointly preclude recommender system from capturing real intents of users. Existing methods have not properly solved these problems since they either ignore many useful factors like the temporal information when building item embeddings, or do not explicitly filter out noisy clicks in sessions. To tackle above issues, we propose a novel Dynamic Intent-aware Iterative Denoising Network (DIDN) for session-based recommendation. Specifically, to model the dynamic intents of users, we present a dynamic intent-aware module that incorporates item-aware, user-aware and temporal-aware information to learn dynamic item embeddings. A novel iterative denoising module is then devised to explicitly filter out noisy clicks within a session. In addition, we mine collaborative information to further enrich the session semantics. Extensive experimental results on three real-world datasets demonstrate the effectiveness of the proposed DIDN. Specifically, DIDN obtains improvements over the best baselines by 1.66%, 1.75%, and 7.76% in terms of P@20 and 1.70%, 2.20%, and 10.48% in terms of MRR@20 on all datasets. 相似文献
11.
《Information processing & management》2019,56(3):526-540
Recommender Systems deal with the issue of overloading information by retrieving the most relevant sources in the wide range of web services. They help users by predicting their interests in many domains like e-government, social networks, e-commerce and entertainment. Collaborative Filtering (CF) is the most promising technique used in recommender systems to give suggestions based on liked-mind users’ preferences. Despite the widespread use of CF in providing personalized recommendation, this technique has problems including cold start, data sparsity and gray sheep. Eventually, these problems lead to the deterioration of the efficiency of CF. Most existing recommendation methods have been proposed to overcome the problems of CF. However, they fail to suggest the top-n recommendations based on the sequencing of the users’ priorities. In this research, to overcome the shortcomings of CF and current recommendation methods in ranking preference dataset, we have used a new graph-based structure to model the users’ priorities and capture the association between users and items. Users’ profiles are created based on their past and current interest. This is done because their interest can change with time. Our proposed algorithm keeps the preferred items of active user at the beginning of the recommendation list. This means these items come under top-n recommendations, which results in satisfaction among users. The experimental results demonstrate that our algorithm archives the significant improvement in comparison with CF and other proposed recommendation methods in terms of recall, precision, f-measure and MAP metrics using two benchmark datasets including MovieLens and Superstore. 相似文献
12.
《Information processing & management》2023,60(3):103256
Music has a close relationship with people's emotion and mental status. Music recommendation has both economic and social benefits. Unfortunately, most existing music recommendation methods were constructed based on genre features (e.g., style and album), which cannot meet the emotional needs of listeners. Furthermore, the “filter bubble” effect may make the situation even worse, when a user seeks music for emotional support. In this study, we designed a novel emotion-based personalized music recommendation framework to meet users’ emotional needs and help improve their mental status. In our framework, we designed a LSTM-based model to select the most suitable music based on users’ mood in previous period and current emotion stimulus. A care factor was used to adjust the results so that users’ mental status could be improved by the recommendation. The empirical experiments and user study showed that the recommendations of our novel framework are precise and helpful for users. 相似文献
13.
《Information processing & management》2020,57(6):102310
This paper presents a novel genetic-based recommender system (BLIGA) that depends on the semantic information and historical rating data. The main contribution of this research lies in evaluating the possible recommendation lists instead of evaluating items then forming the recommendation list. BLIGA utilizes the genetic algorithm to find the best list of items to the active user. Thus, each individual represents a candidate recommendation list. BLIGA hierarchically evaluates the individuals using three fitness functions. The first function uses semantic information about items to estimates the strength of the semantic similarity between items. The second function estimates the similarity in satisfaction level between users. The third function depends on the predicted ratings to select the best recommendation list.BLIGA results have been compared against recommendation results from alternative collaborative filtering methods. The results demonstrate the superiority of BLIGA and its capability to achieve more accurate predictions than the alternative methods regardless of the number of K-neighbors. 相似文献
14.
【目的/意义】通过订阅记录获取用户兴趣爱好,并将协同过滤推荐方法应用于图书个性化推荐,为读者提供优质服务。【方法/过程】以协同过滤算法为基础,根据用户订阅记录,分别计算用户相似性和订阅图书相似性。针对传统协同过滤方法在计算热门订阅相似度时存在的缺陷,引入对订阅权重的惩罚机制,减轻了热门订阅会和很多订阅相似的可能性,并根据协同过滤方法,产生相应推荐结果。【结果/结论】运用公开可获取的数据集进行的算法验证表明,基于订阅记录的协同过滤算法推荐准确度较高,对提升用户图书借阅体验相关研究与实践有一定的参考价值。 相似文献
15.
数字图书馆的个性化推荐策略 总被引：2，自引：0，他引：2
本文研究了数字图书馆领域的个性化推荐服务，根据用户描述文件和资源描述文件这两个初始模型，利用协同过滤技术，提出了3种相似性的推荐算法，从而为用户提供个性化推荐服务。 相似文献
16.
《Information processing & management》2020,57(2):102142
With the information explosion of news articles, personalized news recommendation has become important for users to quickly find news that they are interested in. Existing methods on news recommendation mainly include collaborative filtering methods which rely on direct user-item interactions and content based methods which characterize the content of user reading history. Although these methods have achieved good performances, they still suffer from data sparse problem, since most of them fail to extensively exploit high-order structure information (similar users tend to read similar news articles) in news recommendation systems. In this paper, we propose to build a heterogeneous graph to explicitly model the interactions among users, news and latent topics. The incorporated topic information would help indicate a user’s interest and alleviate the sparsity of user-item interactions. Then we take advantage of graph neural networks to learn user and news representations that encode high-order structure information by propagating embeddings over the graph. The learned user embeddings with complete historic user clicks capture the users’ long-term interests. We also consider a user’s short-term interest using the recent reading history with an attention based LSTM model. Experimental results on real-world datasets show that our proposed model significantly outperforms state-of-the-art methods on news recommendation. 相似文献
17.
基于协同过滤（CF）的个性化推荐技术,提出一种移动设备个性化软件推荐系统.该系统根据协同过滤的理论,首先通过软件类别兴趣相似度的计算,筛选出软件类别相似的用户候选集,过滤所有移动用户,减小产生的用户候选推荐集;然后对用户候选推荐集进行最近邻居的相似性计算以找出目标用户的邻居集合,并且对邻居集合中的邻居评分进行实时更新;最后根据兴趣相似度最大的K个邻居形成目标用户的Top-N推荐集.在第三方手机软件管理平台上通过监测推荐软件的下载或浏览量,验证系统的有效性和准确性. 相似文献
18.
《International Journal of Information Management》2016,36(3):397-402
Online video recommender systems help users find videos suitable for their preferences. However, they have difficulty in identifying dynamic user preferences. In this study, we propose a new recommendation procedure using changes of users’ facial expressions captured every moment. Facial expressions portray the users’ actual emotions about videos. We can utilize them to discover dynamic user preferences. Further, because the proposed procedure does not rely on historical rating or purchase records, it properly addresses the new user problem, that is, the difficulty in recommending products to users whose past rating or purchase records are not available. To validate the recommendation procedure, we conducted experiments with footwear commercial videos. Experiment results show that the proposed procedure outperforms benchmark systems including a random recommendation, an average rating approach, and a typical collaborative filtering approach for recommendation to both new and existing users. From the results, we conclude that facial expressions are a viable element in recommendation. 相似文献
19.
《Information processing & management》2020,57(6):102304
The way that users provide feedback on items regarding their satisfaction varies among systems: in some systems, only explicit ratings can be entered; in other systems textual reviews are accepted; and in some systems, both feedback types are accommodated. Recommender systems can readily exploit explicit ratings in the rating prediction and recommendation formulation process, however textual reviews -which in the context of many social networks are in abundance and significantly outnumber numeric ratings- need to be converted to numeric ratings. While numerous approaches exist that calculate a user's rating based on the respective textual review, all such approaches may introduce errors, in the sense that the process of rating calculation based on textual reviews involves an uncertainty level, due to the characteristics of the human language, and therefore the calculated ratings may not accurately reflect the actual ratings that the corresponding user would enter. In this work (1) we examine the features of textual reviews, which affect the reliability of the review-to-rating conversion procedure, (2) we compute a confidence level for each rating, which reflects the uncertainty level for each conversion process, (3) we exploit this metric both in the users’ similarity computation and in the prediction formulation phases in recommender systems, by presenting a novel rating prediction algorithm and (4) we validate the accuracy of the presented algorithm in terms of (i) rating prediction accuracy, using widely-used recommender systems datasets and (ii) recommendations generated for social network user satisfaction and precision, where textual reviews are abundant. 相似文献
20.
《Information processing & management》2023,60(5):103439
Graph neural networks have been frequently applied in recommender systems due to their powerful representation abilities for irregular data. However, these methods still suffer from the difficulties such as the inflexible graph structure, sparse and highly imbalanced data, and relatively shallow networks, limiting rate prediction ability for recommendations. This paper presents a novel deep dynamic graph attention framework based on influence and preference relationship reconstruction (DGA-IPR) for recommender systems to learn optimal latent representations of users and items. The entire framework involves a user branch and an item branch. An influence-based dynamic graph attention (IDGA) module, a preference-based dynamic graph attention (PDGA) module, and an adaptive fine feature extraction (AFFE) module are respectively constructed for each branch. Concretely, the first two attention modules concentrate on reconstructing influence and preference relationship graphs, breaking imbalanced and fixed constraints of graph structures. Then a deep feature aggregation block and an adaptive feature fusion operation are built, improving the network depth and capturing potential high-order information expressions. Besides, AFFE is designed to acquire finer latent features for users and items. The DGA-IPR architecture is formed by integrating IDGA, PDGA, and AFFE for users and items, respectively. Experiments reveal the superiority of DGA-IPR over existing recommendation models. 相似文献