A flexible semantic inference methodology to reason about user preferences in knowledge-based recommender systems

Recommender systems arose with the goal of helping users search in overloaded information domains (like e-commerce, e-learning or Digital TV). These tools automatically select items (commercial products, educational courses, TV programs, etc.) that may be appealing to each user taking into account his/her personal preferences. The personalization strategies used to compare these preferences with the available items suffer from well-known deficiencies that reduce the quality of the recommendations. Most of the limitations arise from using syntactic matching techniques because they miss a lot of useful knowledge during the recommendation process. In this paper, we propose a personalization strategy that overcomes these drawbacks by applying inference techniques borrowed from the Semantic Web. Our approach reasons about the semantics of items and user preferences to discover complex associations between them. These semantic associations provide additional knowledge about the user preferences, and permit the recommender system to compare them with the available items in a more effective way. The proposed strategy is flexible enough to be applied in many recommender systems, regardless of their application domain. Here, we illustrate its use in AVATAR, a tool that selects appealing audiovisual programs from among the myriad available in Digital TV.     

Exploring synergies between content-based filtering and Spreading Activation techniques in knowledge-based recommender systems

Recommender systems fight information overload by selecting automatically items that match the personal preferences of each user. The so-called content-based recommenders suggest items similar to those the user liked in the past, using syntactic matching mechanisms. The rigid nature of such mechanisms leads to recommending only items that bear strong resemblance to those the user already knows. Traditional collaborative approaches face up to overspecialization by considering the preferences of other users, which causes other severe limitations. In this paper, we avoid the intrinsic pitfalls of collaborative solutions and diversify the recommendations by reasoning about the semantics of the user’s preferences. Specifically, we present a novel content-based recommendation strategy that resorts to semantic reasoning mechanisms adopted in the Semantic Web, such as Spreading Activation techniques and semantic associations. We have adopted these mechanisms to fulfill the personalization requirements of recommender systems, enabling to discover extra knowledge about the user’s preferences and leading to more accurate and diverse suggestions. Our approach is generic enough to be used in a wide variety of domains and recommender systems. The proposal has been preliminary evaluated by statistics-driven tests involving real users in the recommendation of Digital TV contents. The results reveal the users’ satisfaction regarding the accuracy and diversity of the reasoning-driven content-based recommendations.     

Incentivized provision of metadata, semantic reasoning and time-driven filtering: Making a puzzle of personalized e-commerce

e-Commerce recommender systems select potentially interesting products for users by looking at their purchase histories and preferences. In order to compare the available products against those included in the user’s profile, semantics-based recommendation strategies consider metadata annotations that describe their main attributes. Besides, to ensure successful suggestions of products, these strategies adapt the recommendations as the user’s preferences evolve over time. Traditional approaches face two limitations related to the aforementioned features. First, product providers are not typically willing to take on the tedious task of annotating accurately a huge diversity of commercial items, thus leading to a substantial impoverishment of the personalization quality. Second, the adaptation process of the recommendations misses the time elapsed since the user has bought an item, which is an essential parameter that affects differently to each purchased product. This results in some pointless recommendations, e.g. including regularly items that the users are only willing to buy sporadically. In order to fight both limitations, we propose a personalized e-commerce system with two main features. On the one hand, we incentivize the users to provide high-quality metadata for commercial products; on the other, we explore a strategy that offers time-aware recommendations by combining semantic reasoning about these annotations with item-specific time functions. The synergetic effects derived from this combination lead to suggestions adapted to the particular needs of the users at any time. This approach has been experimentally validated with a set of users who accessed our personalized e-commerce system through a range of fixed and handheld consumer devices.     

Property-based collaborative filtering for health-aware recommender systems

