mlsanityData to 14 Oct 2026

Embedding Knowledge Graph of Patent Metadata to Measure Knowledge Proximity

arXiv 2211.01768 ↗First posted 3 Nov 2022cs.IRcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 3 Nov 2022.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.