基于贝叶斯后验概率和非合作博弈的推荐算法

针对传统协同过滤推荐算法推荐精度较低等问题,提出一种基于贝叶斯后验概率预测和非合作博弈的个性化推荐算法。采用文件主题模型求取用户与其参加过的所有社交活动的主题分布,利用隐含主题概率分布表征用户兴趣度,根据信任传递机制求取用户的直接信任和间接信任,形成用户间的信任度;将用户的兴趣度和信任度等隐式特征赋予合理的先验分布,利用贝叶斯后验概率预测隐式特征后的显式反馈;依据显式反馈将推荐结果转化为非合作博弈中用户效益最大化的纳什均衡求解。仿真对比实验表明,与其他三种推荐算法相比该算法的查准率至少提高了3.13%,查全率至少提高了2.62%。     

Web日志在协同过滤推荐算法中的应用

协同过滤算法近年来在电子商务推荐系统中得到了广泛的应用,但该算法也存在数据稀疏性和缺乏个性化等问题,这些问题影响了推荐算法的效率和准确性。主要针对以上问题,提出引入Web日志分析的协同过滤算法,将用户对商品的隐性兴趣转化为显性兴趣,同时利用用户聚类等相关技术,不仅解决数据稀疏的问题也提高推荐的准确性。     

Hybrid recommendation system based on semantic interest community and trusted neighbors

The accuracy of a recommendation is an important index to evaluate the performance of a recommendation system. The personalized recommendation system tends to pay too much attention to the accuracy of recommendation results and often neglects the diversity of the recommendation results. In this paper, domain ontology is used to construct the user interest model, and the integrated ontology-based semantic similarity algorithm is used to obtain the user ontology set. Then, the semantic interest community is constructed through the hierarchical clustering method. Users with a high degree of diversity are selected as trusted neighbors to construct a hybrid recommendation model with a combination of accuracy and diversity. The experimental results show that the hybrid model can improve the diversity of the recommendation system by adjusting the weight factor while having less influence on the accuracy.     

Learning and inferencing in user ontology for personalized Semantic Web search

User modeling is aimed at capturing the users’ interests in a working domain, which forms the basis of providing personalized information services. In this paper, we present an ontology based user model, called user ontology, for providing personalized information service in the Semantic Web. Different from the existing approaches that only use concepts and taxonomic relations for user modeling, the proposed user ontology model utilizes concepts, taxonomic relations, and non-taxonomic relations in a given domain ontology to capture the users’ interests. As a customized view of the domain ontology, a user ontology provides a richer and more precise representation of the user’s interests in the target domain. Specifically, we present a set of statistical methods to learn a user ontology from a given domain ontology and a spreading activation procedure for inferencing in the user ontology. The proposed user ontology model with the spreading activation based inferencing procedure has been incorporated into a semantic search engine, called OntoSearch, to provide personalized document retrieval services. The experimental results, based on the ACM digital library and the Google Directory, support the efficacy of the user ontology approach to providing personalized information services.     

Effective Tag Recommendation System Based on Topic Ontology Using Wikipedia and WordNet

In this paper, we proposed a novel approach based on topic ontology for tag recommendation. The proposed approach intelligently generates tag suggestions to blogs. In this approach, we construct topic ontology through enriching the set of categories in existing small ontology called as Open Directory Project. To construct topic ontology, a set of topics and their associated semantic relationships is identified automatically from the corpus‐based external knowledge resources such as Wikipedia and WordNet. The construction relies on two folds such as concept acquisition and semantic relation extraction. In the first fold, a topic‐mapping algorithm is developed to acquire the concepts from the semantic of Wikipedia. A semantic similarity‐clustering algorithm is used to compute the semantic similarity measure to group the set of similar concepts. The second is the semantic relation extraction algorithm, which derives associated semantic relations between the set of extracted topics from the lexical patterns between synsets in WordNet. A suitable software prototype is created to implement the topic ontology construction process. A Jena API framework is used to organize the set of extracted semantic concepts and their corresponding relationship in the form of knowledgeable representation of Web ontology language. Thus, Protégé tool provides the platform to visualize the automatically constructed topic ontology successfully. Using the constructed topic ontology, we can generate and suggest the most suitable tags for the new resource to users. The applicability of topic ontology with a spreading activation algorithm supports efficient recommendation in practice that can recommend the most popular tags for a specific resource. The spreading activation algorithm can assign the interest scores to the existing extracted blog content and tags. The weight of the tags is computed based on the activation score determined from the similarity between the topics in constructed topic ontology and content of the existing blogs. High‐quality tags that has the highest activation score is recommended to the users. Finally, we conducted experimental evaluation of our tag recommendation approach using a large set of real‐world data sets. Our experimental results explore and compare the capabilities of our proposed topic ontology with the spreading activation tag recommendation approach with respect to the existing AutoTag mechanism. And also discuss about the improvement in precision and recall of recommended tags on the data sets of Delicious and BibSonomy. The experiment shows that tag recommendation using topic ontology results in the folksonomy enrichment. Thus, we report the results of an experiment mean to improve the performance of the tag recommendation approach and its quality.     

