skip to main content
10.1145/2851613.2851839acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Measuring semantic distance for linked open data-enabled recommender systems

Published:04 April 2016Publication History

ABSTRACT

The Linked Open Data (LOD) initiative has been quite successful in terms of publishing and interlinking data on the Web. On top of the huge amount of interconnected data, measuring relatedness between resources and identifying their relatedness could be used for various applications such as LOD-enabled recommender systems. In this paper, we propose various distance measures, on top of the basic concept of Linked Data Semantic Distance (LDSD), for calculating Linked Data semantic distance between resources that can be used in a LOD-enabled recommender system. We evaluated the distance measures in the context of a recommender system that provides the top-N recommendations with baseline methods such as LDSD. Results show that the performance is significantly improved by our proposed distance measures incorporating normalizations that use both of the resources and global appearances of paths in a graph.

References

  1. D. Brickley and R. V. Guha. {RDF vocabulary description language 1.0: RDF schema}. 2004.Google ScholarGoogle Scholar
  2. T. Di Noia, I. Cantador, and V. C. Ostuni. Linked open data-enabled recommender systems: ESWC 2014 challenge on book recommendation. In Semantic Web Evaluation Challenge, pages 129--143. Springer, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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, New York, NY, USA, 2012. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. T. Dunning. Accurate methods for the statistics of surprise and coincidence. Computational linguistics, 19(1):61--74, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. V. Groues, Y. Naudet, and O. Kao. Adaptation and evaluation of a semantic similarity measure for dbpedia: A first experiment. In Semantic and Social Media Adaptation and Personalization (SMAP), pages 87--91. IEEE, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. Harispe, S. Ranwez, S. Janaqi, and J. Montmain. Semantic Measures for the Comparison of Units of Language, Concepts or Instances from Text and Knowledge Base Analysis. arXiv preprint arXiv:1310.1285, 2013.Google ScholarGoogle Scholar
  8. B. Heitmann and C. Hayes. Using Linked Data to Build Open, Collaborative Recommender Systems. In AAAI spring symposium: linked data meets artificial intelligence, pages 76--81, 2010.Google ScholarGoogle Scholar
  9. J. P. Leal, V. Rodrigues, and R. Queirós. Computing semantic relatedness using dbpedia. 2012.Google ScholarGoogle Scholar
  10. A. Maedche and V. Zacharias. Clustering ontology-based metadata in the semantic web. In Principles of Data Mining and Knowledge Discovery, pages 348--360. Springer, 2002. Google ScholarGoogle ScholarCross RefCross Ref
  11. S. E. Middleton, D. De Roure, and N. R. Shadbolt. Ontology-based recommender systems. In Handbook on ontologies, pages 779--796. Springer, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  12. C. Musto, P. Basile, P. Lops, M. de Gemmis, and G. Semeraro. Linked Open Data-enabled Strategies for Top-N Recommendations. In CBRecSys, page 49, 2014.Google ScholarGoogle Scholar
  13. V. C. Ostuni, T. Di Noia, E. Di Sciascio, and R. Mirizzi. Top-n recommendations from implicit feedback leveraging linked open data. In Proceedings of the 7th ACM conference on Recommender systems, pages 85--92. ACM, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. A. Passant. dbrec: Music Recommendations Using DBpedia. In ISWC 2010 SE - 14, pages 209--224, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. Passant. Measuring Semantic Distance on Linking Data and Using it for Resources Recommendations. In AAAI Spring Symposium: Linked Data Meets Artificial Intelligence, volume 77, page 123, 2010.Google ScholarGoogle Scholar
  16. G. Piao, S. showkat Ara, and J. G. Breslin. Computing the Semantic Similarity of Resources in DBpedia for Recommendation Purposes. In Semantic Technology. Springer International Publishing, 2015.Google ScholarGoogle Scholar
  17. G. Salton, A. Wong, and C.-S. Yang. A vector space model for automatic indexing. Communications of the ACM, 18(11):613--620, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. M. Srinivas and L. M. Patnaik. Genetic algorithms: A survey. Computer, 27(6):17--26, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. L. Strobin and A. Niewiadomski. Evaluating semantic similarity with a new method of path analysis in RDF using genetic algorithms. COMPUTER SCIENCE, 21(2):137--152, 2013.Google ScholarGoogle Scholar

Index Terms

  1. Measuring semantic distance for linked open data-enabled recommender systems

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SAC '16: Proceedings of the 31st Annual ACM Symposium on Applied Computing
        April 2016
        2360 pages
        ISBN:9781450337397
        DOI:10.1145/2851613

        Copyright © 2016 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 4 April 2016

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        SAC '16 Paper Acceptance Rate252of1,047submissions,24%Overall Acceptance Rate1,650of6,669submissions,25%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader