Vito Claudio Ostuni
Tommaso Di Noia
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.
- Hetrec '11: Proceedings of the 2nd international workshop on information heterogeneity and fusion in recommender systems. ACM, 2011.Google Scholar
- S. S. Anand, P. Kearney, and M. Shapcott. Generating semantically enriched user profiles for web personalization. ACM Trans. Internet Technol., 7(4), 2007. Google ScholarDigital Library
- C. Bizer, T. Heath, and T. Berners-Lee. Linked data - the story so far. Int. J. Sem. Web Inf. Syst, 5(3):1--22, 2009.Google ScholarCross Ref
- L. Breiman. Random forests. Machine Learning, 45(1):5--32, 2001. Google ScholarDigital Library
- I. Cantador, A. Bellogín, and P. Castells. A multilayer ontology-based hybrid recommendation model. AI Commun., 21(2--3):203--210, 2008. Google ScholarDigital Library
- O. Chapelle and Y. Chang. Yahoo! learning to rank challenge overview. Journal of Machine Learning Research - Proceedings Track, 14:1--24, 2011.Google Scholar
- P. Cremonesi, Y. Koren, and R. Turrin. Performance of recommender algorithms on top-n recommendation tasks. In Proceedings of the fourth ACM conference on Recommender systems, pages 39--46. ACM, 2010. Google ScholarDigital Library
- T. Di Noia, R. Mirizzi, V. C. Ostuni, and D. Romito. Exploiting the web of data in model-based recommender systems. In Proceedings of the sixth ACM conference on Recommender systems, pages 253--256. ACM, 2012. Google ScholarDigital Library
- T. Di Noia, R. Mirizzi, V. C. Ostuni, D. Romito, and M. Zanker. Linked open data to support content-based recommender systems. In Proceedings of the 8th International Conference on Semantic Systems, I-SEMANTICS '12, pages 1--8. ACM, 2012. Google ScholarDigital Library
- I. Fernández-Tobías, I. Cantador, M. Kaminskas, and F. Ricci. A generic semantic-based framework for cross-domain recommendation. In Proc. of the 2nd Int. Workshop on Information Heterogeneity and Fusion in Recommender Systems, HetRec '11, pages 25--32. ACM, 2011. Google ScholarDigital Library
- J. H. Friedman. Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29:1189--1232, 2000.Google ScholarCross Ref
- Z. Gantner, L. Drumond, C. Freudenthaler, S. Rendle, and L. Schmidt-Thieme. Learning attribute-to-feature mappings for cold-start recommendations. In Proceedings of the 2010 IEEE International Conference on Data Mining, ICDM '10, pages 176--185. IEEE Computer Society, 2010. Google ScholarDigital Library
- Z. Gantner, S. Rendle, C. Freudenthaler, and L. Schmidt-Thieme. Mymedialite: a free recommender system library. In Proceedings of the fifth ACM conference on Recommender systems, RecSys '11, pages 305--308. ACM, 2011. Google ScholarDigital Library
- T.-Y. Liu. Learning to rank for information retrieval. Found. Trends Inf. Retr., 3(3):225--331, 2009. Google ScholarDigital Library
- S. E. Middleton, D. D. Roure, and N. R. Shadbolt. Ontology-based recommender systems. Handbook on Ontologies, 32(6):779--796, 2009.Google ScholarCross Ref
- B. Mobasher, X. Jin, and Y. Zhou. Semantically enhanced collaborative filtering on the web. In B. Berendt, A. Hotho, D. Mladenic, M. Someren, M. Spiliopoulou, and G. Stumme, editors, Web Mining: From Web to Semantic Web, volume 3209 of LNCS, pages 57--76. Springer Berlin Heidelberg, 2004.Google Scholar
- X. Ning and G. Karypis. Slim: Sparse linear methods for top-n recommender systems. In Proceedings of the 2011 IEEE 11th International Conference on Data Mining, ICDM '11, pages 497--506. IEEE Computer Society, 2011. Google ScholarDigital Library
- X. Ning and G. Karypis. Sparse linear methods with side information for top-n recommendations. In Proceedings of the sixth ACM conference on Recommender systems, RecSys '12, pages 155--162. ACM, 2012. Google ScholarDigital Library
- D. Y. Pavlov, A. Gorodilov, and C. A. Brunk. Bagboo: a scalable hybrid bagging-the-boosting model. In Proc. of the 19th ACM int. conference on Information and knowledge management, CIKM '10, pages 1897--1900. ACM, 2010. Google ScholarDigital Library
- S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme. Bpr: Bayesian personalized ranking from implicit feedback. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, UAI '09, pages 452--461. AUAI Press, 2009. Google ScholarDigital Library
- G. Semeraro, P. Lops, P. Basile, and M. de Gemmis. Knowledge infusion into content-based recommender systems. In Proceedings of the third ACM conference on Recommender systems, pages 301--304. ACM, 2009. Google ScholarDigital Library
- Y. Shi, A. Karatzoglou, L. Baltrunas, M. Larson, N. Oliver, and A. Hanjalic. Climf: learning to maximize reciprocal rank with collaborative less-is-more filtering. In Proceedings of the sixth ACM conference on Recommender systems, RecSys '12, pages 139--146. ACM, 2012. Google ScholarDigital Library
- M. Weimer, A. Karatzoglou, Q. V. Le, and A. J. Smola. Cofi rank - maximum margin matrix factorization for collaborative ranking. In Proceedings of the Twenty-First Annual Conference on Neural Information Processing Systems, 2007.Google Scholar
Index Terms
- Top-N recommendations from implicit feedback leveraging linked open data
Recommendations
SPrank: Semantic Path-Based Ranking for Top-N Recommendations Using Linked Open Data
In most real-world scenarios, the ultimate goal of recommender system applications is to suggest a short ranked list of items, namely top-N recommendations, that will appeal to the end user. Often, the problem of computing top-N recommendations is ...
Linked open data to support content-based recommender systems
I-SEMANTICS '12: Proceedings of the 8th International Conference on Semantic SystemsThe World Wide Web is moving from a Web of hyper-linked Documents to a Web of linked Data. Thanks to the Semantic Web spread and to the more recent Linked Open Data (LOD) initiative, a vast amount of RDF data have been published in freely accessible ...
Exploiting Linked Open Data in Cold-start Recommendations with Positive-only Feedback
CERI '16: Proceedings of the 4th Spanish Conference on Information RetrievalIn recommender systems, user preferences can be acquired either explicitly by means of ratings, or implicitly --e.g., by processing text reviews, and by mining item browsing and purchasing records. Most existing collaborative filtering approaches have ...
Comments