On recommendation problems beyond points of interest

Recommendation systems aim to recommend items or packages of items that are likely to be of interest to users. Previous work on recommendation systems has mostly focused on recommending points of interest (POI), to identify and suggest top-k items or packages that meet selection criteria and satisfy compatibility constraints on items in a package, where the (packages of) items are ranked by their usefulness to the users. As opposed to prior work, this paper investigates two issues beyond POI recommendation that are also important to recommendation systems. When there exist no sufficiently many POI that can be recommended, we propose (1) query relaxation recommendation to help users revise their selection criteria, or (2) adjustment recommendation to guide recommendation systems to modify their item collections, such that the users׳ requirements can be satisfied.We study two related problems, to decide (1) whether the query expressing the selection criteria can be relaxed to a limited extent, and (2) whether we can update a bounded number of items, such that the users can get desired recommendations. We establish the upper and lower bounds of these problems, all matching, for both combined and data complexity, when selection criteria and compatibility constraints are expressed in a variety of query languages, for both item recommendation and package recommendation. To understand where the complexity comes from, we also study the impact of variable sizes of packages, compatibility constraints and selection criteria on the analyses of these problems. Our results indicate that in most cases the complexity bounds of query relaxation and adjustment recommendation are comparable to their counterparts of the basic recommendation problem for testing whether a given set of (resp. packages of) items makes top-k items (resp. packages). In other words, extending recommendation systems with the query relaxation and adjustment recommendation functionalities typically does not incur extra overhead.     

农村通信如何"突围"

农村通信作为农村地区信息化的基础，对于全面建设小康具有特殊的重要地位。介绍了我国农村通信的发展现状，分析了农村通信发展的困难压其原因，最后对农村压边远、欠发达地区通信的均衡震展提出了一些建议。     

电子商务个性化推荐系统的构建

针对电子商务环境下,客户需求日趋差别化,构建个性化推荐系统,进而阐述该系统的功能及工作流程,并具体分析系统的结构,旨在更为有效地为客户推荐其所需信息。     

基于聚类分析的新书推荐

针对大多数图书馆管理系统中的个性化服务中的新书推荐只是定时将新到馆的图书罗列出来让读者浏览进行推荐,推荐效果差的问题。本文在比较三大常用的推荐技术的优缺点后,采用基于聚类分析的推荐算法推荐新书,并具体给出实现的方法。     

TWILITE: A recommendation system for Twitter using a probabilistic model based on latent Dirichlet allocation

Twitter provides search services to help people find users to follow by recommending popular users or the friends of their friends. However, these services neither offer the most relevant users to follow nor provide a way to find the most interesting tweet messages for each user. Recently, collaborative filtering techniques for recommendations based on friend relationships in social networks have been widely investigated. However, since such techniques do not work well when friend relationships are not sufficient, we need to take advantage of as much other information as possible to improve the performance of recommendations.In this paper, we propose TWILITE, a recommendation system for Twitter using probabilistic modeling based on latent Dirichlet allocation which recommends top-K users to follow and top-K tweets to read for a user. Our model can capture the realistic process of posting tweet messages by generalizing an LDA model as well as the process of connecting to friends by utilizing matrix factorization. We next develop an inference algorithm based on the variational EM algorithm for learning model parameters. Based on the estimated model parameters, we also present effective personalized recommendation algorithms to find the users to follow as well as the interesting tweet messages to read. The performance study with real-life data sets confirms the effectiveness of the proposed model and the accuracy of our personalized recommendations.     

A framework for tag-aware recommender systems

In social tagging system, a user annotates a tag to an item. The tagging information is utilized in recommendation process. In this paper, we propose a hybrid item recommendation method to mitigate limitations of existing approaches and propose a recommendation framework for social tagging systems. The proposed framework consists of tag and item recommendations. Tag recommendation helps users annotate tags and enriches the dataset of a social tagging system. Item recommendation utilizes tags to recommend relevant items to users. We investigate association rule, bigram, tag expansion, and implicit trust relationship for providing tag and item recommendations on the framework. The experimental results show that the proposed hybrid item recommendation method generates more appropriate items than existing research studies on a real-world social tagging dataset.     

