The area under the ROC curve as a measure of clustering quality

被引:19
作者
Jaskowiak, Pablo A. [1 ]
Costa, Ivan G. [2 ]
Campello, Ricardo J. G. B. [3 ]
机构
[1] Fed Univ Santa Catarina UFSC, Joinville, SC, Brazil
[2] Rhein Westfal TH Aachen, Inst Computat Genom, Med Fac, Aachen, Germany
[3] Univ Newcastle, Sch Math & Phys Sci, Callaghan, NSW, Australia
基金
巴西圣保罗研究基金会;
关键词
Clustering validation; Area under the curve; Receiver operating characteristics; AUC/ROC; Area under the curve for clustering; Qualitative/visual clustering evaluation; R-PACKAGE; VALIDATION; INDEXES; NUMBER;
D O I
10.1007/s10618-022-00829-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The area under the receiver operating characteristics (ROC) Curve, referred to as AUC, is a well-known performance measure in the supervised learning domain. Due to its compelling features, it has been employed in a number of studies to evaluate and compare the performance of different classifiers. In this work, we explore AUC as a performance measure in the unsupervised learning domain, more specifically, in the context of cluster analysis. In particular, we elaborate on the use of AUC as an internal/relative measure of clustering quality, which we refer to as Area Under the Curve for Clustering (AUCC). We show that the AUCC of a given candidate clustering solution has an expected value under a null model of random clustering solutions, regardless of the size of the dataset and, more importantly, regardless of the number or the (im)balance of clusters under evaluation. In addition, we elaborate on the fact that, in the context of internal/relative clustering validation as we consider, AUCC is actually a linear transformation of the Gamma criterion from Baker and Hubert (1975), for which we also formally derive a theoretical expected value for chance clusterings. We also discuss the computational complexity of these criteria and show that, while an ordinary implementation of Gamma can be computationally prohibitive and impractical for most real applications of cluster analysis, its equivalence with AUCC actually unveils a much more efficient algorithmic procedure. Our theoretical findings are supported by experimental results. These results show that, in addition to an effective and robust quantitative evaluation provided by AUCC, visual inspection of the ROC curves themselves can be useful to further assess a candidate clustering solution from a broader, qualitative perspective as well.
引用
收藏
页码:1219 / 1245
页数:27
相关论文
共 64 条
  • [11] CLUSTER SEPARATION MEASURE
    DAVIES, DL
    BOULDIN, DW
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1979, 1 (02) : 224 - 227
  • [12] Desgraupes B., 2016, R PACKAGE VERSION, V1, P7
  • [13] Dunn J. C., 1974, Journal of Cybernetics, V4, P95, DOI 10.1080/01969727408546059
  • [14] Everitt B., 1974, Cluster Analysis. Ed
  • [15] Farber Ines, 2010, MultiClust: 1st international workshop on discovering, summarizing and using multiple clusterings held in conjunction with KDD, P1
  • [16] ROC graphs with instance-varying costs
    Fawcett, Tom
    [J]. PATTERN RECOGNITION LETTERS, 2006, 27 (08) : 882 - 891
  • [17] An introduction to ROC analysis
    Fawcett, Tom
    [J]. PATTERN RECOGNITION LETTERS, 2006, 27 (08) : 861 - 874
  • [18] Flach P, 2011, INT C MACHINE LEARNI
  • [19] Flach P.A., 2010, Encyclopedia of Machine Learning, P869, DOI [DOI 10.1007/978-0-387-30164-8733, 10.1007/978-0-387-30164-8733, DOI 10.1007/978-0-387-30164-8_733]
  • [20] A methodology to assess the intrinsic discriminative ability of a distance function and its interplay with clustering algorithms for microarray data analysis
    Giancarlo, Raffaele
    Lo Bosco, Giosue
    Pinello, Luca
    Utro, Filippo
    [J]. BMC BIOINFORMATICS, 2013, 14