Skip to main navigation Skip to search Skip to main content

Knowledge Graph-Based Patent Clustering

  • Pei Yuan Lai
  • , Man Sheng Chen*
  • , Qing Yun Dai
  • , Chang Dong Wang*
  • , Min Chen
  • , Mohsen Guizani
  • *Corresponding author for this work
  • Guangdong Polytechnic Normal University
  • Guangdong Provincial Key Laboratory of Intellectual Property and Big Data
  • South China Technology Commercialization Center
  • Sun Yat-Sen University
  • Guangxi Key Laboratory of Digital Infrastructure
  • Guangdong Key Laboratory of Big Data Analysis and Processing
  • South China University of Technology
  • Guangdong Artificial Intelligence and Digital Economy Laboratory - Guangzhou
  • Mohamed Bin Zayed University of Artificial Intelligence

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

Patent data generally includes information from different perspectives or different types, and its heterogeneous attributes can be greatly beneficial to data clustering analysis. However, the existing patent analysis method always focus on the patent text cues, and such a strategy merely depends on the feature information to capture the data characteristics, failing to multi-type informative patent representation. Therefore, in this paper, to model the underlying structure/relationships of patent data, we employ the knowledge graph to depict the heterogeneous attributes of patent, and propose a novel Knowledge Graph-based Patent Clustering (KGPC) method, where the relationship reconstruction in knowledge graph as well as clustering-oriented representation refinement for patent clustering are jointly considered. With this model, there are three components, i.e., entity representation refinement, relationship reconstruction and self-supervised entity clustering. Given a patent knowledge graph as input, the entity representation refinement can be mutually boosted by the relationship reconstruction and self-supervised clustering objective, thereby leading to a balanced clustering-oriented output. Extensive experiments on several real-world patent knowledge graph datasets validate the effectiveness of KGPC while compared with the state-of-the-art.

Original languageEnglish
Pages (from-to)6009-6019
Number of pages11
JournalIEEE Transactions on Knowledge and Data Engineering
Volume37
Issue number10
DOIs
StatePublished - 2025
Externally publishedYes

Keywords

  • Patent clustering
  • knowledge graph
  • relationship reconstruction
  • representation refinement
  • self-supervised clustering

Fingerprint

Dive into the research topics of 'Knowledge Graph-Based Patent Clustering'. Together they form a unique fingerprint.

Cite this