Recommender systems aim at solving the problem of information overload by selecting items (commercial products, educational assets, TV programs, etc.) that match the consumers’ interests and preferences. Recently, there have been approaches to drive the recommendations by the information stored in electronic health records, for which the traditional strategies applied in online shopping, e-learning, entertainment and other areas have several pitfalls. This paper addresses those problems by introducing a new filtering strategy, centered on the properties that characterize the items and the users. Preliminary experiments with real users have proved that this approach outperforms previous ones in terms of consumers’ satisfaction with the recommended items. The benefits are especially apparent among people with specific health concerns.     

A hybrid recommendation approach for a tourism system

Many current e-commerce systems provide personalization when their content is shown to users. In this sense, recommender systems make personalized suggestions and provide information of items available in the system. Nowadays, there is a vast amount of methods, including data mining techniques that can be employed for personalization in recommender systems. However, these methods are still quite vulnerable to some limitations and shortcomings related to recommender environment. In order to deal with some of them, in this work we implement a recommendation methodology in a recommender system for tourism, where classification based on association is applied. Classification based on association methods, also named associative classification methods, consist of an alternative data mining technique, which combines concepts from classification and association in order to allow association rules to be employed in a prediction context. The proposed methodology was evaluated in some case studies, where we could verify that it is able to shorten limitations presented in recommender systems and to enhance recommendation quality.     

A hybrid content-based and item-based collaborative filtering approach to recommend TV programs enhanced with singular value decomposition

With the advent of new cable and satellite services, and the next generation of digital TV systems, people are faced with an unprecedented level of program choice. This often means that viewers receive much more information than they can actually manage, which may lead them to believe that they are missing programs that could likely interest them. In this context, TV program recommendation systems allow us to cope with this problem by automatically matching user’s likes to TV programs and recommending the ones with higher user preference.This paper describes the design, development, and startup of queveo.tv: a Web 2.0 TV program recommendation system. The proposed hybrid approach (which combines content-filtering techniques with those based on collaborative filtering) also provides all typical advantages of any social network, such as supporting communication among users as well as allowing users to add and tag contents, rate and comment the items, etc. To eliminate the most serious limitations of collaborative filtering, we have resorted to a well-known matrix factorization technique in the implementation of the item-based collaborative filtering algorithm, which has shown a good behavior in the TV domain. Every step in the development of this application was taken keeping always in mind the main goal: to simplify as much as possible the user task of selecting what program to watch on TV.     

One-and-only item recommendation with fuzzy logic techniques

Recommender systems anticipate users’ needs by suggesting items that are likely to interest them. Most existing systems employ collaborative filtering (CF) techniques, searching for regularities in the way users have rated items. While in general a successful approach, CF cannot cope well with so-called one-and-only items, that is: items of which there is only one single instance (like an event), and which as such cannot be repetitively “sold”. Typically such items are evaluated only after they have ceased being available, thereby thwarting the classical CF strategy. In this paper, we develop a conceptual framework for recommending one-and-only items. It uses fuzzy logic, which allows to reflect the graded/uncertain information in the domain, and to extend the CF paradigm, overcoming limitations of existing techniques. A possible application in the context of trade exhibition recommendation for e-government is discussed to illustrate the proposed conceptual framework.     

Personalization on a peer-to-peer television system

We introduce personalization on Tribler, a peer-to-peer (P2P) television system. Personalization allows users to browse programs much more efficiently according to their taste. It also enables to build social networks that can improve the performance of current P2P systems considerably, by increasing content availability, trust and the realization of proper incentives to exchange content. This paper presents a novel scheme, called BuddyCast, that builds such a social network for a user by exchanging user interest profiles using exploitation and exploration principles. Additionally, we show how the interest of a user in TV programs can be predicted from the zapping behavior by the introduced user-item relevance models, thereby avoiding the explicit rating of TV programs. Further, we present how the social network of a user can be used to realize a truly distributed recommendation of TV programs. Finally, we demonstrate a novel user interface for the personalized peer-to-peer television system that encompasses a personalized tag-based navigation to browse the available distributed content. The user interface also visualizes the social network of a user, thereby increasing community feeling which increases trust amongst users and within available content and creates incentives of to exchange content within the community.     

