The advent of the Linked Open Data (LOD) initiative gave birth to a variety of open knowledge bases freely accessible on the Web. They provide a valuable source of information that can improve conventional recommender systems, if properly exploited. In this paper we present SPrank, a novel hybrid recommendation algorithm able to compute top-N item recommendations from implicit feedback exploiting the information available in the so called Web of Data. We leverage DBpedia, a well-known knowledge base in the LOD compass, to extract semantic path-based features and to eventually compute recommendations using a learning to rank algorithm. Experiments with datasets on two different domains show that the proposed approach outperforms in terms of prediction accuracy several state-of-the-art top-N recommendation algorithms for implicit feedback in situations affected by different degrees of data sparsity.
Top-N recommendations from implicit feedback leveraging linked Open Data / Ostuni, Vito Claudio; Claudio, Vito; Di Noia, T; Di Sciascio, E; Mirizzi, R. - ELETTRONICO. - (2013), pp. 85-92. (Intervento presentato al convegno Seventh ACM Conference on Recommender Systems, RecSys '13 tenutosi a Hong Kong, China nel October 12-16, 2013) [10.1145/2507157.2507172].
Top-N recommendations from implicit feedback leveraging linked Open Data
Ostuni;Vito Claudio;Di Noia T;Di Sciascio E;Mirizzi R
2013-01-01
Abstract
The advent of the Linked Open Data (LOD) initiative gave birth to a variety of open knowledge bases freely accessible on the Web. They provide a valuable source of information that can improve conventional recommender systems, if properly exploited. In this paper we present SPrank, a novel hybrid recommendation algorithm able to compute top-N item recommendations from implicit feedback exploiting the information available in the so called Web of Data. We leverage DBpedia, a well-known knowledge base in the LOD compass, to extract semantic path-based features and to eventually compute recommendations using a learning to rank algorithm. Experiments with datasets on two different domains show that the proposed approach outperforms in terms of prediction accuracy several state-of-the-art top-N recommendation algorithms for implicit feedback in situations affected by different degrees of data sparsity.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.