Self-monitoring,honesty, and cue use on Facebook: The relationship with user extraversion and conscientiousness

The present study explored the relationship between Facebook (FB) users’ self-monitoring and self-reported FB honesty and the content of users’ profiles. It was anticipated that high self-monitors would construct a more extraverted profile and honest FB users would construct a more conscientious profile. A content analysis of 53 cues on participants’ FB profiles (N = 100) was conducted. Supporting evidence was shown in a lens model analysis of FB user profiles and strangers’ (N = 35) impressions of users’ personality. User self-monitoring was uniquely associated with three FB cues: posting a profile picture at a younger age, posting more frequently, and using more shorthand in status updates. These three cues informed strangers’ estimations of user extraversion, but were unrelated to estimations of users’ conscientiousness. Honesty on FB was uniquely associated with three cues that informed strangers’ estimations of user conscientiousness: expressing positive affect and talking more about family in status updates, and having FB friends who expressed support in response to status updates. This study demonstrated that FB use and profile page construction were associated with FB users’ personality, and the construction of profiles affected strangers’ perceptions of FB users.     

面向移动应用的探索式个性化服务推荐方法

个性化推荐系统是应用系统中广泛应用的技术之一,用户兴趣偏好模型的建立与更新是个性化推荐系统的关键环节,针对移动设备位置随时变化的特点,以移动端的应用系统为研究对象,提出了一种随用户位置变化而动态更新的用户兴趣偏好模型,并对实现过程中的几个关键问题,包括用户兴趣偏好模型表示方法、用户兴趣关键字提取、用户兴趣偏好模型的建立与更新算法进行了详细描述,最后利用用户兴趣偏好模型根据协同过滤算法进行个性化推荐,并根据用户对推荐结果的评价进一步修正用户兴趣偏好模型.用户兴趣偏好模型采用基于兴趣关键字的向量空间模型表示,用户兴趣关键字由根据TF-IDF算法获得的用户隐式兴趣和用户参与的显式兴趣相结合获得,用户位置信息变化时,系统获取当前位置附近的服务,对已存在于用户兴趣关键树中的服务权值进行增强,而对不存在其中的进行遗忘以调整用户兴趣树从而更新用户兴趣偏好模型.验证表明,该方法推荐的服务更符合用户所处的位置上下文环境,并且具有高度的可达性.     

融合地理信息、种类信息与隐式社交关系的兴趣点推荐算法

针对现有大多数兴趣点推荐算法都存在签到数据稀疏、社交关系难以获取、用户个性难以考虑等问题,文中提出融合地理信息、种类信息与隐式社交关系的兴趣点推荐算法.首先考虑用户签到种类信息,同时分解用户签到地点矩阵和用户签到种类矩阵,减小签到数据稀疏带来的影响.再在显式社交关系的基础上,使用信息熵的方法度量用户的隐式社交关系,缓解社交网络稀疏的问题,并通过正则化的方法在矩阵分解模型中加入该隐式社交关系.最后,使用自适应核密度估计方法个性化建模地理信息对用户签到行为的影响,提高推荐的准确性.在Foursquare、Yelp数据集上的实验验证文中算法的有效性.     

EARS: Emotion-aware recommender system based on hybrid information fusion

Recommender systems suggest items that users might like according to their explicit and implicit feedback information, such as ratings, reviews, and clicks. However, most recommender systems focus mainly on the relationships between items and the user’s final purchasing behavior while ignoring the user’s emotional changes, which play an essential role in consumption activity. To address the challenge of improving the quality of recommender services, this paper proposes an emotion-aware recommender system based on hybrid information fusion in which three representative types of information are fused to comprehensively analyze the user’s features: user rating data as explicit information, user social network data as implicit information and sentiment from user reviews as emotional information. The experimental results verify that the proposed approach provides a higher prediction rating and significantly increases the recommendation accuracy.     

基于用户信任和兴趣的概率矩阵分解推荐方法

