Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-19T00:36:12.969Z Has data issue: false hasContentIssue false

Engineering Knowledge Graph for Keyword Discovery in Patent Search

Published online by Cambridge University Press:  26 July 2019

Serhad Sarica*
Affiliation:
Singapore University of Technology and Design, Engineering Product Development Pillar;
Binyang Song
Affiliation:
Singapore University of Technology and Design, Engineering Product Development Pillar;
En Low
Affiliation:
Singapore University of Technology and Design
Jianxi Luo
Affiliation:
Singapore University of Technology and Design, Engineering Product Development Pillar;
*
Contact: Sarica, Serhad, Singapore University of Technology and Design Engineering Product Development, Singapore, serhadsarica@gmail.com

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Patent retrieval and analytics have become common tasks in engineering design and innovation. Keyword-based search is the most common method and the core of integrative methods for patent retrieval. Often searchers intuitively choose keywords according to their knowledge on the search interest which may limit the coverage of the retrieval. Although one can identify additional keywords via reading patent texts from prior searches to refine the query terms heuristically, the process is tedious, time-consuming, and prone to human errors. In this paper, we propose a method to automate and augment the heuristic and iterative keyword discovery process. Specifically, we train a semantic engineering knowledge graph on the full patent database using natural language processing and semantic analysis, and use it as the basis to retrieve and rank the keywords contained in the retrieved patents. On this basis, searchers do not need to read patent texts but just select among the recommended keywords to expand their queries. The proposed method improves the completeness of the search keyword set and reduces the human effort for the same task.

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BYCreative Common License - NCCreative Common License - ND
This is an Open Access article, distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives licence (http://creativecommons.org/licenses/by-nc-nd/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is unaltered and is properly cited. The written permission of Cambridge University Press must be obtained for commercial re-use or in order to create a derivative work.
Copyright
© The Author(s) 2019