'On Affinity Measures for Artificial Immune System Movie Recommenders'

Abstract. We combine Artificial Immune Systems (AIS) technology with Collaborative Filtering (CF) and use it to build a movie recommendation system. We already know that Artificial Immune Systems work well as movie recommenders from previous work by Cayzer and Aickelin ([3], [4], [5]). Here our aim is to investigate the effect of different affinity measure algorithms for the AIS. Two different affinity measures, Kendall's Tau and Weighted Kappa, are used to calculate the correlation coefficients for the movie recommender. We compare the results with those published previously and show that that Weighted Kappa is more suitable than others for movie problems. We also show that AIS are generally robust movie recommenders and that, as long as a suitable affinity measure is chosen, results are good.

Recomendr-entity recommendation based on ad-hoc dimensions

The growing availability and popularity of opinion rich resources on the online web resources, such as review sites and personal blogs, has made it convenient to find out about the opinions and experiences of layman people. But, simultaneously, this huge eruption of data has made it difficult to reach to a conclusion. In this thesis, I develop a novel recommendation system, Recomendr that can help users digest all the reviews about an entity and compare candidate entities based on ad-hoc dimensions specified by keywords. It expects keyword specified ad-hoc dimensions/features as input from the user and based on those features; it compares the selected range of entities using reviews provided on the related User Generated Contents (UGC) e.g. online reviews. It then rates the textual stream of data using a scoring function and returns the decision based on an aggregate opinion to the user. Evaluation of Recomendr using a data set in the laptop domain shows that it can effectively recommend the best laptop as per user-specified dimensions such as price. Recomendr is a general system that can potentially work for any entities on which online reviews or opinionated text is available.

'On Affinity Measures for Artificial Immune System Movie Recommenders'

Abstract. We combine Artificial Immune Systems (AIS) technology with Collaborative Filtering (CF) and use it to build a movie recommendation system. We already know that Artificial Immune Systems work well as movie recommenders from previous work by Cayzer and Aickelin ([3], [4], [5]). Here our aim is to investigate the effect of different affinity measure algorithms for the AIS. Two different affinity measures, Kendall's Tau and Weighted Kappa, are used to calculate the correlation coefficients for the movie recommender. We compare the results with those published previously and show that that Weighted Kappa is more suitable than others for movie problems. We also show that AIS are generally robust movie recommenders and that, as long as a suitable affinity measure is chosen, results are good.

Social network analysis of an online dating network

Online social networks can be found everywhere from chatting websites like MSN, blogs such as MySpace to social media such as YouTube and second life. Among them, there is one interesting type of online social networks, online dating network that is growing fast. This paper analyzes an online dating network from social network analysis point of view. Observations are made and results are obtained in order to suggest a better recommendation system for people-to-people networks.

An economic approach to consumer product ratings

In three essays we examine user-generated product ratings with aggregation. While recommendation systems have been studied extensively, this simple type of recommendation system has been neglected, despite its prevalence in the field. We develop a novel theoretical model of user-generated ratings. This model improves upon previous work in three ways: it considers rational agents and allows them to abstain from rating when rating is costly; it incorporates rating aggregation (such as averaging ratings); and it considers the effect on rating strategies of multiple simultaneous raters. In the first essay we provide a partial characterization of equilibrium behavior. In the second essay we test this theoretical model in laboratory, and in the third we apply established behavioral models to the data generated in the lab. This study provides clues to the prevalence of extreme-valued ratings in field implementations. We show theoretically that in equilibrium, ratings distributions do not represent the value distributions of sincere ratings. Indeed, we show that if rating strategies follow a set of regularity conditions, then in equilibrium the rate at which players participate is increasing in the extremity of agents' valuations of the product. This theoretical prediction is realized in the lab. We also find that human subjects show a disproportionate predilection for sincere rating, and that when they do send insincere ratings, they are almost always in the direction of exaggeration. Both sincere and exaggerated ratings occur with great frequency despite the fact that such rating strategies are not in subjects' best interest. We therefore apply the behavioral concepts of quantal response equilibrium (QRE) and cursed equilibrium (CE) to the experimental data. Together, these theories explain the data significantly better than does a theory of rational, Bayesian behavior -- accurately predicting key comparative statics. However, the theories fail to predict the high rates of sincerity, and it is clear that a better theory is needed.

面向Blog的兴趣挖掘和推荐系统

Blog作为Web2.0的重要应用以其个性化的信息发布平台、多元化的内容载体等特点吸引网络用户。撰写和浏览Blog已经成为网络文化的流行热点,推动了Blog搜索服务的发展。目前的Blog搜索服务大都是基于对查询关键词的匹配来实现的,缺乏自动提取用户兴趣并进行推荐的能力。该文设计和实现了一个面向Blog的兴趣挖掘和推荐系统Blog-digger,该系统采用兴趣挖掘技术,能自动识别用户的兴趣,并主动推荐主题相关的Blog。实验结果证明了该系统的有效性。

