A flexible, scaleable approach to the international patent 'name game'
The inventors in PATSTAT are often duplicates: the same person or company may be split into multiple entries in PATSTAT, each associated to different patents. In this paper, we address this problem with an algorithm that efficiently de-duplicates the data. It needs minimal manual input and works well even on consumer-grade computers. Comparisons between entries are not limited to their names, and thus this algorithm is an improvement over earlier ones that required extensive manual work or overly cautious clean-up of the names. Source code on Github. Download data.
Year of publication: |
2014-09
|
---|---|
Authors: | Huberty, Mark ; Serwaah, Amma ; Zachmann, Georg |
Institutions: | Bruegel |
Saved in:
freely available
Saved in favorites
Similar items by person
-
A scaleable approach to emissions-innovation record linkage
Huberty, Mark, (2014)
-
When and how to support renewables? Letting the data speak
Zachmann, Georg, (2014)
-
When & how to support renewables? Letting the data speak
Zachmann, Georg,
- More ...