首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 31 毫秒
1.
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.  相似文献   

2.
Recommender Systems (RSs) aim to model and predict the user preference while interacting with items, such as Points of Interest (POIs). These systems face several challenges, such as data sparsity, limiting their effectiveness. In this paper, we address this problem by incorporating social, geographical, and temporal information into the Matrix Factorization (MF) technique. To this end, we model social influence based on two factors: similarities between users in terms of common check-ins and the friendships between them. We introduce two levels of friendship based on explicit friendship networks and high check-in overlap between users. We base our friendship algorithm on users’ geographical activity centers. The results show that our proposed model outperforms the state-of-the-art on two real-world datasets. More specifically, our ablation study shows that the social model improves the performance of our proposed POI recommendation system by 31% and 14% on the Gowalla and Yelp datasets in terms of Precision@10, respectively.  相似文献   

3.
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.  相似文献   

4.
In community-based social media, users consume content from multiple communities and provide feedback. The community-related data reflect user interests, but they are poorly used as additional information to enrich user-content interaction for content recommendation in existing studies. This paper employs an information seeking behavior perspective to describe user content consumption behavior in community-based social media, therefore revealing the relations between user, community and content. Based on that, the paper proposes a Community-aware Information Seeking based Content Recommender (abbreviated as CISCRec) to use the relations for better modeling user preferences on content and increase the reasoning on the recommendation results. CISCRec includes two key components: a two-level TransE prediction framework and interaction-aware embedding enhancement. The two-level TransE prediction framework hierarchically models users’ preferences for content by considering community entities based on the TransE method. Interaction-aware embedding enhancement is designed based on the analysis of users’ continued engagement in online communities, aiming to add expressiveness to embeddings in the prediction framework. To verify the effectiveness of the model, the real-world Reddit dataset (4,868 users, 115,491 contents, 850 communities, and 602,025 interactions) is chosen for evaluation. The results show that CISCRec outperforms 8 common baselines by 9.33%, 4.71%, 42.13%, and 14.36% on average under the Precision, Recall, MRR, and NDCG respectively.  相似文献   

5.
Given the dynamic nature of digital technologies, understanding why users intend to continue to use them or not is important for practitioners and academics alike. This paper presents an up-to-date Systematic Literature Review (SLR) of Continuance Intention (CI) for online technologies. The SLR classifies and analyses 147 relevant articles on CI in the field of online technology. It analyses papers according to the type of online technology as well as four groups of antecedents (psychological, technological, social, and behavioral) of CI and reviews the consequences of CI. Based on the SLR, the paper outlines two broad directions for future research relating to a conceptual framework and research design, highlighting promising research areas linked to the new features of emerging technologies, such as hyper-connectivity, and intention-behavior gaps.  相似文献   

6.
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 top_N 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.  相似文献   

7.
The rapid development of information technology and the fast growth of Internet have facilitated an explosion of information which has accentuated the information overload problem. Recommender systems have emerged in response to this problem and helped users to find their interesting contents. With increasingly complicated social context, how to fulfill personalized needs better has become a new trend in personalized recommendation service studies. In order to alleviate the sparsity problem of recommender systems meanwhile increase their accuracy and diversity in complex contexts, we propose a novel recommendation method based on social network using matrix factorization technique. In this method, we cluster users and consider a variety of complex factors. The simulation results on two benchmark data sets and a real data set show that our method achieves superior performance to existing methods.  相似文献   

8.
Learning latent representations for users and points of interests (POIs) is an important task in location-based social networks (LBSN), which could largely benefit multiple location-based services, such as POI recommendation and social link prediction. Many contextual factors, like geographical influence, user social relationship and temporal information, are available in LBSN and would be useful for this task. However, incorporating all these contextual factors for user and POI representation learning in LBSN remains challenging, due to their heterogeneous nature. Although the encouraging performance of POI recommendation and social link prediction are delivered, most of the existing representation learning methods for LBSN incorporate only one or two of these contextual factors. In this paper, we propose a novel joint representation learning framework for users and POIs in LBSN, named UP2VEC. In UP2VEC, we present a heterogeneous LBSN graph to incorporate all these aforementioned factors. Specifically, the transition probabilities between nodes inside the heterogeneous graph are derived by jointly considering these contextual factors. The latent representations of users and POIs are then learnt by matching the topological structure of the heterogeneous graph. For evaluating the effectiveness of UP2VEC, a series of experiments are conducted with two real-world datasets (Foursquare and Gowalla) in terms of POI recommendation and social link prediction. Experimental results demonstrate that the proposed UP2VEC significantly outperforms the existing state-of-the-art alternatives. Further experiment shows the superiority of UP2VEC in handling cold-start problem for POI recommendation.  相似文献   