Efficient optimization of multiple recommendation quality factors according to individual user tendencies

Recommender systems are among the most visible applications of intelligent systems technology in practice and are used to help users find items of interest, for example on e-commerce sites, in a personalized way. While past research has focused mainly on accurately predicting the relevance of items that are unknown to the user, other quality criteria for recommendations have been investigated in recent years, including diversity, novelty, or serendipity. Considering these additional factors, however, often leads to the following two challenges. First, in many application domains, trade-offs like “diversity vs. accuracy” have to be balanced. Second, it is not always clear how much diversity or novelty is desirable in practice.In this work, we propose a novel parameterizable optimization scheme that re-ranks accuracy-optimized recommendation lists in order to cope with these challenges. Our method is both capable of considering multiple optimization goals at the same time and designed to consider individual user tendencies regarding the different quality factors, like diversity. In contrast to previous work, the method is not restricted to a specific underlying item ranking algorithm and its generic design allows the algorithm to be parameterized according to the requirements of the application domain. Experimental evaluations with different datasets show that balancing the quality factors with our method can be done with a marginal or no loss in ranking accuracy. Given that our method can be applied in various domains and within the narrow time constraints of online recommendation, our work opens new opportunities to design novel finer-grained personalization approaches in practical applications.     

Efficiently using contextual influence to recommend new items to ephemeral groups

Group recommender systems suggest items to groups of users that want to utilize those items together. These systems can support several activities that can be performed together with other people and are typically social, like watching TV or going to the restaurant. In this paper we study ephemeral groups, i.e., groups constituted by users who are together for the first time, and for which therefore there is no history of past group activities.Recent works have studied ephemeral group recommendations proposing techniques that learn complex models of users and items. These techniques, however, are not appropriate to recommend items that are new in the system, while we propose a method able to deal with new items too. Specifically, our technique determines the preference of a group for a given item by combining the individual preferences of the group members on the basis of their contextual influence, the contextual influence representing the ability of an individual, in a given situation, to guide the group’s decision. Moreover, while many works on recommendations do not consider the problem of efficiently producing recommendation lists at runtime, in this paper we speed up the recommendation process by applying techniques conceived for the top-$K$ query processing problem. Finally, we present extensive experiments, evaluating: (i) the accuracy of the recommendations, using a real TV dataset containing a log of viewings performed by real groups, and (ii) the efficiency of the online recommendation task, exploiting also a bigger partially synthetic dataset.     

Improving the prediction accuracy of recommendation algorithms: Approaches anchored on human factors

Recommender systems are a special class of personalized systems that aim at predicting a user's interest on available products and services by relying on previously rated items or item features. Human factors associated with a user's personality or lifestyle, although potential determinants of user behavior are rarely considered in the personalization process. In this paper, we demonstrate how the concept of lifestyle can be incorporated in the recommendation process to improve the prediction accuracy by efficiently managing the problem of limited data availability. We propose two approaches: one relying on lifestyle alone and another integrating lifestyle within the nearest neighbor approach. Both approaches are empirically tested in the domain of recommendations for personalized television advertisements and are shown to outperform existing nearest neighborhood approaches in most cases.     

Psychological reactance to online recommendation services

Adoption of online recommendation services can improve the quality of decision making or it can pose threats to free choice. When people perceive that their freedom is reduced or threatened by others, they are likely to experience a psychological reactance where they attempt to restore the freedom. We performed an experimental study to determine whether users’ expectation of personalization increased their intention to use recommendation services, because their perception of expected threat to freedom caused by the recommendations reduced their intention to participate. An analysis based on subjects’ responses after using a hypothetical shopping website confirmed the two-sided nature of personalized recommendations, suggesting that the approach and avoidance strategies in persuasive communications can be effectively applied to personalized recommendation services on the web. Theoretical and practical implications are discussed.     

