首页> 外文学位 >Optimizing ranking functions: A connectionist approach to adaptive information retrieval.
【24h】

Optimizing ranking functions: A connectionist approach to adaptive information retrieval.

机译:优化排名功能:一种连接主义的自适应信息检索方法。

获取原文
获取原文并翻译 | 示例

摘要

This dissertation examines the use of adaptive methods to automatically improve the performance of ranked text retrieval systems. The goal of a ranked retrieval system is to manage a large collection of text documents and to order documents for a user based on the estimated relevance of the documents to the user's information need (or query). The ordering enables the user to quickly find documents of interest. Ranked retrieval is a difficult problem because of the ambiguity of natural language, the large size of the collections, and because of the varying needs of users and varying collection characteristics.; We propose and empirically validate general adaptive methods which improve the ability of a large class of retrieval systems to rank documents effectively. Our main adaptive method is to numerically optimize free parameters in a retrieval system by minimizing a non-metric criterion function. The criterion measures how well the system is ranking documents relative to a target ordering, defined by a set of training queries which include the users' desired document orderings. Thus, the system learns parameter settings which better enable it to rank relevant documents before irrelevant. The non-metric approach is interesting because it is a general adaptive method, an alternative to supervised methods for training neural networks in domains in which rank order or prioritization is important. A second adaptive method is also examined, which is applicable to a restricted class of retrieval systems but which permits an analytic solution.; The adaptive methods are applied to a number of problems in text retrieval to validate their utility and practical efficiency. The applications include: A dimensionality reduction of vector-based document representations to a vector space in which inter-document similarity more accurately predicts semantic association; the estimation of a similarity measure which better predicts the relevance of documents to queries; and the estimation of a high-performance neural network combination of multiple retrieval systems into a single overall system. The applications demonstrate that the approaches improve performance and adapt to varying retrieval environments. We also compare the methods to numerous alternative adaptive methods in the text retrieval literature, with very positive results.
机译:本文研究了自适应方法的使用,以自动提高排名文本检索系统的性能。分级检索系统的目标是管理大量文本文档,并根据文档与用户信息需求(或查询)的估计相关性为用户订购文档。该排序使用户能够快速找到感兴趣的文档。排序检索是一个困难的问题,因为自然语言的歧义性,馆藏的规模大以及用户的需求和馆藏特征的变化。我们提出并凭经验验证了通用的自适应方法,这些方法可提高大型检索系统对文档进行有效排名的能力。我们的主要自适应方法是通过最小化非度量标准函数在数值上优化检索系统中的自由参数。该标准衡量系统相对于目标排序对文档排序的程度,该目标排序是由一组训练查询定义的,其中包括用户所需的文档排序。因此,系统学习参数设置,从而更好地使其能够在不相关之前对相关文档进行排名。非度量方法很有趣,因为它是一种通用的自适应方法,是在排序顺序或优先级很重要的领域中训练神经网络的监督方法的替代方法。还研究了第二种自适应方法,该方法适用于受限类别的检索系统,但允许进行解析。将自适应方法应用于文本检索中的许多问题,以验证其实用性和实用性。这些应用程序包括:将基于矢量的文档表示降维到矢量空间,在该空间中文档间相似性可以更准确地预测语义关联;评估相似性度量,以更好地预测文档与查询的相关性;以及将多个检索系统组合成一个整体系统的高性能神经网络的估计。这些应用程序表明,这些方法可以提高性能并适应各种检索环境。我们还将这些方法与文本检索文献中的众多替代性自适应方法进行了比较,取得了非常积极的成果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号