基于模糊隶属度的个性化网页推荐系统

个性化信息服务越来越成为信息检索领域中研究的热点。针对用户模型的构造问题,文章利用用户浏览过的网页历史记录自动进行文本结构分析,获取网页信息的逻辑表示,将段落作为识别用户兴趣的基本要素,利用段落间的聚类分析和对用户兴趣的表达能力,获取最终的用户兴趣特征向量。提出了一种基于主题描述的二级层次用户模型,并给出了用户模型的动态调整算法,构建了一个基于模糊隶属度的个性化网页推荐系统。模拟实验表明,该用户模型和个性化推荐算法能够有效地提高检索结果的准确性,并且具有良好的适应性。     

基于RSS信息源的用户兴趣建模与更新

互联网迅速发展,个性化信息服务成为研究的热点之一。RSS标准提供了结构化的信息模式,便于信息搜索和概要浏览。该文针对基于RSS标准的新闻源,根据用户点击等隐式信息,通过文本相似判定,自动聚类形成用户兴趣子类。用户模型节点、信息类别和用户兴趣子类构成了三层结构的树状用户兴趣模型。信息类别与用户兴趣子类均有对应的兴趣度。用户模型的更新是通过用户兴趣子类的更新与相关兴趣度的更新完成的。通过此模型进行信息推荐还要保证适当的信息冗余度。该模型的个性化程度高且更新效果好。     

基于Agent的个性化信息过滤系统的设计与实现

针对用户个性化服务的特定需求,文中提出了一种基于Agent的个性化信息过滤系统的设计思想及其实现过程。采用基于主题的过滤和基于兴趣的过滤相结合的过滤方法对信息分两次过滤,同时利用Agent跟踪用户的浏览行为,从而提供隐式反馈。系统能够根据文本的内容自动判别文本所属主题分类,并计算待过滤信息与用户兴趣之间的相关度,最后利用用户的反馈对用户兴趣模型进行更新,从而帮助用户准确获取有用信息。     

混合模型的用户兴趣漂移算法

针对个性化信息服务中的用户兴趣漂移问题,提出了一种新的正态分布密度曲线遗忘函数,该函数符合用户兴趣遗忘的规律.并且将用户模型定义为长期模型和短期模型相结合的混合模型,其中短期模型使用最近最久未使用的滑动窗口算法进行更新,长期模型采用正态渐进遗忘算法进行更新.实验表明,该方法能够较迅速地发现和准确地跟踪用户的兴趣变化,提高了个性化信息服务的效率.     

基于Agent的个性化信息过滤系统的设计与实现

针对用户个性化服务的特定需求，文中提出了一种基于Agent的个性化信息过滤系统的设计思想及其实现过程。采用基于主题的过滤和基于兴趣的过滤相结合的过滤方法对信息分两次过滤，同时利用Agent跟踪用户的浏览行为，从而提供隐式反馈。系统能够根据文本的内容自动判别文本所属主题分类，并计算待过滤信息与用户兴趣之间的相关度，最后利用用户的反馈对用户兴趣模型进行更新，从而帮助用户准确获取有用信息。     

基于RSS信息源的用户兴趣模型研究

互联网迅速发展,个性化信息服务成为研究的热点之一.在个性化信息服务的研究中,用户兴趣建模是核心问题之一.本文针对 RSS 标准的信息源,从用户兴趣知识获取、用户模型表示、用户模型学习、用户模型更新这四个方面论述了基于 RSS 的用户兴趣模型构建过程中的理论、方法和技术.     

个性化信息检索系统中用户兴趣模型的建立

个性化检索系统通过收集和分析用户信息来学习用户的兴趣和行为,从而实现对用户的个性化的信息推荐服务。而用户兴趣模型正是用户和兴趣的信息模型,用户兴趣模型直接影响到个性化的信息服务。     

人体经络系统中的个性化信息服务研究

人体经络较为复杂,涉及到经络、穴位、疾病、脏腑和针灸等方面的知识,容易导致＂信息迷航＂,且对于不同的用户,信息需求也各不相同。针对该问题,文章系统地研究了人体经络系统中的个性化信息服务,构建了用户兴趣模型,并根据用户对场景的访问次数和停留时间来更新用户的兴趣模型,在此基础上提出基于相似用户兴趣的个性化推荐算法,从而实现为用户提供个性化的信息服务。实验结果表明,系统能根据用户信息及其交互行为,有效地推荐与用户兴趣相关的信息,较好地为用户提供个性化的信息服务。     

基于文本过滤的数字图书馆个性化服务技术

在数字图书馆的应用中,个性化服务可以为用户提供符合其兴趣的检索结果。提供了一种针对数字图书馆个性化服务策略的文本过滤技术,通过在向量空间内建立用户兴趣模型和文本内容特征模型,计算它们的相似度后,将用户不感兴趣的文本过滤掉。详细描述了具体的建模过程和个性化文本过滤算法,最后给出了在实际的数字图书馆工程中的验证结果。     

基于树状向量空间模型的用户兴趣建模

