Requirements for a cocitation similarity measure, with special reference to Pearson's correlation coefficient

被引:474
作者
Ahlgren, P [1 ]
Jarneving, B
Rousseau, R
机构
[1] Swedish Sch Lib & Informat Sci, S-50190 Boras, Sweden
[2] KHBO, Dept Ind Sci & Technol, B-8400 Oostende, Belgium
来源
JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY | 2003年 / 54卷 / 06期
关键词
D O I
10.1002/asi.10242
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Author cocitation analysis (ACA), a special type of cocitation analysis, was introduced by White and Griffith in 1981. This technique is used to analyze the intellectual structure of a given scientific field. In 1990, McCain published a technical overview that has been largely adopted as a standard. Here, McCain notes that Pearson's correlation coefficient (Pearson's r) is often used as a similarity measure in ACA and presents some advantages of its use. The present article criticizes the use of Pearson's r in ACA and sets forth two natural requirements that a similarity measure applied in ACA should satisfy. It is shown that Pearson's r does not satisfy these requirements. Real and hypothetical data are used in order to obtain counterexamples to both requirements. It is concluded that Pearson's r is probably not an optimal choice of a similarity measure in ACA. Still, further empirical research is needed to show if, and in that case to what extent, the use of similarity measures in ACA that fulfill these requirements would lead to objectively better results in full-scale studies. Further, problems related to incomplete cocitation matrices are discussed.
引用
收藏
页码:550 / 560
页数:11
相关论文
共 50 条
  • [31] Dependency Test: Portraying Pearson's Correlation Coefficient Targeting Activities in Project Scheduling
    Shafi, Jana
    Waheed, Amtul
    Sanober, Sumaya
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2016, 7 (09) : 351 - 356
  • [32] Real-Time Collision Risk Estimation based on Pearson's Correlation Coefficient
    Neto, A. Miranda
    Victorino, A. Correa
    Fantoni, I.
    Ferreira, J. V.
    2013 IEEE WORKSHOP ON ROBOT VISION (WORV), 2013, : 40 - 45
  • [33] Pearson's Correlation Coefficient for Islanding Detection Using Micro-PMU Measurements
    Kumar, Ganivada Phanindra
    Jena, Premalata
    IEEE SYSTEMS JOURNAL, 2021, 15 (04): : 5078 - 5089
  • [34] Effective use of Pearson's product-moment correlation coefficient: an additional point
    DeGhett, V. J.
    ANIMAL BEHAVIOUR, 2014, 98 : E1 - E2
  • [35] Pearson's Correlation Coefficient for Discarding Redundant Information: Velodyne Lidar Data Analysis
    Bravo Solis, E. D.
    Miranda Neto, A.
    Huallpa, B. Nina
    2015 12TH LATIN AMERICAN ROBOTICS SYMPOSIUM AND 2015 3RD BRAZILIAN SYMPOSIUM ON ROBOTICS (LARS-SBR), 2015, : 116 - 119
  • [36] Synchrony Detection of Epileptic EEG Signals Based on Attention and Pearson's Correlation Coefficient
    Zhou, Tenghui
    Mei, Zhen
    Zhu, Xiumei
    Huang, Zhihua
    2020 13TH INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, BIOMEDICAL ENGINEERING AND INFORMATICS (CISP-BMEI 2020), 2020, : 531 - 535
  • [37] Fisher's transformation to determine confidence intervals for Pearson's product-moment correlation coefficient
    Sánchez-Bruno, A
    del Rosal, AB
    PSICOTHEMA, 2005, 17 (01) : 148 - 153
  • [38] Asymptotic properties of Pearson's rank-variate correlation coefficient in bivariate normal model
    Xu, Weichao
    Ma, Rubao
    Zhou, Yanzhou
    Peng, Shiguo
    Hou, Yunhe
    SIGNAL PROCESSING, 2016, 119 : 190 - 202
  • [39] On an Enhanced Method for a More Meaningful Pearson's Correlation Coefficient between Intuitionistic Fuzzy Sets
    Szmidt, Eulalia
    Kacprzyk, Janusz
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT I, 2012, 7267 : 334 - 341
  • [40] Colocalization Analysis in Fluorescence Micrographs: Verification of a More Accurate Calculation of Pearson's Correlation Coefficient
    Barlow, Andrew L.
    MacLeod, Alasdair
    Noppen, Samuel
    Sanderson, Jeremy
    Guerin, Christopher J.
    MICROSCOPY AND MICROANALYSIS, 2010, 16 (06) : 710 - 724