持久性(不连续性)
计算机科学
追踪
路径(计算)
领域(数学分析)
数据挖掘
数据科学
数学
工程类
操作系统
数学分析
岩土工程
程序设计语言
作者
Hyunseok Park,Christopher L. Magee
出处
期刊:PLOS ONE
[Public Library of Science]
日期:2017-01-30
卷期号:12 (1): e0170895-e0170895
被引量:90
标识
DOI:10.1371/journal.pone.0170895
摘要
The aim of this paper is to propose a new method to identify main paths in a technological domain using patent citations. Previous approaches for using main path analysis have greatly improved our understanding of actual technological trajectories but nonetheless have some limitations. They have high potential to miss some dominant patents from the identified main paths; nonetheless, the high network complexity of their main paths makes qualitative tracing of trajectories problematic. The proposed method searches backward and forward paths from the high-persistence patents which are identified based on a standard genetic knowledge persistence algorithm. We tested the new method by applying it to the desalination and the solar photovoltaic domains and compared the results to output from the same domains using a prior method. The empirical results show that the proposed method can dramatically reduce network complexity without missing any dominantly important patents. The main paths identified by our approach for two test cases are almost 10x less complex than the main paths identified by the existing approach. The proposed approach identifies all dominantly important patents on the main paths, but the main paths identified by the existing approach miss about 20% of dominantly important patents.
科研通智能强力驱动
Strongly Powered by AbleSci AI