嵌入专利元数据知识图谱度量知识接近度
Embedding Knowledge Graph of Patent Metadata to Measure Knowledge Proximity
摘要:
知识接近度是指任何两个实体之间的关联强度,其结构形式体现了知识库的某些方面。在这项工作中,我们操作知识接近的背景下,美国专利数据库(知识库)使用一个知识图谱(结构形式)命名PatNet使用专利元数据,包括引文,发明人,受让人,和域分类。我们使用PatNet训练各种图嵌入模型,以获得实体和关系的嵌入。实体的对应(或变换)嵌入之间的余弦相似性表示这些之间的知识接近度。我们比较了嵌入模型在预测目标实体和解释发明人和受让人的域扩展配置文件方面的性能。然后,我们应用最佳首选模型的嵌入来关联同质(例如,专利-专利)和异质(例如,发明人-受让人)实体对。
英文摘要:
Knowledge proximity refers to the strength of association between any two entities in a structural form that embodies certain aspects of a knowledge base. In this work, we operationalize knowledge proximity within the context of the US Patent Database (knowledge base) using a knowledge graph (structural form) named PatNet built using patent metadata, including citations, inventors, assignees, and domain classifications. We train various graph embedding models using PatNet to obtain the embeddings of entities and relations. The cosine similarity between the corresponding (or transformed) embeddings of entities denotes the knowledge proximity between these. We compare the embedding models in terms of their performances in predicting target entities and explaining domain expansion profiles of inventors and assignees. We then apply the embeddings of the best-preferred model to associate homogeneous (e.g., patent-patent) and heterogeneous (e.g., inventor-assignee) pairs of entities.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。