Discovery and Evaluation of Aggregate Usage Profiles for Web Personalization

Web usage mining, possibly used in conjunction with standard approaches to personalization such as collaborative filtering, can help address some of the shortcomings of these techniques, including reliance on subjective user ratings, lack of scalability, and poor performance in the face of high-dimensional and sparse data. However, the discovery of patterns from usage data by itself is not sufficient for performing the personalization tasks. The critical step is the effective derivation of good quality and useful (i.e., actionable) aggregate usage profiles from these patterns. In this paper we present and experimentally evaluate two techniques, based on clustering of user transactions and clustering of pageviews, in order to discover overlapping aggregate profiles that can be effectively used by recommender systems for real-time Web personalization. We evaluate these techniques both in terms of the quality of the individual profiles generated, as well as in the context of providing recommendations as an integrated part of a personalization engine. In particular, our results indicate that using the generated aggregate profiles, we can achieve effective personalization at early stages of users' visits to a site, based only on anonymous clickstream data and without the benefit of explicit input by these users or deeper knowledge about them.     

Program transformations for information personalization

Personalization constitutes the mechanisms necessary to automatically customize information content, structure, and presentation to the end-user to reduce information overload. Unlike traditional approaches to personalization, the central theme of our approach is to model a website as a program and conduct website transformation for personalization by program transformation (e.g., partial evaluation, program slicing). The goal of this paper is study personalization through a program transformation lens, and develop a formal model, based on program transformations, for personalized interaction with hierarchical hypermedia. The specific research issues addressed involve identifying and developing program representations and transformations suitable for classes of hierarchical hypermedia, and providing supplemental interactions for improving the personalized experience. The primary form of personalization discussed is out-of-turn interaction—a technique which empowers a user navigating a hierarchical website to postpone clicking on any of the hyperlinks presented on the current page and, instead, communicate the label of a hyperlink nested deeper in the hierarchy. When the user supplies out-of-turn input we personalize the hierarchy to reflect the user's informational need. While viewing a website as a program and site transformation as program transformation is non-traditional, it offers a new way of thinking about personalized interaction, especially with hierarchical hypermedia. Our use of program transformations casts personalization in a formal setting and provides a systematic and implementation-neutral approach to designing systems. Moreover, this approach helped connect our work to human-computer dialog management and, in particular, mixed-initiative interaction. Putting personalized web interaction on a fundamentally different landscape gave birth to this new line of research. Relating concepts in the web domain (e.g., sites, interactions) to notions in the program-theoretic domain (e.g., programs, transformations) constitutes the creativity in this work.     

A topic-based recommender system for electronic marketplace platforms

A large number of items are described, and subsequently bought and sold every day in auction marketplaces across the web. The amount of information and the number of available items makes finding what to buy as well as describing an item to sell, a challenge for the participants. In this paper we consider two functions of electronic marketplaces. First, we address the recommendation of related items for users browsing the items offered in a marketplace. Second, in order to support potential sellers we propose the recommendation of relevant items and terms which can be used to describe an item to be sold in the marketplace. The contribution of this paper lies in the proposal of an innovative system that exploits the hidden topics of unstructured information found in the e-marketplace in order to support these functions. We propose a three-step process in which a probabilistic topic modelling approach is used in order to uncover latent topics that provide the basis for item and term similarity calculation for the corresponding recommendations. We present the design of our system and perform evaluations of the quality of the extracted topics as well as of the recommender system using real life scenarios using data extracted from a widely used auction marketplace. The evaluations demonstrate the perceived usefulness of our approach.     

Mining temporal patterns in popularity of web items