9.
With the expansion of information on the web, recommendation systems have become one of the most powerful resources to ease the task of users. Traditional recommendation systems (RS) suggest items based only on feedback submitted by users in form of ratings. These RS are not competent to deal with definite user preferences due to emerging and situation dependent user-generated content on social media, these situations are known as contextual dimensions. Though the relationship between contextual dimensions and user’s preferences has been demonstrated in various studies, only a few studies have explored about prioritization of varying contextual dimensions. The usage of all contextual dimensions unnecessary raises the computational complexity and negatively influences the recommendation results. Thus, the initial impetus has been made to construct a neural network in order to determine the pertinent contextual dimensions. The experiments are conducted on real-world movies data-LDOS CoMoDa dataset. The results of neural networks demonstrate that contextual dimensions have a significant effect on users’ preferences which in turn exerts an intense impact on the satisfaction level of users. Finally, tensor factorization model is employed to evaluate and validate accuracy by including neural network’s identified pertinent dimensions which are modeled as tensors. The result shows improvement in recommendation accuracy by a wider margin due to the inclusion of the pertinent dimensions in comparison to irrelevant dimensions. The theoretical and managerial implications are discussed.  相似文献   

10.
Collaborative Filtering techniques have become very popular in the last years as an effective method to provide personalized recommendations. They generally obtain much better accuracy than other techniques such as content-based filtering, because they are based on the opinions of users with tastes or interests similar to the user they are recommending to. However, this is precisely the reason of one of its main limitations: the cold-start problem. That is, how to recommend new items, not yet rated, or how to offer good recommendations to users they have not information about. For example, because they have recently joined the system. In fact, the new user problem is particularly serious, because an unsatisfied user may stop using the system before it could even collect enough information to generate good recommendations. In this article we tackle this problem with a novel approach called “profile expansion”, based on the query expansion techniques used in Information Retrieval. In particular, we propose and evaluate three kinds of techniques: item-global, item-local and user-local. The experiments we have performed show that both item-global and user-local offer outstanding improvements in precision, up to 100%. Moreover, the improvements are statistically significant and consistent among different movie recommendation datasets and several training conditions.  相似文献   

11.
随着电子商务的迅速发展，推荐系统与算法已经成为理论研究的热点。支持向量机是一种强大的分类工具，由其衍生出的支持向量机回归方法能很好地解决非线性回归问题。文中以电影推荐为例，引入支持向量机回归方法来分析项目的内容，构建用户模型，进而给出推荐。实验结果和理论分析表明这种推荐算法与传统协同过滤算法相比，能够明显提高推荐精度，并显著缩短了推荐所需时间；在大样本量情况下也能同样高效。  相似文献   

12.
Recommender systems play an important role in reducing the negative impact of information overload on those websites where users have the possibility of voting for their preferences on items. The most normal technique for dealing with the recommendation mechanism is to use collaborative filtering, in which it is essential to discover the most similar users to whom you desire to make recommendations. The hypothesis of this paper is that the results obtained by applying traditional similarities measures can be improved by taking contextual information, drawn from the entire body of users, and using it to calculate the singularity which exists, for each item, in the votes cast by each pair of users that you wish to compare. As such, the greater the measure of singularity result between the votes cast by two given users, the greater the impact this will have on the similarity. The results, tested on the Movielens, Netflix and FilmAffinity databases, corroborate the excellent behaviour of the singularity measure proposed.  相似文献   

13.
张继东  蔡雪 《现代情报》2019,39(1):70-77
[目的/意义]本文以用户行为感知视角，研究影响移动社交网络主导型用户与浏览型用户持续使用的因素，为移动社交网络信息服务提供理论基础，并为移动社交网络提供商提出参考与应用借鉴。[方法/过程]分析移动社交网络主导型用户与浏览型用户持续使用意愿影响因素，引入相关变量，构建了基于用户行为感知的移动社交网络信息服务持续使用意愿模型并提出假设，最后通过结构方程模型进行实证分析。[结果/结论]感知有用性、感知易用性、感知娱乐、感知质量等因素均显著影响主导型及浏览型两类用户；服务质量、感知风险、知识获取、个人创新、社会认可、感知信任、感知转换成本等因素对两类用户有不同程度的影响。  相似文献   

14.
The widespread use of the Internet and the constant increase in users of social media platforms has made a large amount of textual data available. This represents a valuable source of information about the changes in people’s opinions and feelings. This paper presents the application of Emotional Text Mining (ETM) in the field of brand management. ETM is an unsupervised procedure aiming to profile social media users. It is based on a bottom-up approach to classify unstructured data for the identification of social media users’ representations and sentiments about a topic. It is a fast and simple procedure to extract meaningful information from a large collection of texts. As customer profiling is relevant for brand management, we illustrate a business application of ETM on Twitter messages concerning a well-known sportswear brand in order to show the potential of this procedure, highlighting the characteristics of Twitter user communities in terms of product preferences, representations, and sentiments.  相似文献   

15.
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.  相似文献   

