Some measures for comparing citation databases

被引:87
作者
Bar-Ilan, Judit [1 ]
Levene, Mark [2 ]
Lin, Ayelet [1 ]
机构
[1] Bar Ilan Univ, Dept Informat Sci, IL-52900 Ramat Gan, Israel
[2] Birkbeck Univ London, Sch Comp Sci & Informat Syst, London WC1E 7HX, England
关键词
similarity measures; rankings; citation databases;
D O I
10.1016/j.joi.2006.08.001
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Citation analysis was traditionally based on data from the ISI Citation indexes. Now with the appearance of Scopus, and with the free citation tool Google Scholar methods and measures are need for comparing these tools. In this paper we propose a set of measures for computing the similarity between rankings induced by ordering the retrieved publications in decreasing order of the number of citations as reported by the specific tools. The applicability of these measures is demonstrated and the results show high similarities between the rankings of the ISI Web of Science and Scopus and lower similarities between Google Scholar and the other tools. (c) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码:26 / 34
页数:9
相关论文
共 15 条
[1]   Methods for comparing rankings of search engine results [J].
Bar-Ilan, Judit ;
Mat-Hassan, Mazlita ;
Levene, Mark .
COMPUTER NETWORKS, 2006, 50 (10) :1448-1463
[2]  
BARILAN J, 2006, ISSI NEWSLETTER, V2, P3
[3]  
BARILAN J, 2006, J DOCUMENTATION, V62
[4]  
BARILAN J, USER RANKINGS UNPUB
[5]  
BAUER K, 2005, D LIB MAGAZINED, V11
[6]  
Deis L., 2005, CHARLESTON ADVISOR, V6, P5
[7]   SPEARMANS FOOTRULE AS A MEASURE OF DISARRAY [J].
DIACONIS, P ;
GRAHAM, RL .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (02) :262-268
[8]  
Dwork C., 2001, P 10 INT C WORLD WID, P613, DOI DOI 10.1145/371920.372165
[9]   Comparing top k lists [J].
Fagin, R ;
Kumar, R ;
Sivakumar, D .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 17 (01) :134-160
[10]   Scholarly publishing in the Internet age: a citation analysis of computer science literature [J].
Goodrum, AA ;
McCain, KW ;
Lawrence, S ;
Giles, CL .
INFORMATION PROCESSING & MANAGEMENT, 2001, 37 (05) :661-675