Tinderbook: Fall in Love with Culture

More than 2 millions of new books are published every year and choosing a good book among the huge amount of available options can be a challenging endeavor. Recommender systems help in choosing books by providing personalized suggestions based on the user reading history. However, most book recommender systems are based on collaborative filtering, involving a long onboarding process that requires to rate many books before providing good recommendations. Tinderbook provides book recommendations, given a single book that the user likes, through a card-based playful user interface that does not require an account creation. Tinderbook is strongly rooted in semantic technologies, using the DBpedia knowledge graph to enrich book descriptions and extending a hybrid state-of-the-art knowledge graph embeddings algorithm to derive an item relatedness measure for cold start recommendations. Tinderbook is publicly available (http://www.tinderbook.it) and has already generated interest in the public, involving passionate readers, students, librarians, and researchers. The online evaluation shows that Tinderbook achieves almost 50% of precision of the recommendations.

[1]  Raphaël Troncy,et al.  entity2rec: Learning User-Item Relatedness from Knowledge Graphs for Top-N Item Recommendation , 2017, RecSys.

[2]  Pasquale Lops,et al.  An investigation on the serendipity problem in recommender systems , 2015, Inf. Process. Manag..

[3]  Elena Baralis,et al.  Translational Models for Item Recommendation , 2018, ESWC.

[4]  Philip S. Yu,et al.  Heterogeneous Information Network Embedding for Recommendation , 2017, IEEE Transactions on Knowledge and Data Engineering.

[5]  Carolina Cambre,et al.  Screened Intimacies: Tinder and the Swipe Logic , 2016 .

[6]  Saul Vargas,et al.  Rank and relevance in novelty and diversity metrics for recommender systems , 2011, RecSys '11.

[7]  Gediminas Adomavicius,et al.  Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.

[8]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[9]  Heiko Paulheim,et al.  RDF Graph Embeddings for Content-based Recommender Systems , 2016, CBRecSys@RecSys.

[10]  Maurizio Morisio,et al.  A systematic literature review of Linked Data‐based recommender systems , 2015, Concurr. Comput. Pract. Exp..

[11]  Elena Baralis,et al.  Knowledge Graph Embeddings with node2vec for Item Recommendation , 2018, ESWC.

[12]  Heiko Paulheim,et al.  RDF2Vec: RDF graph embeddings and their applications , 2019, Semantic Web.

[13]  Tim Berners-Lee,et al.  Linked Data - The Story So Far , 2009, Int. J. Semantic Web Inf. Syst..

[14]  Jure Leskovec,et al.  node2vec: Scalable Feature Learning for Networks , 2016, KDD.

[15]  Harald Steck,et al.  Evaluation of recommendations: rating-prediction and ranking , 2013, RecSys.

[16]  Diana Inkpen,et al.  A survey of book recommender systems , 2017, Journal of Intelligent Information Systems.

[17]  Pasquale Lops,et al.  Content-based Recommender Systems: State of the Art and Trends , 2011, Recommender Systems Handbook.

[18]  Paolo Tomeo,et al.  A SPRank : Semantic Path-based Ranking for Top-N Recommendations using Linked Open Data , 2016 .

[19]  Welch Bl THE GENERALIZATION OF ‘STUDENT'S’ PROBLEM WHEN SEVERAL DIFFERENT POPULATION VARLANCES ARE INVOLVED , 1947 .

[20]  Nicholas Jing Yuan,et al.  Collaborative Knowledge Base Embedding for Recommender Systems , 2016, KDD.

[21]  Mouzhi Ge,et al.  Beyond accuracy: evaluating recommender systems by coverage and serendipity , 2010, RecSys '10.

[22]  Tommaso Di Noia,et al.  Recommender Systems Meet Linked Open Data , 2016, ICWE.