首页> 外国专利> A METHOD TO RANK DOCUMENTS BY A COMPUTER, USING ADDITIVE ENSEMBLES OF REGRESSION TREES AND CACHE OPTIMISATION, AND SEARCH ENGINE USING SUCH A METHOD

A METHOD TO RANK DOCUMENTS BY A COMPUTER, USING ADDITIVE ENSEMBLES OF REGRESSION TREES AND CACHE OPTIMISATION, AND SEARCH ENGINE USING SUCH A METHOD

机译:利用回归树的添加包络和缓存优化,用计算机对文档进行排序的方法,以及使用这种方法搜索引擎的方法

摘要

The present invention concerns a novel method to efficiently score documents (texts, images, audios, videos, and any other information file) by using a machine-learned ranking function modeled by an additive ensemble of regression trees. A main contribution is a new representation of the tree ensemble based on bitvectors, where the tree traversal, aimed to detect the leaves that contribute to the final scoring of a document, is performed through efficient logical bitwise operations. In addition, the traversal is not performed one tree after another, as one would expect, but it is interleaved, feature by feature, over the whole tree ensemble. Tests conducted on publicly available LtR datasets confirm unprecedented speedups (up to 6.5×) over the best state-of-the-art methods.
机译:本发明涉及一种新颖的方法,该方法通过使用由回归树的累加集合建模的机器学习的排名函数来有效地对文档(文本,图像,音频,视频和任何其他信息文件)进行评分。一个主要贡献是基于位向量的树集合的新表示形式,其中树的遍历旨在通过有效的逻辑按位运算执行,以检测有助于文档最终评分的叶子。另外,遍历不是像一棵树那样一棵接一棵地进行,而是遍历整个树的整体逐个特征地交织。在公开可用的LtR数据集上进行的测试证实,与最好的最新方法相比,前所未有的提速(最高6.5倍)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号