TY - JOUR
T1 - Embedding knowledge graph of patent metadata to measure knowledge proximity
AU - Li, Guangtong
AU - Siddharth, L.
AU - Luo, Jianxi
PY - 2023/4
Y1 - 2023/4
N2 - 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. © 2023 Association for Information Science and Technology.
AB - 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. © 2023 Association for Information Science and Technology.
UR - http://www.scopus.com/inward/record.url?scp=85146356430&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85146356430&origin=recordpage
U2 - 10.1002/asi.24736
DO - 10.1002/asi.24736
M3 - RGC 21 - Publication in refereed journal
SN - 2330-1635
VL - 74
SP - 476
EP - 490
JO - Journal of the Association for Information Science and Technology
JF - Journal of the Association for Information Science and Technology
IS - 4
ER -