提出了一种基于树状向量空间模型的用户兴趣建模和更新方法,以满足网络消费者个性化的服务需求.根据用户在注册信息中提供的兴趣喜好建立兴趣模型,利用用户的反馈自适应地调整主题特征值向量和阈值,更新用户模型.通过加入时间向量区别短期兴趣和长期兴趣,及时准确地反映用户兴趣变化,提高个性化服务性能.     

A structure-based approach for multimedia information filtering

While multimedia documents are sequentially presented to users, an information filtering (IF) system is useful to achieve a good retrieval performance in terms of both quality and efficiency. Conventional approaches for designing an IF system are based on the user's evaluation on information relevance degree (IRD), but ignore other attributes in system design such as relative importance of the data in a collection of multimedia documents. In this paper, we aim at developing a framework of designing structure-based multimedia IF systems, which incorporates the characteristics of the importance and relevance of multimedia documents. A method of calculating the values of relative importance degree of multimedia documents is proposed. Furthermore, these values are combined into the IRD of multimedia documents to improve the representation of user profiles. An illustrative example is given to demonstrate the proposed techniques.     

NectaRSS, an intelligent RSS feed reader

In this paper a novel article ranking method called NectaRSS is introduced. The system recommends incoming articles, which we will designate as newsitems, to users based on their past choices. User preferences are automatically acquired, avoiding explicit feedback, and ranking is based on those preferences distilled to a user profile. NectaRSS uses the well-known vector space model for user profiles and new documents, and compares them using information retrieval techniques, but introduces a novel method for user profile creation and adaptation from users’ past choices. The efficiency of the proposed method has been tested by embedding it into an intelligent aggregator (RSS feed reader) which has been used by different and heterogeneous users. Besides, this paper proves that the ranking of newsitems yielded by NectaRSS improves its quality with user's choices, and its superiority over other algorithms that use a different information representation method.     

面向个性化推荐的两层混合图模型

A hybrid graph model for personalized recom- mendation, which is based on small world network and Bayesian network, is presented. The hybrid graph model has two-layers. The bottom level means user's layer and the upper one means merchandise's layer. The user's layer is an undirected arcs graph, which describes the relation of the user's nodes by small world network. The undirected arcs inside the connected nodes of user's layer mean the similarity of the preference of users. These arcs are weighted by relational strength. The weight represents node's similarity or link's strength and intensity. Nodes in the same group are more similar to each other or more strongly connected. Users in a same group have the same or similar trendy of preferences. The merchandise's layer describes the relation of goods or produce to others. It is connected by directed links, which means an implicated definition among merchandises, a user that purchase certain merchandise also tends to purchase another. The properties and content of merchandise can be used to show the similarity of the merchandise. The relations between user's layer and merchandise's layer are connected by directed links. The start node of the directed links is a user node in user's layer belonging to some node group, which is gained by small world network. The end node of links is the node of some merchandise of the merchandise's layer. The directed links between the user's layer and the merchandise's layer are connected based on trade information of users. The strength of the relation between users and merchandises can be denoted by the probability parameter. The probability parameter shows a possibility of some users selecting for some merchandises. Firstly, algorithms for users clustering and for anal- ysis of new user interest are presented to construct a hybrid graph model. Two important characteristic parameters, which are in small-world network, are introduced. These are characteristic path length and clustering coefficient. New user interest analysis is to judge which clustering group is the best match by calculating the distance of the new user node to the others user nodes. Secondly, Bayesian network for causality of merchandises and users is constructed. It can be divided two parts, structure learning and parameter learning. The paper adopts the maximal mutual information principle to restrict complexity based on degree of Bayesian network. A new maximal mutual information entropy score function with restriction is defined and a maximum likelihood estimate algorithm is used to calculated parameter. Thirdly, recommending algorithm for new user is presented. In the algorithm, the initialized inputs can utilize some users information including the attributes and browsing process of a user. A proper user-clustering group will be gained by clustering matching with other users in small world network based on this information. Then all the other users nodes, which connect to this user, are selected based on a threshold of path length in the clustering. The recommended merchandise set of these users will be obtained by Bayesian network inference using these nodes as proofs. Finally, a set of recommendation of merchandise is presented for user according to their order of probability distribution. The paper uses the mean absolute error to evaluate the model and MovieLens database is selected. The experimentation shows that the model be accomplished to represent the relationships from user to user, merchandise to merchandise, and user to merchandise. The result shows that the hybrid graph model has a good performance in personalized recommendation.     

Personalized Web search for improving retrieval effectiveness

Current Web search engines are built to serve all users, independent of the special needs of any individual user. Personalization of Web search is to carry out retrieval for each user incorporating his/her interests. We propose a novel technique to learn user profiles from users' search histories. The user profiles are then used to improve retrieval effectiveness in Web search. A user profile and a general profile are learned from the user's search history and a category hierarchy, respectively. These two profiles are combined to map a user query into a set of categories which represent the user's search intention and serve as a context to disambiguate the words in the user's query. Web search is conducted based on both the user query and the set of categories. Several profile learning and category mapping algorithms and a fusion algorithm are provided and evaluated. Experimental results indicate that our technique to personalize Web search is both effective and efficient.     

