【24h】

Ranking Web Page with Path Trust Knowledge Graph

机译:排名与路径信任知识图的网页

获取原文

摘要

How to find and discover useful information from Internet is a real challenge in information retrieval (IR) and search engines (SE). In this paper, we propose and construct Path Trust Knowledge Graph PTKG model for assigning priority values to the unvisited web pages. For a given user specific topic t, its PTKG contains five parts: (1) The context graph G(t) = (V, E), where V is the crawled history web page set and E includes the hyper link set among the history web pages; (2) Retrieving knowledge implied in the paths among these web pages and finding their lengths; (3) Building the trust degrees among the web pages; (4) Constructing topic specific language model and general language model by using the trust degrees; (5) Assigning the priority values of web pages for ranking them. Finally, we perform an experimental comparison among our proposed PTKG approach with the classic LCG and RCG. As a result, our method outperforms LCG and RCG.
机译:如何从互联网查找和发现有用的信息是信息检索(IR)和搜索引擎(SE)中的真正挑战。在本文中,我们提出并构建路径信任知识图形PTKG模型,用于将优先级值分配给不受检控的网页。对于给定的用户特定主题T,其PTKG包含五个部分:(1)上下文图G(t)=(v,e),其中v是爬网历史网页集,e包括历史中的超链接集网页; (2)检索这些网页的路径中隐含的知识并找到它们的长度; (3)在网页中构建信任学位; (4)通过使用信托度构建特定于特定语言模型和常规语言模型; (5)分配网页的优先级值,以便排名它们。最后,我们在我们提出的PTKG方法中进行了实验比较,具有经典的LCG和RCG。结果,我们的方法优于LCG和RCG。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号