Context-aware cognitive design assistant: Implementation and study of design rules recommendations

Design rules are an essential interface to facilitate the information exchange between designers and experts. Despite many innovations in Knowledge-Based Engineering and Knowledge Management, unstructured design rules documents are still widely used in the manufacturing industry. Due to the complexity of the design process, these documents often contain hundreds of design rules, applicable in varying design contexts. Searching for the right rules according to a design context is demanding in time and cognitive resources. In this paper, we propose a Context-Aware Cognitive Design Assistant (CACDA) to capture the design context and perform tasks such as the recommendation of design rules, the verification of design solutions, or the automation of design routines. Contrary to existing works in model quality testing, the CACDA uses a proactive approach of design rules application and helps designers to provide error-free designs on first attempt. In this paper, we present the design rules recommendation system of the CACDA, its capabilities and its implementation. Then, to measure the impact of design rules recommendations on the design process, we compare our approach with the use of traditional design rules documents. Results show that the use of the CACDA’s design rules recommendations lower the perceived difficulty of design rules retrieval from 75 to 43.5 on a scale of 100. On average, participants that used the demonstrator successfully applied 8.6 design rules on the 25 applicable design rules of our set. Participants that used unstructured documentation correctly applied 4.3 design rules. The global cognitive weight of the design activity as well as the design rules retrieval performances appear to be unchanged. These results demonstrate the usability of the demonstrator and show a positive impact on the design process and on the quality of CAD models. Future works will focus on the overcome of the main limitations of our current experiments, with a panel of professional designers, a lager design rules set and the implementation of several lacking features of the CACDA into the demonstrator.     

基于深度学习的内容推荐算法研究综述

推荐系统是学习用户偏好,实现个性化推荐的系统化应用技术,在商品购买、影音推荐、关联阅读等多领域得到了广泛的应用。近年来,随着多源异构数据的激增和深度学习的兴起,传统推荐算法中的表征学习模式逐步被深度学习代替。梳理推荐算法的背景和发展趋势,并给出内容推荐的算法思路及其优劣评价,分别介绍多层感知机、自动编码器、卷积神经网络以及循环神经网络等深度学习方法的网络结构和算法优势。从技术应用的视角综述深度学习在内容推荐中的应用现状与研究成果,对不同经典深度推荐算法进行分析与比较。在此基础上,指出深度学习在可解释性、学习效率等方面的不足,并对交叉领域学习、多任务学习、表征学习等未来研究方向进行展望。     

基于层次隐马尔可夫模型和神经网络的个性化推荐算法

传统推荐系统将推荐准确性作为主要目标,而推荐结果的多样性和个性化有所欠缺。对此,设计一种基于层次隐马尔可夫模型和神经网络的推荐算法。采用层次隐马尔可夫模型建模用户喜好和上下文环境的关系,并通过隐马尔可夫模型预测上下文。设计神经网络结构来解决协同过滤推荐的问题,同时神经网络满足贝叶斯个性化排序的条件,实现对推荐列表的个性化排序。实验结果表明,该算法在保持推荐准确性的前提下,提高了推荐的多样性和个性化。     

基于多上下文信息的协同过滤推荐算法

随着电子商务和互联网的发展,数据信息呈爆炸式增长,协同过滤算法作为一种简单而高效的推荐算法,能在一定程度上有效地解决信息爆炸问题。但是传统协同过滤算法仅通过单一评分来挖掘相似用户,推荐效果并不占优势。为了提高个性化推荐的质量,如何充分利用用户(物品)的文本、图片、标签等上下文信息以使数据价值最大化是当前推荐系统亟待解决的问题。对此,提出了一种融合多种类型上下文信息的协同过滤算法。以用户商品交互信息为二部图,根据不同类型上下文的特点构建不同的相似度网络,设计目标函数在多种上下文信息网络的约束下联合矩阵分解,并学得用户商品的表示学习。在多个数据集上进行了充分实验,结果表明,融合多种类型上下文信息的协同过滤算法不仅能有效提高推荐的准确度,而且能在一定程度上解决数据稀疏性问题。