检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李凤侠[1] Li Fengxia(Tsinghua University Library,Beijing 100084)
机构地区:[1]清华大学图书馆,北京100084
出 处:《情报探索》2021年第3期69-77,共9页Information Research
摘 要:[目的/意义]针对专利文献的特殊性,选择合适的引文分析方法和研究单元,对专利“睡美人”进行识别和分析。[方法/过程]通过总结分析现有“睡美人”识别方法,选择对总被引次数依赖性小、可规避不同学科引文差异影响的Bcp指数方法识别筛选专利“睡美人”。利用Incopat专利信息平台,检索清华大学的所有专利文献,统计分析引文分布,筛选Bcp指数Top50的简单专利族,并以一个典型专利家族为例分析专利“睡美人”的价值。[结果/结论]Bcp指数方法可行和有效。本文修正了Bcp指数方法相关指标,并明确其计算方法。筛选出的简单专利族绝大多数有很高的合享价值度,属于高价值专利,但专利“睡美人”处于有效状态的比例低。如果能尽早识别筛选出关注度不太高但具有高价值的专利“睡美人”,对促进技术持续研发和迭代、加强专利布局、提高专利成果转移转化,实现专利的经济价值有非常重要的现实意义。[Purpose/significance]According to the characteristics of patents the paper chooses appropriate citation analysis method and research unit and identifies and analyzes sleeping beauty patents.[Method/process]The paper summarizes the identification methods of sleeping beauty patents and chooses the Bcp index which is in low total cited frequency dependence and can avoid the influence of different disciplines quotation difference.Based on the simple patent families of Tsinghua University in Incopat citation distribution was analyzed statistically Top50 simple patent families were selected and the value of sleeping beauty patents was discussed through a case study on a typical patent family.[Result/conclusion]The identification method Bcp index is feasible and effective.Furthermore related indexes on Bcp index were revised and the calculation method was made clear.In general the Top50 simple patent families belong to high value patents with high share value degree.It is pity that most of them are invalid.We’d better identify them out as early as possible so as to promote the technology sustainable development and iteration strengthen patents layout improve patents’transfer and transformation and realize the economic value of patents.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3