期刊文献+

基于主题模型的深层网数据源选择算法 被引量:3

Deep Web resource selection using topic model
下载PDF
导出
摘要 联邦搜索是从大规模深层网上获取信息的一种重要技术。给定一个用户查询,联邦搜索系统需要解决的一个主要问题是数据源选择问题,即从海量数据源中选出一组最有可能返回相关结果的数据源。现有的数据源选择算法大多基于数据源的样本文档集和查询之间的关键词匹配,通常无法很好地解决少量样本文档的信息缺失问题。针对这一问题,提出了基于隐含狄利克雷分布(LDA)主题模型进行数据源选择的方法。首先,使用LDA主题模型获得数据源和查询的主题概率分布;然后,通过比较两者主题概率分布的相近性来对所有数据源进行排序。通过将数据源和查询映射到低维的主题空间来解决高维词条空间稀疏性所带来的信息缺失问题。在TREC Fed Web 2013和2014 Track的测试集上分别进行了实验,并和其他参赛方法的结果进行了比较。在Fed Web 2013测试集上的实验结果显示比其他参赛方法的最好结果提高了24%;在Fed Web 2014测试集上的实验结果显示比传统的基于小文档和大文档的关键词匹配方法分别提高了22%和43%。另外,使用文档片段来代替文档还可以大幅提升系统的效率,更增加了此方法的实用性和可行性。 Federated search is a widely-used technique to find information on Deep Web. Given a user query, one of the challenges for a federated search system is to select a set of resources that are most likely to return relevant results for the query. Most existing resource selection methods are based on text-matching between the sample documents of the resource and the query, which typically suffer the problem of missing vocabulary or incomplete information. To alleviate the problem of incomplete information, Latent Diriehlet Allocation (LDA) topic model approach for resource selection was proposed. First, topic probability distributions for resources and query were inferred using LDA topic model approach. Then the similarities between the topic distributions of resources and query were calculated to rank the resources. By mapping both resources and the query into the low dimensional topic space, the problem of missing information caused by the sparsity of high dimensional word space was alleviated. Experiments were conducted on the test sets of TREC FedWeb 2013 and 2014 Tracks, and the results were compared with that of other participants in the Tracks. The experimental results on the TREC FedWeb 2013 Track show that the LDA based approach outperforms the best result of other participants by 24%; and the results on the TREC FedWeb 2014 Track show that it outperforms the best results of the traditional text-matching-based resource selection methods using either small- or big-document strategies by 22% for small-document methods and 43% for big-document methods respectively. In addition, using sampled snippets rather than documents to generate big-document representation for resources can significantly improve the efficiency of the system, thus enables the proposed approach more feasible and applicable in practice.
出处 《计算机应用》 CSCD 北大核心 2015年第9期2553-2559,2595,共8页 journal of Computer Applications
基金 国家自然科学基金资助项目(61202331 61472425) 软件工程国家重点实验室开放研究基金资助项目(SKLSE2012-09-33)
关键词 深层网 主题模型 隐含狄利克雷分布 数据源选择 联邦搜索 deep Web topic model Latent Dirichlet Allocation (LDA) data resource selection federated search
  • 相关文献

参考文献30

  • 1BERGMAN M K. The deep Web: surfacing hidden value [ J]. Jour- nal of Electronic Publishing, 2001,7(1) : 113 - 153.
  • 2HE B, PATEL M, ZHANG Z, et al. Accessing the deep Web: a survey [ J]. Communications of ACM, 2007, 50(5) : 94 - 101.
  • 3MADHAVAN J, JEFFERY S, COHEN S, et al. Web-scale data in- tegration: you can only afford to pay as you go [ EB/OL]. [ 2015- 01-04]. http://citeseerx, ist. psu. edu/viewdoc/download? doi = 10.1.1.66. 9358&rep = repl &type = pdf.
  • 4CAFARELLA M J, HALEVY A, MADHAVAN J. Structured data on the Web [J]. Communications of ACM, 2011,54(2):72 -79.
  • 5MADHAVAN J, KO D, KOT L, et al. Google's deep Web crawl [ J]. Proceedings of the Very Large Data Base Endowment, 2008, 1 (2) : 1241 - 1252.
  • 6ARGUELLO J, CALLAN J, DIAZ F. Classification-based resource selection [ C] // Proceedings of the 18th ACM Conference on Infor- mation and Knowledge Management. New York: ACM, 2009:1277 - 1286.
  • 7SHAN J, MAN L. Simple may be best- a simple and effective method for federated Web search via search engine impact factor es- timation [ EB/OL]. [ 2015- 01- 06]. http://trec, nist. gov/pubs/ trec23/papers/pro-ECNU_federated, pdf.
  • 8CALLAN J, CONNELL M. Query-based sampling of text databases [ J]. ACM Transactions on Infomaation Systems, 2011,19(2) : 97 - 130.
  • 9HIEMSTRA D, DEMEESTER T, TRIESCHNIGG D. TREC federa- ted Web search track [ EB/OL]. [ 2015- 01- 03]. https://sites. google, eom/site/treefedweb/.
  • 10CALLAN J P, LU Z, CROFT W B. Searching distributed collec- tions with inference networks [ C]//Proceedings of the 18th Annu- M International ACM SIGIR Conference on Research and Develop- ment in Information Retrieval. New York: ACM, 1995:21 -28.

同被引文献21

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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