期刊文献+

基于RDF句子的语义网文档搜索 被引量:4

Searching Semantic Web Documents Based on RDF Sentences
下载PDF
导出
摘要 语义网文档搜索是发现语义网数据的重要手段.针对传统信息检索方法的不足,提出基于RDF句子的文档词向量构建方法.首先,文档被看作RDF句子的集合,从而在文档分析和索引时能够保留基于RDF句子的结构信息.其次,引入资源的权威描述的定义,能够跨越文档边界搜索到语义网中互连的数据.此外,扩展了传统的倒排索引结构,使得系统能够提取出更加便于阅读和理解的片段.在大规模真实数据集上的实验表明,该方法可以显著地提高文档检索的效率,在可用性上具有明显的提升. Keyword-hased semantic Web document search is one of the most efficient approaches to find semantic Web data. Most existing approaches are based on traditional IR technologies, in which documents are modeled as bag of words. The authors identify the difficulties of these technologies in processing RDF documents, namely, preserving data structures, processing linked data and generating snippets. An approach is proposed to model the semantic Web document from its abstract syntax: RDF graph. In this approach, a document is modeled as a set of RDF sentences. It preserves the RDF sentence-based structures in the processes of document analyzing and indexing. The authoritative descriptions of named resources are also introduced and it enables the linked data across document boundaries to be searchable. Furthermore, to help users quickly determine whether one result is relevant or not, The traditional inverse index structure is extended to enable more understandable snippet extraction from matched documents. Experiments on real world data show that this approach can significantly improve the precision and recall of semantic Web document search. The precision at top one result is improved up to 19% and a steady improvement (near 10%) is observed. According to 50 random queries, the recall increases up to 60% averagely. Remarkable improvements in system usability are also obtained.
出处 《计算机研究与发展》 EI CSCD 北大核心 2010年第2期255-263,共9页 Journal of Computer Research and Development
基金 国家自然科学基金项目(60773106) 江苏省自然科学基金项目(BK2008290)~~
关键词 语义网 搜索引擎 语义网文档搜索 RDF句子 片段提取 semantic Web search engine RDF document search RDF sentence snippet generation
  • 相关文献

参考文献18

  • 1Ding L, et al. Swoogle: A search and metadata engine for the semantic Web [C] //Proc of the 13th ACM Int Conf on Information and Knowledge Management. New York: ACM, 2004:652-659.
  • 2Tummarello G, Delbru R, Sindice E O. Corn: Weaving the open linked data [C] //Proc of the 6th Int and 2nd Asian Semantic Web Conference ( ISWC2007 + ASWC2007 ). Berlin: Springer, 2007:552-565.
  • 3Watson-d'Aquin M, et al. WATSON: A gateway for the semantic Web[C]//Proc of European Semantic Web Conference 2007. Berlin: Springer, 2007.
  • 4Ding L, et al. Finding and ranking knowledge on the semantic Web [C] //Proe of the 4th Int Semantic Web Conference(ISWC 2005). Berlin: Springer, 2005:156-170.
  • 5Zhang X, Cheng G, Qu Y. Ontology summarization based on RDF sentence graph [C] //Proc of the 16th Int Conf on World Wide Web. New York: ACM, 2007: 707-716.
  • 6Jaeobs I, Walsh N. Architecture of the World Wide Web [EB/OL], (2004 12-01)[2009-06-05]. http://www. w3. org/ TR/webarch.
  • 7Klyne G, Carroll J J. Resource Description Framework (RDF): Concepts and Abstract Syntax [EB/OL]. (2004-02- 01) [2009-06-05 ]. http://www.w3. org/TR[2OO4/REC-rdfconcepts-20040210.
  • 8Mannino C, Sassano A. Solving hard set covering problems [J]. Operations Research Letters, 1995, 18(1): 1-5.
  • 9陈端兵,黄文奇.一种求解集合覆盖问题的启发式算法[J].计算机科学,2007,34(4):133-136. 被引量:13
  • 10吴刚,唐杰,李涓子,王克宏.细粒度语义网检索[J].清华大学学报(自然科学版),2005,45(S1):1865-1872. 被引量:11

二级参考文献14

  • 1陈亮,任世军.一种遗传算法在集合覆盖问题中的应用研究[J].哈尔滨商业大学学报(自然科学版),2006,22(2):67-70. 被引量:7
  • 2Caprara A,Toth P,Fischetti M.Algorithms for the set covering problem.Annals of Operations Research,2000,98:353~371
  • 3Haouari M,Chaouachi J S.A probabilistic greedy search algorithm for combinatorial optimization with application to the set covering problem.Journal of the Operational Research Society,2002,53:792~799
  • 4Yagiura M,Kishoda M,Ibaraki T.A 3-flip neighborhood local search for the se covering problem.European Journal of Operational Research,2006,172:472~499
  • 5Beasley J E,Chu P C.A genetic algorithm for the set covering problem.European Journal of Operational Research,1996,94:392~404
  • 6Solar M,Parada V,Urrutia R.A parallel genetic algorithm to solve the set-covering problem.Computers & Operations Research,2002,29:1221~1235
  • 7Jacobs L,Brusco M.Note:A local-search heuristic for large set-covering problems.Naval Research Logistics,1995,42:1129~1140
  • 8Lessing L,Dumitrescu I,Stützle T.A Comparison between ACO algorithms for the set covering problem.Lecture Notes in Computer Science,2004,3172:1~12
  • 9Ohlsson M,Peterson C,Sderberg B.An efficient mean field approach to the set covering problem.European Journal of Operational Research,2001,133:583~595
  • 10Beasley J E.An algorithm for set covering problems.European Journal of Operational Research,1987,31:85~93

共引文献22

同被引文献26

  • 1周静怡,黄国彬.2007-2008年国外语义网研究与应用进展[J].图书馆建设,2009(1):19-23. 被引量:11
  • 2易雅鑫,宋自林,尹康银.RDF数据存储模式研究及实现[J].情报科学,2007,25(8):1218-1222. 被引量:11
  • 3语义网[EB/OL][2011-11-07].http://baike.baidu.corn/view/1967.htm?fr=ala0-1.
  • 4张亮亮.基于领域本体的语义检索研究[D].长春:吉林大学计算机科学与技术学院,2009.
  • 5Hebeler J, Fisher M, Blace R, et al. Semantic Web Pro- gramming[ M]. John Wiley & Sons, 2011.
  • 6McGuinness D L, van Harmelen F. OWL Web Ontology Language Overview [ EB/OL ]. http ://www. w3. org/TR/ owl-features/, 2014-02-10.
  • 7Serafini L, Tamilin A. Drago: Distributed reasoning archi- tecture for the semantic Web [ J ]. Lecture Notes in Com- puter Science, 2005,3532:361-376.
  • 8Meditskos G, Bassiliades N. DLEJena: A practical for- ward-chaining OWL 2 RL reasoner combining Jena and Pel- let[ J]. Web Semantics: Science, Services and Agents on the World Wide Web, 2010,8( 1 ) :89-94.
  • 9Apache Software Foundation. Apache Jena-A Free and Open Source Java Framework for Building Semantic Web and Linked Data Application [ EB/OL]. http:// jena. sourceforge, net, 2014-03-01.
  • 10Noy N F, Sintek M, Decker S, et al. Creating semantic Web contents with Protg6-2000[ J]. IEEE Intelligent Sys- tems, 2001,16(2) :60-71.

引证文献4

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部