首页> 外文会议>International joint conference on artificial intelligence;IJCAI-09 >Ranking Structured Documents: A Large Margin Based Approach for Patent Prior Art Search
【24h】

Ranking Structured Documents: A Large Margin Based Approach for Patent Prior Art Search

机译:对结构化文档进行排名:专利现有技术检索的基于大利润率的方法

获取原文

摘要

We propose an approach for automatically ranking structured documents applied to patent prior art search. Our model, SVM Patent Ranking (SVM_(PR)) incorporates margin constraints that directly capture the specificities of patent citation ranking. Our approach combines patent domain knowledge features with meta-score features from several different general Information Retrieval methods. The training algorithm is an extension of the Pegasos algorithm with performance guarantees, effectively handling hundreds of thousands of patent-pair judgements in a high dimensional feature space. Experiments on a homogeneous essential wireless patent dataset show that SVM_(PR) performs on average 30%-40% better than many other state-of-the-art general-purpose Information Retrieval methods in terms of the NDCG measure at different cut-off positions.
机译:我们提出一种用于自动对应用于专利现有技术搜索的结构化文档进行排名的方法。我们的模型SVM专利排名(SVM_(PR))包含了可以直接捕获专利引文排名特异性的边际限制。我们的方法将专利领域的知识特征与来自几种不同的通用信息检索方法的元得分特征相结合。训练算法是Pegasos算法的扩展,具有性能保证,可在高维特征空间中有效处理成千上万的专利对判断。在同类必不可少的无线专利数据集上进行的实验表明,就不同截止时间的NDCG度量而言,SVM_(PR)的性能平均比许多其他最新的通用信息检索方法好30%-40%职位。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号