CSFinder: A Cold-Start Friend Finder in Large-Scale Social Networks

Recommending users for a new social network user to follow is a topic of interest at present. The existing approaches rely on using various types of information about the new user to determine recommended users who have similar interests to the new user. However, this presents a problem when a new user joins a social network, who is yet to have any interaction on the social network. In this paper we present a particular type of conversational recommendation approach, critiquing-based recommendation, to solve the cold start problem. We present a critiquing-based recommendation system, called CSFinder, to recommend users for a new user to follow. A traditional critiquing-based recommendation system allows a user to critique a feature of a recommended item at a time and gradually leads the user to the target recommendation. However this may require a lengthy recommendation session. CSFinder aims to reduce the session length by taking a case-based reasoning approach. It selects relevant recommendation sessions of past users that match the recommendation session of the current user to shortcut the current recommendation session. It selects relevant recommendation sessions from a case base that contains the successful recommendation sessions of past users. A past recommendation session can be selected if it contains recommended items and critiques that sufficiently overlap with the ones in the current session. Our experimental results show that CSFinder has significantly shorter sessions than the ones of an Incremental Critiquing system, which is a baseline critiquing-based recommendation system.

Mobile application to provide personalized sightseeing tours

Tourist recommendation systems have been growing over the last years, mainly because of the use of mobile devices to get user context. This work discuss some of the most relevant systems on the field and presents PSiS Mobile, which is a mobile recommendation and planning application designed to support a tourist during his vacations. It provides recommendations about points of interest to visit based on tourist preferences and on user and sight context. Also, it suggests a visit planning which can be dynamically adapted based on current user and sight context. This tool works like a journey dairy since it records the tourist moves and tasks to help him remember how the trip was like. To conclude, some field experiences will be presented.

Learning domain-specific sentiment lexicons with applications to recommender systems

Search is now going beyond looking for factual information, and people wish to search for the opinions of others to help them in their own decision-making. Sentiment expressions or opinion expressions are used by users to express their opinion and embody important pieces of information, particularly in online commerce. The main problem that the present dissertation addresses is how to model text to find meaningful words that express a sentiment. In this context, I investigate the viability of automatically generating a sentiment lexicon for opinion retrieval and sentiment classification applications. For this research objective we propose to capture sentiment words that are derived from online users’ reviews. In this approach, we tackle a major challenge in sentiment analysis which is the detection of words that express subjective preference and domain-specific sentiment words such as jargon. To this aim we present a fully generative method that automatically learns a domain-specific lexicon and is fully independent of external sources. Sentiment lexicons can be applied in a broad set of applications, however popular recommendation algorithms have somehow been disconnected from sentiment analysis. Therefore, we present a study that explores the viability of applying sentiment analysis techniques to infer ratings in a recommendation algorithm. Furthermore, entities’ reputation is intrinsically associated with sentiment words that have a positive or negative relation with those entities. Hence, is provided a study that observes the viability of using a domain-specific lexicon to compute entities reputation. Finally, a recommendation system algorithm is improved with the use of sentiment-based ratings and entities reputation.

Papyres : un système de gestion et de recommandation d’articles de recherche

Les étudiants gradués et les professeurs (les chercheurs, en général), accèdent, passent en revue et utilisent régulièrement un grand nombre d’articles, cependant aucun des outils et solutions existants ne fournit la vaste gamme de fonctionnalités exigées pour gérer correctement ces ressources. En effet, les systèmes de gestion de bibliographie gèrent les références et les citations, mais ne parviennent pas à aider les chercheurs à manipuler et à localiser des ressources. D'autre part, les systèmes de recommandation d’articles de recherche et les moteurs de recherche spécialisés aident les chercheurs à localiser de nouvelles ressources, mais là encore échouent dans l’aide à les gérer. Finalement, les systèmes de gestion de contenu d'entreprise offrent les fonctionnalités de gestion de documents et des connaissances, mais ne sont pas conçus pour les articles de recherche. Dans ce mémoire, nous présentons une nouvelle classe de systèmes de gestion : système de gestion et de recommandation d’articles de recherche. Papyres (Naak, Hage, & Aïmeur, 2008, 2009) est un prototype qui l’illustre. Il combine des fonctionnalités de bibliographie avec des techniques de recommandation d’articles et des outils de gestion de contenu, afin de fournir un ensemble de fonctionnalités pour localiser les articles de recherche, manipuler et maintenir les bibliographies. De plus, il permet de gérer et partager les connaissances relatives à la littérature. La technique de recommandation utilisée dans Papyres est originale. Sa particularité réside dans l'aspect multicritère introduit dans le processus de filtrage collaboratif, permettant ainsi aux chercheurs d'indiquer leur intérêt pour des parties spécifiques des articles. De plus, nous proposons de tester et de comparer plusieurs approches afin de déterminer le voisinage dans le processus de Filtrage Collaboratif Multicritère, de telle sorte à accroître la précision de la recommandation. Enfin, nous ferons un rapport global sur la mise en œuvre et la validation de Papyres.

