Please wait a minute...
Advanced Search
现代图书情报技术  2011, Vol. 27 Issue (6): 14-19     https://doi.org/10.11925/infotech.1003-3513.2011.06.03
  DLIB & OSS 2011论文选登 本期目录 | 过刊浏览 | 高级检索 |
专利排名算法——运用引用次数与引文网络计算美国专利的研究
顾立平
国立台湾大学图书资讯系 台北 10617
PatentRank Algorithm——A Study of Using Cited Time and Citation Network to Calculate U.S. Patents
Ku Liping
Department of Library and Information Science, National Taiwan University, Taipei 10617, China
全文: PDF (401 KB)   HTML  
输出: BibTeX | EndNote (RIS)      
摘要 在网页排名和论文排名基础上,采用引用频次标准和引文网络计算排名数值,建立专利排名算法。分析美国专利和商标局的数据库中的数字图书馆相关专利,研究结果显示专利排名算法能够区分相同引用次数的专利排名。该研究是网页排名算法的一种新型应用。
服务
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章
顾立平
关键词 专利检索专利分析专利计量专利评估专利表现专利质量    
Abstract:Based on the PageRank and ArticleRank, the paper uses the times cited criterion and citation network to calculate the rank scores,thus establishes the PatentRank Algorithm. Then it analyzes the relevant digital library patents of the USPTO patent database and the results show that the PatentRank Algorithm can differentiate patents which of the same number of citations. The originality is a novel application of the PageRank Algorithm.
Key wordsPatent retrieval    Patent analysis    Patentmetrics    Patent evaluation    Patent performance    Patent quality
收稿日期: 2011-03-22      出版日期: 2011-08-15
: 

G312

 
基金资助:

本文系2010年度中山大学重大项目培育和新兴交叉学科资助计划项目“高层次科技人才信息挖掘和评价方法与系统”的研究成果之一。

引用本文:   
顾立平. 专利排名算法——运用引用次数与引文网络计算美国专利的研究[J]. 现代图书情报技术, 2011, 27(6): 14-19.
Ku Liping. PatentRank Algorithm——A Study of Using Cited Time and Citation Network to Calculate U.S. Patents. New Technology of Library and Information Service, 2011, 27(6): 14-19.
链接本文:  
https://manu44.magtech.com.cn/Jwk_infotech_wk3/CN/10.11925/infotech.1003-3513.2011.06.03      或      https://manu44.magtech.com.cn/Jwk_infotech_wk3/CN/Y2011/V27/I6/14
[1] Corso G M D, Romani F, Binii D A. Versatile Weighting Strategies for a Citation-based Research Evaluation Model[ED/OL]. [2010-10-27]. http://www.dmi.unipg.it/lmc/galn/data/talk/delcorso.pdf.

[2] Li J, Willett P. ArticleRank: A PageRank-based Alternative to Numbers of Citations for Analyzing Citation Networks[J]. Aslib Proceedings:New Information Perspectives, 2009, 61(6):605-618.

[3] Yan E, Ding Y. Discovering Author Impact: A PageRank Perspective[J]. Information Processing & Management, 2011, 47(1):125-134.

[4] Liu X, Bollen J, Nelson M L, et al. Co-authorship Networks in the Digital Library Research Community[J]. Information Processing & Management, 2005, 41(6):1462-1480.

[5] Fiala D, Rousselot F, Jezek K. PageRank for Bibliographic Networks[J]. Scientometrics, 2008, 76(1):135-158.

[6] Yan E, Ding Y. Applying Centrality Measures to Impact Analysis:A Co-authorship Network Analysis[J]. Journal of the American Society for Information Science and Technology, 2009, 60(10):2107-2118.

[7] Ding Y, Yan E, Frazho A, et al. PageRank for Ranking Authors in Co-citation Networks[J]. Journal of the American Society for Information Science and Technology, 2009, 60(11):2229-2243.

[8] Wu X, Kumar V, Quinlan J R, et al. Top 10 Algorithms in Data Mining[J]. Knowledge and Information System, 2008, 14(1):1-37.

[9] Page L, Brin S, Motwani R, et al. The PageRank Citation Ranking: Bringing Order to the Web [ED/OL]. [2010-10-27]. http://ilpubs.stanford.edu:8090/422/.

[10] Brin S, Page L. The Anatomy of a Large-scale Hypertextual Web Search Engine[J]. Computer Networks and ISDN Systems,1998, 30(1-7):107-117.

[11] Uddin M N, Janecek P. A Framework for Integrating Faceted Classification Within a Content Management System[ED/OL].[2011-04-07] .http://kst.buu.ac.th/proceedings/JCSSE2005/pdf/a-702.pdf.

[12] Berlt K, Moura E S, Carvalho A, et al. Modeling the Web as a Hypergraph to Compute Page Reputation[J]. Information Systems, 2010, 35(5):530-543.

[13] Eirinaki M, Vazirgiannis M. Web Site Personalization Based on Link Analysis and Navigational Patterns[J]. ACM Transactions on Internet Technology, 2007, 7(4):1-27.

[14] Witten I H. Searching … in a Web[J]. Journal of Universal Computer Science, 2008, 14(10):1739-1762.

[15] Pinskis G, Narin F. Citation Influence for Journal Aggregates of Scientific Publications: Theory, with Application to the Literature of Physics[J]. Information Processing and Management, 1976, 12(5):297-312.

[16] Boldi R, Santini M, Vigna S. PageRank: Functional Dependencies[J/OL]. ACM Transactions on Information Systems. [2010-09-22]. http://vigna.dsi.unimi.it/ftp/papers/PageRankFunctional.pdf.

[17] Ma N, Guan J, Zhao Y. Bringing PageRank to the Citation Analysis[J]. Information Processing and Management, 2008, 44(2):800-810.