传统协同过滤推荐算法存在数据稀疏性、冷启动、新用户等问题.随着社交网络和电子商务的迅猛发展,利用用户间的信任关系和用户兴趣提供个性化推荐成为研究的热点.本文提出一种结合用户信任和兴趣的概率矩阵分解（STUIPMF）推荐方法.该方法首先从用户评分角度挖掘用户间的隐性信任关系和潜在兴趣标签,然后利用概率矩阵分解模型对用户评分信息、用户信任关系、用户兴趣标签信息进行矩阵分解,进一步挖掘用户潜在特征,缓解数据稀疏性.在Epinions数据集上进行实验验证,结果表明,该方法能够在一定程度上提高推荐精度,缓解冷启动和新用户问题,同时具有较好的可扩展性.     

融合用户评分与显隐兴趣相似度的协同过滤推荐算法

协同过滤算法是推荐系统中使用最广泛的算法,其核心是利用某兴趣爱好相似的群体来为用户推荐感兴趣的信息。传统的协同过滤算法利用用户-项目评分矩阵计算相似度,通过相似度寻找用户的相似群体来进行推荐,但是由于其评分矩阵的稀疏性问题,对相似度的计算不够准确,这间接导致推荐系统的质量下降。为了缓解数据稀疏性对相似度计算的影响并提高推荐质量,提出了一种融合用户评分与用户显隐兴趣的相似度计算方法。该方法首先利用用户-项目评分矩阵计算用户评分相似度;然后根据用户基本属性与用户-项目评分矩阵得出项目隐性属性;之后综合项目类别属性、项目隐性属性、用户-项目评分矩阵和用户评分时间,得到用户显隐兴趣相似度;最后融合用户评分相似度和用户显隐兴趣相似度得到用户相似度,并以此相似度寻找用户的相似群体以进行推荐。在数据集Movielens上的实验结果表明,相比传统算法中仅使用单一的评分矩阵来计算相似度,提出的新相似度计算方法不仅能够更加准确地寻找到用户的相似群体,而且还能够提供更好的推荐质量。     

基于本体的用户兴趣模型构建研究

针对用户兴趣模型中本体构建和模型更新的难点和不足,提出一种基于本体论的用户兴趣模型构建方法,该方法通过领域本体、用户个性本体、校正本体和本体更新实现模型的构建。对于领域本体的构建,摒弃了训练、学习和聚类的方法,直接从开放目录专案获取类目。对于用户兴趣的更新,采用按照校正本体增加、淘汰和传递原理调整相结合的方式。实验结果表明,该模型较易生成,用户兴趣的准确度和更新的及时性都有所提高。     

一种融合多因素社交活动个性化推荐模型

针对当前网络社交活动个性化推荐精度较低的问题,融合用户对活动兴趣度、召集者影响力以及地理位置偏好等三方面因素,提出一种融合多因素社交活动个性推荐模型。采用LDA文件主题模型求取用户与其参加过的所有社交活动的主题分布,利用隐含主题概率分布来表征用户的兴趣度,并构建用户与召集者间的影响力矩阵。根据活动举办地与用户常住地,建立距离幂律分布,并结合用户参加活动的频数,建立用户地理位置偏好概率模型。采用不同权值配比,综合三方面的因素形成最终的社交活动个性推荐。对比实验表明,该算法与三个因素个性推荐算法相比,准确率至少提高了36.7%,召回率至少提高了35.9%;与其他两个同类网络社交活动推荐算法相比准确率至少提高了8.77%,召回率至少提高了8.57%。     

结合用户兴趣度聚类的协同过滤推荐算法

针对传统的协同过滤算法忽略了用户兴趣源于关键词以及数据稀疏的问题,提出了结合用户兴趣度聚类的协同过滤推荐算法。利用用户对项目的评分,并从项目属性中提取关键词,提出了一种新的RF-IIF （rating frequency-inverse item frequency）算法,根据目标用户对某关键词的评分频率和该关键词被所有用户的评分频率,得到用户对关键词的偏好,形成用户—关键词偏好矩阵,并在该矩阵基础上进行聚类。然后利用logistic函数得到用户对项目的兴趣度,明确用户爱好,在类簇中寻找目标用户的相似用户,提取邻居爱好的前◢N◣个物品对用户进行推荐。实验结果表明,算法准确率始终优于传统算法,对用户爱好判断较为准确,缓解了数据稀疏问题,有效提高了推荐的准确率和效率。     

基于图嵌入的用户加权Slope One算法