Scalable approximating SVD algorithm for recommender systems

With the rapid development of Internet, the amount of information on the Web grows explosively, people often feel puzzled and helpless in finding and getting the information they really need. For overcoming this problem, recommender systems such as singular value decomposition (SVD) method help users finding relevant information, products or services by providing personalized recommendations based on their profiles. SVD is a powerful technique for dimensionality reduction. However, due to its expensive computational requirements and weak performance for large sparse matrices, it has been considered inappropriate for practical applications involving massive data. Thus, to extract information in which the user is interested from a massive amount of data, we propose a personalized recommendation algorithm which is called ApproSVD algorithm based on approximating SVD in this paper. The trick behind our algorithm is to sample some rows of a user-item matrix, rescale each row by an appropriate factor to form a relatively smaller matrix, and then reduce the dimensionality of the smaller matrix. Finally, we present an empirical study to compare the prediction accuracy of our proposed algorithm with that of Drineas's LINEARTIMESVD algorithm and the standard SVD algorithm on MovieLens dataset and Flixster dataset, and show that our method has the best prediction quality. Furthermore, in order to show the superiority of the ApproSVD algorithm, we also conduct an empirical study to compare the prediction accuracy and running time between ApproSVD algorithm and incremental SVD algorithm on MovieLens dataset and Flixster dataset, and demonstrate that our proposed method has better performance overall.

Exploring the travel behaviors of inbound tourists to Hong Kong using geotagged photos

Insight into tourist travel behaviors is crucial for managers engaged in strategic planning and decision making to create a sustainable tourism industry. However, they continue to face significant challenges in fully capturing and understanding the behavior of international tourists. The challenges are primarily due to the inefficient data collection approaches currently in use. In this paper, we present a new approach to this task by exploiting the socially generated and user-contributed geotagged photos now made publicly available on the Internet. Our case study focuses on Hong Kong inbound tourism using 29,443 photos collected from 2100 tourists. We demonstrate how a dataset constructed from such geotagged photos can help address such challenges as well as provide useful practical implications for destination development, transportation planning, and impact management. This study has the potential to benefit tourism researchers worldwide from better understanding travel behavior and developing sustainable tourism industries.

Personalização: um serviço mediador em ambientes de pesquisa

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Elaboración de un mapa de lixiviación de nitratos mediante una metodología de acople SIG-modelo de simulación : aplicación al acuífero de La Aldea (Gran Canaria)

[ES] La contaminación difusa por nitrato constituye una de las mayores amenazas actuales para la calidad de las aguas subterráneas. De hecho, varias directivas europeas, nacionales y regionales se han legislado con el fin de minimizar el efecto de las prácticas agrarias en la contaminación de los acuíferos por nitratos. El acuífero de La Aldea (Gran Canaria, España) se ha declarado como vulnerable a la contaminación por nitrato según dichas normas. En este estudio se presenta una metodología para desarrollar el acople de un sistema de información geográfica-SIG con el modelo de simulación de nitrato GLEAMS. Esta herramienta permite calcular la cantidad de nitrato lixiviado procedente de los cultivos de tomate bajo invernadero y da la oportunidad de simular otros rangos de fertilización para minimizar el riesgo de contaminación de las aguas subterráneas. Se comprueba que la pérdida de nitrato por lixiviación en la zona a partir de dichos cultivos podía llegar a los 500 kg N/ha, casi un 62% del aportado como fertilizante mineral en un manejo tradicional. Por ello, se aconseja la aplicación de las recomendaciones de abonado incluidas en el código de buenas prácticas agrarias de Canarias o cualquier otro sistema de recomendación de abonado mineral para reducir estas pérdidas, minimizando de esta forma el riesgo de contaminación de las aguas subterráneas. ABSTRACT: Nitrate diffuse pollution is one of the main risks that affect the groundwater quality. Several european directives, national and regional guidelines have been enacted to protect the aquifers against the effect of the agricultural management practices. The “La Aldea” aquifer was declared nitrate vulnerable area following these laws. In this study a methodology was developed to link a Geographical Information System (GIS) with a nitrogen simulation model (GLEAMS) in this area. This tool allows to assess the amount of nitrate leaching that coming from the traditional nitrogen fertilization rates in greenhouses tomato crops, and gives the opportunity to simulate other fertilization rates to reduce the risk of groundwater pollution. The nitrate leaching reached to 500 kg N/ha in several zones of the study area, that represent the 62% of the nitrogen fertiliser apply in a traditional management. It was recommended the application of the Code of Good Management Practices or other recommendation system to decrease the nitrate leaching, in order to reduce the risk of groundwater pollution.