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.     

Single display gamut size metric

To measure the relative gamut sizes of wide‐gamut displays, it is herein proposed that the CIE 1931 xy chromaticity diagram be used rather than the nominally perceptually uniform CIE 1976 u′v′ chromaticity diagram. High correlations were found between the area‐coverage ratios in the xy diagram and the volume‐coverage ratios in the CIE 1976 L^*a^*b^* color space for major standard wide‐gamut color spaces. It is also demonstrated herein that performing planimetry in the uniform u′v′ diagram does not yield accurate relative display gamut sizes, even though the large sizes obtained using the u′v′ diagram are often reported regardless of the fact that its uniformity is valid only when the luminance factor is constant. The single display gamut size metric using the xy diagram will facilitate the unbiased development of wide‐gamut displays.     

Private personalized social recommendations in an IPTV system

In our connected world, recommender systems have become widely known for their ability to provide expert and personalize referrals to end-users in different domains. The rapid growth of social networks and new kinds of systems so called “social recommender systems” are rising, where recommender systems can be utilized to find a suitable content according to end-users' personal preferences. However, preserving end-users' privacy in social recommender systems is a very challenging problem that might prevent end-users from releasing their own data, which detains the accuracy of extracted referrals. In order to gain accurate referrals, social recommender systems should have the ability to preserve the privacy of end-users registered in this system. In this paper, we present a middleware that runs on end-users' Set-top boxes to conceal their profile data when released for generating referrals, such that computation of recommendation proceeds over the concealed data. The proposed middleware is equipped with two concealment protocols to give users a complete control on the privacy level of their profiles. We present an IPTV network scenario and perform a number of different experiments to test the efficiency and accuracy of our protocols. As supported by the experiments, our protocols maintain the recommendations accuracy with acceptable privacy level.     

A Recommendation System Keeping Both Precision and Recall by Extraction of Uninteresting Information

A recommendation system which recommends interesting information to the target user must guarantee high precision and recall. However, there is trade-off between precision and recall. In this paper, we propose a web page recommendation method balancing both of them by take advantage of uninteresting information. The proposed method extracts the interest and uninterest indicators from not only historical interesting web pages but also uninteresting ones in a target genre. The historical interesting and uninteresting information is derived based on the browsing time and bookmarking. The proposed method can keep precision and recall by excluding the uninteresting information from the recommended ones based on the interest and uninterest indicators. The experimental result proved that the proposed method can improve the precision and recall than an existing method.