[18] Tague-Sutcliffe J. An Introduction to Informetrics[J]. Information Processing and Management, 1992, 28(1):1-3.

[19] Björneborn L, Ingwersen P. Perspectives of Webometrics[J]. Scientometrics, 2001, 50(1):78-79.

[20] Sidiropoulos A, Manolopoulos Y. Generalized Comparison of Graph-based Ranking Algorithms for Publications and Authors[J]. Journal of Systems and Software,2006, 79(12):1679-1700.

[21] Krapivin M, Marchese M, Casati F. Exploring and Understanding Citation-based Scientific Metrics [EB/OL]. [2010-09-22].http://disi.unitn.it/~krapivin/acs-2009-metrics.pdf.

[22] Yang W S, Jan Y S. Increasing the Authoritativeness of Web Recommendations Using PageRank-based Approaches[J]. Online Information Review, 2009, 33(2):362-375.

[23] 罗思嘉. 专利计量分析与应用[J]. 国立成功大学图书馆馆刊, 2007(16):43-54.

[24] 陈达仁,黄慕萱. 专利资讯-检索、分析与策略[M].台北:华泰文化, 2009.

[25] Lin Y, Shi X, Wei Y. On Computing PageRank via Lumping the Google Matrix[J]. Journal of Computational and Applied Mathematics, 2009, 224(2):702-708.

[26] Gleich D F, Gray A P, Chen G, et al. An Inner-outer Iteration for Computing Pagerank[J]. Society for Industrial and Applied Mathematics, 2010,32(1):349-371.

[27] Andersson F K, Silvestrov S D. The Mathematics of Internet Search Engines[J]. Acta Applicandae Mathematicae, 2008, 104(2): 211-242.

[28] Wills R S, Ipsen I C F. Ordinal Ranking for Google’s PageRank[J]. Matrix Annual, 2009, 30(4):1677-1696.

[29] Liu Y, Liu T Y, Gao B, et al. A Framework to Compute Page Importance Based on User Behaviors[J]. Information Retrieval, 2010, 13(1):22-45.

[30] Kim H, Chan P. Personalized Search Results with User Interest Hierarchies Learnt from Bookmarks[J]. Advances in Web Mining and Web Usage Analysis, 2006, 4198:158-176.

[31] Ke Y, Deng L, Ng W, et al. Web Dynamics and Their Ramifications for the Development of Web Search Engines[J]. Computer Networks, 2006, 50(10):1430-1447.

[32] Li Q, Chen Y P. Person 樢 ed Text Snippet Extraction Using Statistical Language Models[J]. Pattern Recognition, 2010, 43(1):378-386.

[33] Vallejo C G, Troyano J A, Ortega F J. InstanceRank: Bringing Order to Datasets[J]. Pattern Recognition Letters, 2010, 31(2):133-142.
[1] 李姝影, 方曙. 测度技术融合与趋势的数据分析方法研究进展*[J]. 数据分析与知识发现, 2017, 1(7): 2-12.
[2] 谷威, 李超凡, 王洪俊, 肖诗斌, 施水才. 专利检索日志的同义词获取[J]. 现代图书情报技术, 2015, 31(2): 24-30.
[3] 张云, 华薇娜, 袁顺波, 苏保朵. WoS数据库中专利分析论文的主题动态演进研究[J]. 现代图书情报技术, 2015, 31(1): 17-23.
[4] 韩红旗,桂婕,徐硕,刘玉琴. 基于专利文本数据的技术实力评价方法*[J]. 现代图书情报技术, 2014, 30(1): 66-71.
[5] 王丽, 张冬荣, 张晓辉, 杨小薇, 吴鸣. 利用主题自动标引生成技术功效矩阵[J]. 现代图书情报技术, 2013, (5): 80-86.
[6] 刘春江, 刘丹军, 文奕. 基于Solr的专利在线分析系统的设计与实现[J]. 现代图书情报技术, 2013, 29(2): 88-92.
[7] 陈颖, 张晓林. 专利中技术词和功效词识别方法研究[J]. 现代图书情报技术, 2011, 27(12): 24-30.
[8] 陈颖, 张晓林. 专利技术功效矩阵构建研究进展[J]. 现代图书情报技术, 2011, (11): 1-8.
[9] 张鹏 刘平 唐田田 高祥林 邓亮 孙大龙. 布拉德福定律在专利分析系统中的应用[J]. 现代图书情报技术, 2010, 26(7/8): 84-87.
[10] 唐田田,刘平,张鹏,葛富斌,李明. 冈珀兹曲线模型在专利发展趋势预测中的应用[J]. 现代图书情报技术, 2009, 25(11): 59-63.
[11] 杨璧嘉,张旭. 专利网络分析在技术路线图中的应用[J]. 现代图书情报技术, 2008, 24(5): 61-66.
[12] 王曰芬,徐丹丹,李飞. 专利信息内容挖掘及其试验研究*[J]. 现代图书情报技术, 2008, 24(12): 59-65.
[13] 颜端武,张秀梅,邬尚君. 在线专利分析软件的应用:企业技术创新性与竞争性分析*[J]. 现代图书情报技术, 2008, 24(12): 66-72.
[14] 岑咏华,王雪芬,傅志诚. 在线专利分析软件开发的关键技术及实现*[J]. 现代图书情报技术, 2008, 24(11): 49-55.
[15] 王曰芬,张旭,邬尚君. 在线专利分析软件的总体架构*[J]. 现代图书情报技术, 2008, 24(10): 48-53.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
版权所有 © 2015 《数据分析与知识发现》编辑部
地址:北京市海淀区中关村北四环西路33号 邮编:100190
电话/传真:(010)82626611-6626,82624938
E-mail:jishu@mail.las.ac.cn