Skip to Main Content (Press Enter)

Logo UNINSUBRIA
  • ×
  • Home
  • Degrees
  • Courses
  • Jobs
  • People
  • Outputs
  • Organizations
  • Third Mission
  • Projects
  • Expertise & Skills

UNI-FIND
Logo UNINSUBRIA

|

UNI-FIND

uninsubria.it
  • ×
  • Home
  • Degrees
  • Courses
  • Jobs
  • People
  • Outputs
  • Organizations
  • Third Mission
  • Projects
  • Expertise & Skills
  1. Outputs

Terrorizer: a novel algorithm for patent assignee name disambiguation

Academic Article
Publication Date:
2026
abstract:
The problem of disambiguation of company names poses a significant challenge in extracting useful information from patents. This issue biases research outcomes as it mostly underestimates the number of patents attributed to companies, particularly multinational corporations which file patents under a plethora of names, including alternate spellings of the same entity and, eventually, companies' subsidiaries. To date, addressing these challenges has relied on labor-intensive dictionary based or string matching approaches, leaving the problem of patents' assignee harmonization on large datasets mostly unresolved. To bridge this gap, this paper describes the Terrorizer algorithm, a text-based algorithm that leverages natural language processing (NLP), network theory, and rule-based techniques to harmonize the variants of company names recorded as patent assignees. In particular, the algorithm follows the tripartite structure of its antecedents, namely parsing, matching and filtering stage, adding an original "knowledge augmentation" phase which is used to enrich the information available on each assignee name. We use Terrorizer on a set of 325'917 company names who are assignees of patents granted by the USPTO from 2005 to 2022. The performance of Terrorizer is evaluated on four gold standard datasets. This validation step shows two main advantages of Terrorizer: the first is that its performance is similar over different kinds of datasets, proving that our algorithm generalizes well. Second, it performs better than other existing algorithms currently used in patent data analysis. We use the Tree-structured Parzen Estimator (TPE) optimization algorithm for the hyperparameters' tuning. Our final result is a reduction in the initial set of names of over 42%. Finally, we show an application of our algorithm by analyzing patent transactions registered at the USPTO and identifying the most important intermediaries in the transaction network of ICT patents.
Iris type:
Articolo su Rivista
Keywords:
Entity linking; Patent assignee; Natural language processing; Network theory; C15; C81; O34
List of contributors:
Ascione, G. S.; Sterzi, V.; Vezzulli, A.
Authors of the University:
STERZI VALERIO VITTORIO ANTONIO
VEZZULLI ANDREA
Handle:
https://irinsubria.uninsubria.it/handle/11383/2205553
Published in:
SCIENTOMETRICS
Journal
Project:
NODES – Nord Ovest Digitale E Sostenibile​
  • Accessibility
  • Use of cookies

Powered by VIVO | Designed by Cineca | 26.4.5.0