Warning: pg_query(): Query failed: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 in /dati/webiit-old/includes/database.pgsql.inc on line 138 Warning: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 query: SELECT data, created, headers, expire, serialized FROM cache_page WHERE cid = 'https://www-old.iit.cnr.it/node/35589' in /dati/webiit-old/includes/database.pgsql.inc on line 159 Warning: pg_query(): Query failed: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 in /dati/webiit-old/includes/database.pgsql.inc on line 138 Warning: ERROR: missing chunk number 0 for toast value 29512337 in pg_toast_2619 query: SELECT data, created, headers, expire, serialized FROM cache_page WHERE cid = 'https://www-old.iit.cnr.it/node/35589' in /dati/webiit-old/includes/database.pgsql.inc on line 159 PLIERS: PopuLarity-based ItEm Recommender System | IIT - CNR - Istituto di Informatica e Telematica
IIT Home Page CNR Home Page

PLIERS: PopuLarity-based ItEm Recommender System

In the last few years social networking platforms proliferated, providing the users with the possibility to generate items and define tags. Social tagging systems  help users and the system identify useful content with respect to the users interests. The relations between users, items, and tags created by these tagging systems form a special kind of taxonomy, called folksonomy, that can be naturally represented as a graph. To further help the users to find out interesting contents, tag-based recommender systems have been successfully defined as reasoning algorithms on these types of graphs. However, the two most popular solutions proposed in literature suffer from strong limitations. They mainly do not take into account the characteristics of the user's interests (e.g., their distribution on the network or their semantic meaning), but they tend to recommend either content with minimum or maximum popularity among those available in the network. To overcome this limitation, a hybrid algorithm that linearly combines the two solutions has been recently proposed, but it also inherits, in part, their shortcomings. In fact, the recommendations it produces are not always compatible, in terms of popularity, with the items already owned by the users. In addition, it requires the definition of a specific parameter that identifies the relevance of these algorithms on each specific evaluation. In this paper, we propose a novel tag-based recommender system, called PLIERS, that solves the dilemma between the choice of popular or unpopular items, without requiring any parameters to tune, and ensuring that the popularity of recommended items is always compatible with the popularity of items already adopted by the users. Simulation analyses on four large-scale datasets obtained from real social networks demonstrates that our approach outperforms the state of the art.


2015

Autori IIT:

Valerio Arnaboldi

Foto di Valerio Arnaboldi

Tipo: TR Rapporti tecnici
Area di disciplina: Information Technology and Communication Systems
IIT TR-06/2015

File: TR-06-2015.pdf

Attività: Opportunistic Networking and Computing