使用图顶点比较的通道检索

2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System Pub Date : 2007-12-16 DOI:10.1109/SITIS.2007.82

T. Dkaki, J. Mothe, Q. Truong

{"title":"使用图顶点比较的通道检索","authors":"T. Dkaki, J. Mothe, Q. Truong","doi":"10.1109/SITIS.2007.82","DOIUrl":null,"url":null,"abstract":"In this paper, we describe an Information retrieval Model based on graph comparison. It is inspired from previous work such as KleinbergpsilaHits and Blondel et al.psilas model. Unlike previous methods, our model considers different types of nodes: text nodes (elements to retrieve and query) and term nodes, so that the resulting graph is a bipartite graph. The results on passage retrieval task show that high precision is improved using this model.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"289 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Passage Retrieval Using Graph Vertices Comparison\",\"authors\":\"T. Dkaki, J. Mothe, Q. Truong\",\"doi\":\"10.1109/SITIS.2007.82\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we describe an Information retrieval Model based on graph comparison. It is inspired from previous work such as KleinbergpsilaHits and Blondel et al.psilas model. Unlike previous methods, our model considers different types of nodes: text nodes (elements to retrieve and query) and term nodes, so that the resulting graph is a bipartite graph. The results on passage retrieval task show that high precision is improved using this model.\",\"PeriodicalId\":234433,\"journal\":{\"name\":\"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System\",\"volume\":\"289 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SITIS.2007.82\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SITIS.2007.82","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

本文描述了一种基于图比较的信息检索模型。它的灵感来自先前的工作，如KleinbergpsilaHits和Blondel等人的psilas模型。与以前的方法不同，我们的模型考虑了不同类型的节点:文本节点(要检索和查询的元素)和术语节点，因此得到的图是一个二部图。实验结果表明，该模型提高了文本检索的精度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Passage Retrieval Using Graph Vertices Comparison

In this paper, we describe an Information retrieval Model based on graph comparison. It is inspired from previous work such as KleinbergpsilaHits and Blondel et al.psilas model. Unlike previous methods, our model considers different types of nodes: text nodes (elements to retrieve and query) and term nodes, so that the resulting graph is a bipartite graph. The results on passage retrieval task show that high precision is improved using this model.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System

自引率

0.00%

发文量