基于粗糙集的个性化Web搜索系统

本文提出了一种基于粗糙集理论的个性化web搜索系统。用户偏好文件中对关键字进行分组以表示用户兴趣类别。利用粗糙集理论处理自然语言的内在含糊性，根据用户偏好文件对查询条件进行扩展。搜索组件使用扩展后的查询条件搜索相关信息。为了进一步排除不相关信息，排序组件计算查询条件和搜索结果之间的相似程度，根据计算值对搜索结果进行排序。与传统搜索引擎进行了比较，实验结果表明，该系统有效地提高了搜索结果的精度，满足了用户的个性化需求。     

一种综合标签和时间因素的个性化推荐方法

针对现存的基于标签的社会化推荐系统在构建用户兴趣模型时存在的缺陷,提出一种综合标签及其时间信息的资源推荐(TTRR)模型。此模型考虑了用户的兴趣具有时间性的特点,即用户兴趣是随着时间而变化的、用户最近新打的标签更能反映用户近期的兴趣这一特性。为此,在借鉴协同过滤思想的基础上,通过利用标签使用频率信息和项目的标注时间来构建用户评分伪矩阵;在此基础上计算目标用户的最近邻集合;最后根据邻居用户给出推荐结果。通过在CiteULike数据集上进行实验,并与传统的基于标注的推荐方法进行比较,实验结果表明,TTRR模型能够更好地反映出用户的偏好,能够显著地提高推荐准确度。     

Modeling user interests by conceptual clustering

As more information becomes available on the Web, there has been a crescent interest in effective personalization techniques. Personal agents providing assistance based on the content of Web documents and the user interests emerged as a viable alternative to this problem. Provided that these agents rely on having knowledge about users contained into user profiles, i.e., models of user preferences and interests gathered by observation of user behavior, the capacity of acquiring and modeling user interest categories has become a critical component in personal agent design. User profiles have to summarize categories corresponding to diverse user information interests at different levels of abstraction in order to allow agents to decide on the relevance of new pieces of information. In accomplishing this goal, document clustering offers the advantage that an a priori knowledge of categories is not needed, therefore the categorization is completely unsupervised. In this paper we present a document clustering algorithm, named WebDCC (Web Document Conceptual Clustering), that carries out incremental, unsupervised concept learning over Web documents in order to acquire user profiles. Unlike most user profiling approaches, this algorithm offers comprehensible clustering solutions that can be easily interpreted and explored by both users and other agents. By extracting semantics from Web pages, this algorithm also produces intermediate results that can be finally integrated in a machine-understandable format such as an ontology. Empirical results of using this algorithm in the context of an intelligent Web search agent proved it can reach high levels of accuracy in suggesting Web pages.     

Inferring user interests in microblogging social networks: a survey

With the growing popularity of microblogging services such as Twitter in recent years, an increasing number of users are using these services in their daily lives. The huge volume of information generated by users raises new opportunities in various applications and areas. Inferring user interests plays a significant role in providing personalized recommendations on microblogging services, and also on third-party applications providing social logins via these services, especially in cold-start situations. In this survey, we review user modeling strategies with respect to inferring user interests from previous studies. To this end, we focus on four dimensions of inferring user interest profiles: (1) data collection, (2) representation of user interest profiles, (3) construction and enhancement of user interest profiles, and (4) the evaluation of the constructed profiles. Through this survey, we aim to provide an overview of state-of-the-art user modeling strategies for inferring user interest profiles on microblogging social networks with respect to the four dimensions. For each dimension, we review and summarize previous studies based on specified criteria. Finally, we discuss some challenges and opportunities for future work in this research domain.     

Index Navigator: Search Engine with Reasoning for Understanding and Expressing User's Changing Mind

When a search engine user becomes interested in a new area for him/herself, it is difficult for the user to enter a query precisely expressing the interest or to select areas including the interest, because he/she is just a beginner of the interest. This paper presents a system called Index Navigator, which tells areas a user is interested in, keywords he/she should enter as a query, and documents concerning his/her interest. A tough problem for such a system is to understand the user's interest from the query he/she entered. Index Navigator employs an inference method called Cost-based Cooperation of Multi-Abducers (CCMA), for understanding a user's interest from the history of the user's queries (expression of interest in incomplete keywords), even if the changing speed of the user's interest can not be estimated. With this device, Index Navigator guided the user to areas, keywords and documents relevant to his/her interest, according to the experimental results.     

基于搜索结果的个性化推荐系统研究

搜索引擎返回的信息太多且不能根据用户的兴趣提供检索结果,使得用户使用搜索引擎难以用简便的方式找到感兴趣的文档。个性化推荐是一种旨在减轻用户在信息检索方面负担的有效方法。文中把内容过滤技术和文档聚类技术相结合,实现了一个基于搜索结果的个性化推荐系统,以聚类的方法自动组织搜索结果,主动推荐用户感兴趣的文档。通过建立用户概率兴趣模型,对搜索结果STC聚类的基础上进行内容过滤。实验表明,概率模型比矢量空间模型更好地表达了用户的兴趣和变化。