首页> 外文会议>International joint conference on artificial intelligence >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算法的扩展,性能保证,有效地处理高维特征空间中的数十万个专利对判断。同质基本无线专利数据集的实验表明,SVM_(PR)平均执行30%-40%,比许多其他最先进的通用信息检索方法在不同截止时的NDCG测量方面优于许多最先进的通用信息检索方法职位。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号