With the increasing popularity of location tracking services such as GPS, more and more mobile data are being accumulated. Based on such data, a potentially useful service is to make timely and targeted recommendations for users on places where they might be interested to go and activities that they are likely to conduct. For example, a user arriving in Beijing might wonder where to visit and what she can do around the Forbidden City. A key challenge for such recommendation problems is that the data we have on each individual user might be very limited, while to make useful and accurate recommendations, we need extensive annotated location and activity information from user trace data. In this paper, we present a new approach, known as user-centered collaborative location and activity filtering (UCLAF), to pull many users’ data together and apply collaborative filtering to find like-minded users and like-patterned activities at different locations. We model the userlocation- activity relations with a tensor representation, and propose a regularized tensor and matrix decomposition solution which can better address the sparse data problem in mobile information retrieval. We empirically evaluate UCLAF using a real-world GPS dataset collected from 164 users over 2.5 years, and showed that our system can outperform several state-of-the-art solutions to the problem.

Collaborative filtering systems have been developed to manage information overload and improve discourse in online communities. In such systems, users rank content provided by other users on the validity or usefulness within their particular context. The goal is that "good" content will rise to prominence and "bad" content will fade into obscurity. These filtering mechanisms are not well-understood and have known weaknesses. For example, they depend on the presence of a large crowd to rate content, but such a crowd may not be present. Additionally, the community's decisions determine which voices will reach a large audience and which will be silenced, but it is not known if these decisions represent "the wisdom of crowds" or a "censoring mob." Our approach uses statistical machine learning to predict community ratings. By extracting features that replicate the community's verdict, we can better understand collaborative filtering, improve the way the community uses the ratings of their members, and design agents that augment community decision-making. Slashdot is an example of such a community where peers will rate each others' comments based on their relevance to the post. This work extracts a wide variety of features from the Slashdot metadata and posts' linguistic contents to identify features that can predict the community rating. We find that author reputation, use of pronouns, and author sentiment are salient. We achieve 76% accuracy predicting community ratings as good, neutral, or bad.

This research explored the transition of romantic relationships from meeting online to the first face-to-face date. It is inevitable that impressions of a partner will change to some degree, but how much, and with what consequences? One hundred and fifty users of a popular online dating site participated in the study. They recalled a person whom they had met through the site, reporting their impressions of their partners from both before and after the first face-to-face meeting. We expected, based on prior research demonstrating the importance of physical attractiveness in romantic attraction both on- and offline, that changes in beliefs about partners’ physical appeal would be the most powerful predictor of relationship longevity. However, they were unrelated to relationship success. Across all the dimensions we examined, impressions were in fact relatively stable, but when respondents said they knew their partners better after meeting face-to-face, relationships lasted longer.v

We propose a new method of recommending questions to answerers so as to suit the answerers’ knowledge and interests in User-Interactive Question Answering (QA) communities. A question recommender can help answerers select the questions that interest them. This increases the number of answers, which will activate QA communities. An effective question recommender should satisfy the following three requirements: First, its accuracy should be higher than the existing category-based approach; more than 50% of answerers select the questions to answer according a fixed system of categories. Second, it should be able to recommend unanswered questions because more than 2,000 questions are posted every day. Third, it should be able to support even those people who have never answered a question previously, because more than 50% of users in current QA communities have never given any answer. To achieve an effective question recommender, we use question histories as well as the answer histories of each user by combining collaborative filtering schemes and content-base filtering schemes. Experiments on real log data sets of a famous Japanese QA community, Oshiete goo, show that our recommender satisfies the three requirements.