针对传统Slope One推荐算法在稀疏数据集上预测准确率较低的问题,提出一种基于图嵌入的加权Slope One算法。本文算法首先以融合时间信息的用户相似度为边权建立用户关联图,对该图进行图嵌入得到用户特征向量,然后基于Canopy聚类对用户进行类内加权Slope One推荐。另外,为优化算法性能,本文算法基于Spark计算框架实现。实验结果表明,对比传统的加权Slope One,本文算法在稀疏数据集和显式、隐式评分数据集上的推荐效果和评分预测准确率都更优。     

用户-兴趣点耦合关系的兴趣点推荐方法

在基于位置的社交网络(LBSNs)中,如何利用用户和兴趣点的属性（或特征）之间的耦合关系,为用户做出准确的兴趣点推荐是当前的研究热点。现有的矩阵分解推荐方法利用用户对兴趣点的评分进行推荐,但评级矩阵通常非常稀疏,并且没有考虑用户和兴趣点在各自属性方面的耦合关系。本文提出了一种基于深度神经网络的兴趣点推荐框架,首先采用K-means算法对兴趣点按地理位置进行聚类,使位置相近的兴趣点聚为一类;然后,构建一个卷积神经网络模型,用来学习用户和兴趣点在各自属性（如用户年龄与兴趣点位置之间）上的显式关联关系;同时,构建另外一个神经网络模型,模拟机器学习中的矩阵分解方法,根据用户的签到行为,深入挖掘用户与兴趣点之间的隐式关联关系。最后,将用户与兴趣点之间的显式和隐式关联关系进行集成,综合表征用户?兴趣点之间的耦合关系,然后将学习到的用户?兴趣点耦合关系输入到一个全连接网络中进行兴趣点推荐。本文所提出的模型在Yelp数据集上进行了评估,实验结果表明该模型在兴趣点推荐方面有较高的推荐准确性。     

An approach for selecting seed URLs of focused crawler based on user-interest ontology

Seed URLs selection for focused Web crawler intends to guide related and valuable information that meets a user's personal information requirement and provide more effective information retrieval. In this paper, we propose a seed URLs selection approach based on user-interest ontology. In order to enrich semantic query, we first intend to apply Formal Concept Analysis to construct user-interest concept lattice with user log profile. By using concept lattice merger, we construct the user-interest ontology which can describe the implicit concepts and relationships between them more appropriately for semantic representation and query match. On the other hand, we make full use of the user-interest ontology for extracting the user interest topic area and expanding user queries to receive the most related pages as seed URLs, which is an entrance of the focused crawler. In particular, we focus on how to refine the user topic area using the bipartite directed graph. The experiment proves that the user-interest ontology can be achieved effectively by merging concept lattices and that our proposed approach can select high quality seed URLs collection and improve the average precision of focused Web crawler.     

基于本体的个性化协同推荐

推荐系统已成为减轻信息过载时用户负担的关键工具,由于要处理不同形式的用户交互,因此协同推荐要与用户的具体情况和不断变化的兴趣相关。基于此,提出建立上下文相关的协同推荐,以领域本体的形式包含语义知识,把用户配置定义为一个本体。文章描述用户配置本体如何学习、增量更新和如何用于协同推荐。     

用户兴趣变化和类别关联度的混合推荐算法

协同过滤算法是目前推荐系统中最普遍的个性化推荐技术。针对传统算法相似性度量方法不足的问题,提出了融合用户兴趣变化和类别关联度的混合推荐算法。算法根据用户的评分项目信息来对项目进行类别划分,挖掘出用户对不同类别项目的喜爱关注程度;同时将基于时间的兴趣度权重函数引入项目相似度计算之中来进一步提高计算的精确度,最后将改进后的相似度计算方法融入到用户聚类方法中,用户聚类之后,其所在的类别将对用户推荐准确度产生极大的作用。实验结果表明,在Movielens-1k数据集上运行该算法,该算法在运行效率和精确度上都有所提高。     

一种基于用户行为的兴趣度模型

个性化推荐技术在电子商务系统中得到了广泛应用。针对现有的用户模型不能根据用户自身兴趣实现推荐的问题,提出了一种基于用户行为的兴趣度模型,分析用户的行为模式,结合用户的浏览内容,发现用户兴趣。在此基础上采用期望最大化算法实现用户聚类,将用户划分到对应的簇,创建用户的兴趣度模型,从而向用户进行个性化推荐。实验对比结果表明,该模型能更好地发现用户当前的购买兴趣,从而进一步提高个性化推荐精度和用户满意度。