传递马尔可夫网络用于信息检索

Meihua Yu, Mingwen Wang, Jiali Zuo, Xiaofang Zou
{"title":"传递马尔可夫网络用于信息检索","authors":"Meihua Yu, Mingwen Wang, Jiali Zuo, Xiaofang Zou","doi":"10.1109/JCAI.2009.92","DOIUrl":null,"url":null,"abstract":"Along with the development of internet, a lot of new data appears in the web every day. To construct a retrieval model to adapt the new data quickly and to retrieval the new documents accurately is becoming an important research topic. In this paper, we put forward a new retrieval model by incorporating the theory of transfer learning with Markov Network. Firstly, compare term spaces network of old dataset and new (target) dataset, and the distance between data sets is measured using the Kullback-Leibler divergence. Moreover, KL-divergence is used to decide the trade-off parameter in retrieval formula. Then we transfer the useful prior knowledge of old dataset to the new (target) dataset, and finally implement the retrieval process on the target dataset. Experiments on multiple datasets indicate that our new approach outperforms other methods. Furthermore, we perform several T-tests to demonstrate the improvements are statistically significant.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Transferring Markov Network for Information Retrieval\",\"authors\":\"Meihua Yu, Mingwen Wang, Jiali Zuo, Xiaofang Zou\",\"doi\":\"10.1109/JCAI.2009.92\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Along with the development of internet, a lot of new data appears in the web every day. To construct a retrieval model to adapt the new data quickly and to retrieval the new documents accurately is becoming an important research topic. In this paper, we put forward a new retrieval model by incorporating the theory of transfer learning with Markov Network. Firstly, compare term spaces network of old dataset and new (target) dataset, and the distance between data sets is measured using the Kullback-Leibler divergence. Moreover, KL-divergence is used to decide the trade-off parameter in retrieval formula. Then we transfer the useful prior knowledge of old dataset to the new (target) dataset, and finally implement the retrieval process on the target dataset. Experiments on multiple datasets indicate that our new approach outperforms other methods. Furthermore, we perform several T-tests to demonstrate the improvements are statistically significant.\",\"PeriodicalId\":154425,\"journal\":{\"name\":\"2009 International Joint Conference on Artificial Intelligence\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Joint Conference on Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCAI.2009.92\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Joint Conference on Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCAI.2009.92","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着互联网的发展,每天都有大量的新数据出现在网络上。如何建立一个快速适应新数据并准确检索新文档的检索模型成为一个重要的研究课题。本文将迁移学习理论与马尔可夫网络相结合,提出了一种新的检索模型。首先,比较旧数据集和新(目标)数据集的术语空间网络,并利用Kullback-Leibler散度测量数据集之间的距离。利用kl -散度来确定检索公式中的权衡参数。然后将旧数据集中有用的先验知识转移到新(目标)数据集中,最后在目标数据集中实现检索过程。在多个数据集上的实验表明,我们的新方法优于其他方法。此外,我们执行了几个t检验来证明改进在统计上是显著的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Transferring Markov Network for Information Retrieval
Along with the development of internet, a lot of new data appears in the web every day. To construct a retrieval model to adapt the new data quickly and to retrieval the new documents accurately is becoming an important research topic. In this paper, we put forward a new retrieval model by incorporating the theory of transfer learning with Markov Network. Firstly, compare term spaces network of old dataset and new (target) dataset, and the distance between data sets is measured using the Kullback-Leibler divergence. Moreover, KL-divergence is used to decide the trade-off parameter in retrieval formula. Then we transfer the useful prior knowledge of old dataset to the new (target) dataset, and finally implement the retrieval process on the target dataset. Experiments on multiple datasets indicate that our new approach outperforms other methods. Furthermore, we perform several T-tests to demonstrate the improvements are statistically significant.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Robust Feature Normalization Algorithm for Automatic Speech Recognition Using Multimodal Analysis for Story Segmentation of News Video Study on the model of men's upper body pressure and comfort sense based on the seamless underwear's upper parts Realization of Wavelet Soft Threshold De-noising Technology Based on Visual Instrument 32-bit RISC CPU Based on MIPS Instruction Fetch Module Design
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1