Article,
Extending Recommender Systems for Disjoint User/Item Sets: The Conference Recommendation Problem
Knowledge and Data Engineering, IEEE Transactions on, 24 (8): 1478--1490 (August 2012)
DOI: 10.1109/tkde.2011.90
Abstract
In this paper, we describe the problem of recommending conference sessions to attendees and show how novel extensions to traditional model-based recommender systems, as suggested in Adomavicius and Tuzhilin CHECK END OF SENTENCE, can address this problem. We introduce Recommendation Engine by CONjoint Decomposition of ITems and USers (RECONDITUS)-a technique that is an extension of preference-based recommender systems to recommend items from a new disjoint set to users from a new disjoint set. The assumption being that preferences exhibited by users with known usage behavior (e.g., past conference session attendance), which can be abstracted by projections of user and item matrices, will be similar to ones of new (different) users where the basic environment and item domain are the same (e.g., new conference). RECONDITUS requires no item ratings, but operates on observed user behavior such as past conference session attendance. The RECONDITUS paradigm consists of projections of both user and item data, and the learning of relationships in projected space. Once established, the relationships enable predicting new relationships and provide associated recommendations. The approach can encompass several traditional data mining problems where both clustering and prediction are necessary. RECONDITUS has been evaluated using data from the Oracle OpenWorld conference.