Given a set of reviews of products or merchants from a wide range of authors and several reviews websites, how can we measure the true quality of the product or merchant?  How do we remove the bias of individual authors or sources?  How do we compare reviews obtained from different websites, where ratings may be on different scales (1-5 stars, A/B/C, etc.)?  How do we filter out unreliable reviews to use only the ones with ``star quality''?  Taking into account these considerations, we analyze data sets from a variety of different reviews sites (the first paper, to our knowledge, to do this). These data sets include 8 million product reviews and 1.5 million merchant reviews. We explore statistic- and heuristic- based models for estimating the true quality of a product or merchant, and compare the performance of these estimators on the task of ranking pairs of objects.  We also apply the same models to the task of using Netflix ratings data to rank pairs of movies, and discover that the performance of the different models is surprisingly similar on this data set.

The rapid uptake of mobile phones, cheaper and more Given the potentially large number of users of the Spoken widespread mobile connectivity, and increasing familiarity Web system and the likelihood of shared information needs with technology are driving Internet adoption in developing and significant user similarities, we expect considerable improvements nations, but major hurdles still remain. First, today's Internet in audio navigation from using CF. is mostly in English and is thus largely inaccessible to A useful distinction among CFbased approaches arises billions of people for whom English is not a native or second from the types of data used to associate users to products language. Second, today's Internet is accessible largely and other items. In some scenarios, users may provide explicit through text-based technologies (web browsing, email, text feedback about their interest in products through ratings.

While recommender systems can greatly enhance the user experience, the entry barriers in terms of data acquisition are very high, making it hard for new service providers to compete with existing recommendation services. This paper proposes to build open recommender systems which can utilise Linked Data to mitigate the new-user, new-item and sparsity problems of collaborative recommender systems. We describe how to aggregate data about object centred sociality from different sources and how to process it for collaborative recommendation. To demonstrate the validity of our approach, we augment the data from a closed collaborative music recommender system with Linked Data, and significantly improve its precision and recall.

Similarity networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, by inducing similarity networks between movies rated similarly by users, or between documents containing common terms, and or between clinical trials involving the same themes, we can aim to find the global structure of connectivities underlying the data, and use the network as a basis to make connections between seemingly disparate entities. In the above applications, composing similarities between objects of interest finds uses in serendipitous recommendation, in storytelling, and in clinical diagnosis, respectively. We present an algorithmic framework for traversing similarity paths using the notion of `hammock' paths which are generalization of traditional paths. Our framework is exploratory in nature so that, given starting and ending objects of interest, it explores candidate objects for path following, and heuristics to admissibly estimate the potential for paths to lead to a desired destination. We present three diverse applications: exploring movie similarities in the Netflix dataset, exploring abstract similarities across the PubMed corpus, and exploring description similarities in a database of clinical trials. Experimental results demonstrate the potential of our approach for unstructured knowledge discovery in similarity networks.

A client-server architecture to simultaneously solve multiple learning tasks from distributed datasets is described. In such architecture, each client is associated with an individual learning task and the associated dataset of examples. The goal of the architecture is to perform information fusion from multiple datasets while preserving privacy of individual data. The role of the server is to collect data in real-time from the clients and codify the information in a common database. The information coded in this database can be used by all the clients to solve their individual learning task, so that each client can exploit the informative content of all the datasets without actually having access to private data of others. The proposed algorithmic framework, based on regularization theory and kernel methods, uses a suitable class of mixed effect kernels. The new method is illustrated through a simulated music recommendation system.

These unintended negative consequences of the introduction of intelligence often have no direct relationship with the intended benefits, just as the adverse effects of a medication may bear no obvious relationship to the intended benefits of taking that medicine. Therefore, these negative consequences can be seen as side effects. The purpose of this article is to give designers, developers, and users of interactive intelligent systems a detailed awareness of the potential side effects of AI. As with medications, awareness of the side effects can have different implications: We may be relieved to see that a given side effect is unlikely to occur in our particular case. We may become convinced that it will inevitably occur and therefore decide not to "take the medicine" (that is, decide to stick with mainstream systems). Or most likely and most constructively, by looking carefully at the causes of the side effects and the conditions under which they can occur, we can figure out how to exploit the benefits of AI in interactive systems while avoiding the side effects.