首页    期刊浏览 2024年07月05日 星期五
登录注册

文章基本信息

  • 标题:Computing Semantic Relatedness using DBPedia
  • 作者:Jos{\'e} Paulo Leal ; V{\^a}nia Rodrigues ; Ricardo Queir{\'o}s
  • 期刊名称:OASIcs : OpenAccess Series in Informatics
  • 电子版ISSN:2190-6807
  • 出版年度:2012
  • 卷号:21
  • 页码:133-147
  • DOI:10.4230/OASIcs.SLATE.2012.133
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:Extracting the semantic relatedness of terms is an important topic in several areas, including data mining, information retrieval and web recommendation. This paper presents an approach for computing the semantic relatedness of terms using the knowledge base of DBpedia - a community effort to extract structured information from Wikipedia. Several approaches to extract semantic relatedness from Wikipedia using bag-of-words vector models are already available in the literature. The research presented in this paper explores a novel approach using paths on an ontological graph extracted from DBpedia. It is based on an algorithm for finding and weighting a collection of paths connecting concept nodes. This algorithm was implemented on a tool called Shakti that extract relevant ontological data for a given domain from DBpedia using its SPARQL endpoint. To validate the proposed approach Shakti was used to recommend web pages on a Portuguese social site related to alternative music and the results of that experiment are reported in this paper.
  • 关键词:semantic similarity; processing wikipedia data; ontology generation; web recommendation
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有