A review of cluster analysis techniques and their uses in library and information science research: k-means and k-medoids clustering

被引:27
|
作者
Lund, Brady [1 ]
Ma, Jinxuan [1 ]
机构
[1] Emporia State Univ, Emporia, KS 66801 USA
关键词
Clustering; Library and information science; Research methods; Cluster analysis; Data analysis; K-means;
D O I
10.1108/PMM-05-2021-0026
中图分类号
G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];
学科分类号
1205 ; 120501 ;
摘要
Purpose - This literature review explores the definitions and characteristics of cluster analysis, a machine-learning technique that is frequently implemented to identify groupings in big datasets and its applicability to library and information science (LIS) research. This overview is intended for researchers who are interested in expanding their data analysis repertory to include cluster analysis, rather than for existing experts in this area. Design/methodology/approach - A review of LIS articles included in the Library and Information Source (EBSCO) database that employ cluster analysis is performed. An overview of cluster analysis in general (how it works from a statistical standpoint, and how it can be performed by researchers), the most popular cluster analysis techniques and the uses of cluster analysis in LIS is presented. Findings - The number of LIS studies that employ a cluster analytic approach has grown from about 5 per year in the early 2000s to an average of 35 studies per year in the mid- and late-2010s. The journal Scientometrics has the most articles published within LIS that use cluster analysis (102 studies). Scientometrics is the most common subject area to employ a cluster analytic approach (152 studies). The findings of this review indicate that cluster analysis could make LIS research more accessible by providing an innovative and insightful process of knowledge discovery. Originality/value - This review is the first to present cluster analysis as an accessible data analysis approach, specifically from an LIS perspective.
引用
收藏
页码:161 / 173
页数:13
相关论文
共 50 条
  • [41] Search Result Clustering Through Density Analysis Based K-Medoids Method
    Hung, Hungming
    Watada, Junzo
    2014 IIAI 3RD INTERNATIONAL CONFERENCE ON ADVANCED APPLIED INFORMATICS (IIAI-AAI 2014), 2014, : 155 - 160
  • [42] GMSK demodulation using K-means clustering techniques
    Savazzi, P
    Favalli, L
    ICUPC '98 - IEEE 1998 INTERNATIONAL CONFERENCE ON UNIVERSAL PERSONAL COMMUNICATIONS, VOLS 1 AND 2, 1998, 1-2 : 1011 - 1014
  • [43] Finding the k in K-means Clustering: A Comparative Analysis Approach
    Lumpe, Markus
    Quoc Bao Vo
    AI 2015: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2015, 9457 : 356 - 364
  • [44] K-Means Clustering for Information Dissemination of Fishing Surveillance
    Correia, Anacleto
    Moura, Ricardo
    Agua, Pedro
    Lobo, Victor
    INFORMATION TECHNOLOGY AND SYSTEMS, ICITS 2020, 2020, 1137 : 84 - 93
  • [45] Application of ant K-means on clustering analysis
    Kuo, RJ
    Wang, HS
    Hu, TL
    Chou, SH
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2005, 50 (10-12) : 1709 - 1724
  • [46] Crime Analysis using k-means Clustering
    Joshi, Anant
    Sabitha, A. Sai
    Choudhury, Tanupriya
    2017 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND NETWORKS (CINE), 2017, : 33 - 39
  • [47] Outlier Detection using Clustering Techniques - K-means and K-median
    Angelin, B.
    Geetha, A.
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICICCS 2020), 2020, : 373 - 378
  • [48] A Cooperative Spectrum Sensing Algorithm Based on Principal Component Analysis and K-medoids Clustering
    Sun, Chenhao
    Wang, Yonghua
    Wan, Pin
    Du, Yiqi
    PROCEEDINGS 2018 33RD YOUTH ACADEMIC ANNUAL CONFERENCE OF CHINESE ASSOCIATION OF AUTOMATION (YAC), 2018, : 835 - 839
  • [49] MULTI-SOURCE INFORMATION DATA INTEGRATION METHOD FOUNDED ON K-MEDOIDS CLUSTERING ALGORITHM
    Li, Liantian
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2023, 19 (06): : 1877 - 1890
  • [50] Research on Segmenting E-Commerce Customer through an Improved K-Medoids Clustering Algorithm
    Wu, Zengyuan
    Jin, Lingmin
    Zhao, Jiali
    Jing, Lizheng
    Chen, Liang
    COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2022, 2022