Huge amounts of various web items (e.g., images, keywords, and web pages) are being made available on the Web. The popularity of such web items continuously changes over time, and mining for temporal patterns in the popularity of web items is an important problem that is useful for several Web applications; for example, the temporal patterns in the popularity of web search keywords help web search enterprises predict future popular keywords, thus enabling them to make price decisions when marketing search keywords to advertisers. However, the presence of millions of web items makes it difficult to scale up previous techniques for this problem. This paper proposes an efficient method for mining temporal patterns in the popularity of web items. We treat the popularity of web items as time-series and propose a novel measure, a gap measure, to quantify the dissimilarity between the popularity of two web items. To reduce the computational overhead for this measure, an efficient method using the Discrete Fourier Transform (DFT) is presented. We assume that the popularity of web items is not necessarily periodic. For finding clusters of web items with similar popularity trends, we show the limitations of traditional clustering approaches and propose a scalable, efficient, density-based clustering algorithm using the gap measure. Our experiments using the popularity trends of web search keywords obtained from the Google Trends web site illustrate the scalability and usefulness of the proposed approach in real-world applications.     

Understanding the effect of knowledge management strategies on knowledge management performance: A contingency perspective

The universalistic perspective research on employing a unidimensional knowledge management (KM) strategy has yielded conflicting findings and recommendations in different contexts. This study proposes a contingency model for investigating the effects of KM strategies on KM performance to resolve these contradictions. Drawing on the knowledge-based view (KBV) of the firm, which identifies knowledge type and origin as two key KM dimensions, this study first defines four KM strategies: external codification, internal codification, external personalization, and internal personalization. A multiple contingency model of KM strategy is then developed based on a technology–organization–environment framework. This study proposes that the effectiveness of each KM strategy depends on both external and internal contextual conditions, namely, environmental knowledge intensity and organizational information systems (IS) maturity. To test and validate the contingency model, we analyze data from 141 firms to explain the effects of KM strategies on KM performance. Our results reveal three KM strategies, not including the internal personalization strategy, which have a significant association with KM performance in their hypothesized contexts. This study expands KM strategy research by theoretically developing an advanced contingency model aligned with external and internal contexts and by providing valuable practical suggestions to managers for selecting a KM strategy based on multiple contingencies related to the external and internal conditions of a firm.     

A social recommender system using item asymmetric correlation

Recommender systems have been one of the most prominent information filtering techniques during the past decade. However, they suffer from two major problems, which degrade the accuracy of suggestions: data sparsity and cold start. The popularity of social networks shed light on a new generation of such systems, which is called social recommender system. These systems act promisingly in solving data sparsity and cold start issues. Given that social relationships are not available to every system, the implicit relationship between the items can be an adequate option to replace the constraints. In this paper, we explored the effect of combining the implicit relationships of the items and user-item matrix on the accuracy of recommendations. The new Item Asymmetric Correlation (IAC) method detects the implicit relationship between each pair of items by considering an asymmetric correlation among them. Two dataset types, the output of IAC and user-item matrix, are fused into a collaborative filtering recommender via Matrix Factorization (MF) technique. We apply the two mostly used mapping models in MF, Stochastic Gradient Descent and Alternating Least Square, to investigate their performances in the presence of sparse data. The experimental results of real datasets at four levels of sparsity demonstrate the better performance of our method comparing to the other commonly used approaches, especially in handling the sparse data.     

Alattin: mining alternative patterns for defect detection

To improve software quality, static or dynamic defect-detection tools accept programming rules as input and detect their violations in software as defects. As these programming rules are often not well documented in practice, previous work developed various approaches that mine programming rules as frequent patterns from program source code. Then these approaches use static or dynamic defect-detection techniques to detect pattern violations in source code under analysis. However, these existing approaches often produce many false positives due to various factors. To reduce false positives produced by these mining approaches, we develop a novel approach, called Alattin, that includes new mining algorithms and a technique for detecting neglected conditions based on our mining algorithm. Our new mining algorithms mine patterns in four pattern formats: conjunctive, disjunctive, exclusive-disjunctive, and combinations of these patterns. We show the benefits and limitations of these four pattern formats with respect to false positives and false negatives among detected violations by applying those patterns to the problem of detecting neglected conditions.