16.
Recommender systems’ (RSs) research has mostly focused on algorithms aimed at improving platform owners’ revenues and user’s satisfaction. However, RSs have additional effects, which are related to their impact on users’ choices. In order to avoid an undesired system behaviour and anticipate the effects of an RS, the literature suggests employing simulations.In this article we present a novel, well grounded and flexible simulation framework. We adopt a stochastic user’s choice model and simulate users’ repeated choices for items in the presence of alternative RSs. Properties of the simulated choices, such as their diversity and their quality, are analysed. We state four research questions, also motivated by identified research gaps, which are addressed by conducting an experimental study where three different data sets and five alternative RSs are used. We identify some important effects of RSs. We find that non-personalised RSs result in choices for items that have a larger predicted rating compared to personalised RSs. Moreover, when a user’s awareness set, which is the set containing the items that she can choose from, increases, then choices are more diverse, but the average quality (rating) of the choices decreases. Additionally, in order to achieve a higher choice diversity, increasing the awareness of the users is shown to be a more effective remedy than increasing the number of recommendations offered to the users.  相似文献   

17.
胡昌龙 《情报科学》2021,39(9):131-138
【目的/意义】“信息过载”问题不利于用户快速准确获取目标信息,本文提出构建社交媒体基因图谱并应 用于信息推荐领域,为用户信息推荐提供新思路。【目的/意义】本文将社交媒体分解为社交媒体用户和社交信息内 容两大主体部分,借助生物学基因图谱概念,建立两大主体基因群并分别进行基因提取,构建社交媒体基因图谱, 并通过社交媒体基因图谱唯一辨识用户实体偏好进行信息推荐。【结果/结论】构建基于社交媒体基因图谱的信息 推荐模型,考虑用户内部及信息环境对基因图谱的影响,进行模型优化,为用户提供更加精准的信息推荐内容。【创 新/局限】基因的变异无法准确预估和控制,需要进一步研究引起基因变异的因素及变异方向,通过基因的可复制 性更加高效准确地对个人用户社交媒体基因图谱进行构建,进而实现其在信息推荐领域的应用。  相似文献   

18.
Developments in centrally managed communications (e.g. Twitter, Facebook) and service (e.g. Uber, airbnb) platforms, search engines and data aggregation (e.g. Google) as well as data analytics and artificial intelligence, have created an era of digital disruption during the last decade. Individual user profiles are produced by platform providers to make money from tracking, predicting, exploiting and influencing their users’ decision preferences and behavior, while product and service providers transform their business models by targeting potential customers with more accuracy. There have been many social and economic benefits to this digital disruption, but it has also largely contributed to the digital destruction of mental model alignment and shared situational awareness through the propagation of mis-information i.e. reinforcement of dissonant mental models by recommender algorithms, bots and trusted individual platform users (influencers). To mitigate this process of digital destruction, new methods and approaches to the centralized management of these platforms are needed to build on and encourage trust in the actors that use them (and by association trust in their mental models). The global ‘infodemic’ resulting from the COVID-19 pandemic of 2020, highlights the current problem confronting the information system discipline and the urgency of finding workable solutions.  相似文献   

19.
Recommender system as an effective method to reduce information overload has been widely used in the e-commerce field. Existing studies mainly capture semantic features by considering user-item interactions or behavioral history records, which ignores the sparsity of interactions and the drift of user preferences. To cope with these challenges, we introduce the recently popular Graph Neural Networks (GNN) and propose an Interest Evolution-driven Gated Neighborhood (IEGN) aggregation representation model which can capture accurate user representation and track the evolution of user interests. Specifically, in IEGN, we explicitly model the relational information between neighbor nodes by introducing the gated adaptive propagation mechanism. Then, a personalized time interval function is designed to track the evolution of user interests. In addition, a high-order convolutional pooling operation is used to capture the correlation among the short-term interaction sequence. The user preferences are predicted by the fusion of user dynamic preferences and short-term interaction features. Extensive experiments on Amazon and Alibaba datasets show that IEGN outperforms several state-of-the-art methods in recommendation tasks.  相似文献   

20.
Graph-based recommendation approaches use a graph model to represent the relationships between users and items, and exploit the graph structure to make recommendations. Recent graph-based recommendation approaches focused on capturing users’ pairwise preferences and utilized a graph model to exploit the relationships between different entities in the graph. In this paper, we focus on the impact of pairwise preferences on the diversity of recommendations. We propose a novel graph-based ranking oriented recommendation algorithm that exploits both explicit and implicit feedback of users. The algorithm utilizes a user-preference-item tripartite graph model and modified resource allocation process to match the target user with users who share similar preferences, and make personalized recommendations. The principle of the additional preference layer is to capture users’ pairwise preferences, provide detailed information of users for further recommendations. Empirical analysis of four benchmark datasets demonstrated that our proposed algorithm performs better in most situations than other graph-based and ranking-oriented benchmark algorithms.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号