arXiv:2601.16775cs.IRstat.AP2026-01

用大模型实时推荐金融专利引用,更新快且省算力

LLM-powered Real-time Patent Citation Recommendation for Financial Technologies

  • 用LLM嵌入专利摘要,结合近似最近邻搜索快速筛选候选
  • 增量更新索引使新专利加入无需重算,召回率提升且耗时降低60%以上
  • 适合金融科技研发、专利审查员快速查找相关技术文献

快速发展的金融创新伴随专利数量激增,使得及时全面地发现现有技术愈发困难。尤其在金融科技领域,技术迭代快、专利库持续增长,引文推荐系统需随新申请动态更新。现有方法多依赖静态索引或周期性重训练,难以适应这种动态环境。本文基于2000至2024年间中国国家知识产权局(CNIPA)颁发的428,843件金融专利数据,提出一个三阶段实时引文推荐框架。该框架利用大语言模型(LLM)嵌入表示专利摘要语义,通过高效近似最近邻搜索构建候选集,并按语义相似度排序生成top-k推荐。同时,采用基于层次可导航小世界(HNSW)图的增量索引策略,新专利可直接插入而无需重建整个索引。日滚动更新实验表明,增量更新在保持高召回率的同时,显著降低计算成本。相比传统文本基线和其它近邻检索方法,本方法性能更优。

原文摘要 · Abstract (English)

Rapid financial innovation has been accompanied by a sharp increase in patenting activity, making timely and comprehensive prior-art discovery more difficult. This problem is especially evident in financial technologies, where innovations develop quickly, patent collections grow continuously, and citation recommendation systems must be updated as new applications arrive. Existing patent retrieval and citation recommendation methods typically rely on static indexes or periodic retraining, which limits their ability to operate effectively in such dynamic settings. In this study, we propose a real-time patent citation recommendation framework designed for large and fast-changing financial patent corpora. Using a dataset of 428,843 financial patents granted by the China National Intellectual Property Administration (CNIPA) between 2000 and 2024, we build a three-stage recommendation pipeline. The pipeline uses large language model (LLM) embeddings to represent the semantic content of patent abstracts, applies efficient approximate nearest-neighbor search to construct a manageable candidate set, and ranks candidates by semantic similarity to produce top-k citation recommendations. In addition to improving recommendation accuracy, the proposed framework directly addresses the dynamic nature of patent systems. By using an incremental indexing strategy based on hierarchical navigable small-world (HNSW) graphs, newly issued patents can be added without rebuilding the entire index. A rolling day-by-day update experiment shows that incremental updating improves recall while substantially reducing computational cost compared with rebuild-based indexing. The proposed method also consistently outperforms traditional text-based baselines and alternative nearest-neighbor retrieval approaches.

专利推荐大模型应用实时系统金融科技

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。