Class-Constrained t-SNE: Combining Data Features and Class Probabilities

被引:3
|
作者
Meng, Linhao [1 ]
van den Elzen, Stef [1 ]
Pezzotti, Nicola [1 ]
Vilanova, Anna [1 ]
机构
[1] Eindhoven Univ Technol, Eindhoven, Netherlands
关键词
Data visualization; Data models; Visualization; Analytical models; Labeling; Cost function; Periodic structures; Dimensionality reduction; t-distributed stochastic neighbor embedding; constraint integration;
D O I
10.1109/TVCG.2023.3326600
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Data features and class probabilities are two main perspectives when, e.g., evaluating model results and identifying problematic items. Class probabilities represent the likelihood that each instance belongs to a particular class, which can be produced by probabilistic classifiers or even human labeling with uncertainty. Since both perspectives are multi-dimensional data, dimensionality reduction (DR) techniques are commonly used to extract informative characteristics from them. However, existing methods either focus solely on the data feature perspective or rely on class probability estimates to guide the DR process. In contrast to previous work where separate views are linked to conduct the analysis, we propose a novel approach, class-constrained t-SNE, that combines data features and class probabilities in the same DR result. Specifically, we combine them by balancing two corresponding components in a cost function to optimize the positions of data points and iconic representation of classes - class landmarks. Furthermore, an interactive user-adjustable parameter balances these two components so that users can focus on the weighted perspectives of interest and also empowers a smooth visual transition between varying perspectives to preserve the mental map. We illustrate its application potential in model evaluation and visual-interactive labeling. A comparative analysis is performed to evaluate the DR results.
引用
收藏
页码:164 / 174
页数:11
相关论文
共 50 条
  • [1] Class-Constrained Extreme Learning Machine
    Liu, Xiao
    Miao, Jun
    Qing, Laiyun
    Cao, Baoxiang
    [J]. PROCEEDINGS OF ELM-2015, VOL 1: THEORY, ALGORITHMS AND APPLICATIONS (I), 2016, 6 : 521 - 530
  • [2] Visualizing Data using t-SNE
    van der Maaten, Laurens
    Hinton, Geoffrey
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2008, 9 : 2579 - 2605
  • [3] Tight bounds for online class-constrained packing
    Shachnai, H
    Tamir, T
    [J]. THEORETICAL COMPUTER SCIENCE, 2004, 321 (01) : 103 - 123
  • [4] Exact algorithms for class-constrained packing problems
    Borges, Yulle G. F.
    Miyazawa, Flavio K.
    Schouery, Rafael C. S.
    Xavier, Eduardo C.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 144 (144)
  • [5] Visualizing data using t-SNE
    TiCC, Ttlburg University, P.O. Box 90153, 5000 LE Tilburg, Netherlands
    不详
    [J]. J. Mach. Learn. Res, 2008, (2579-2625):
  • [6] Tight bounds for online class-constrained packing
    Shachnai, H
    Tamir, T
    [J]. LATIN 2002: THEORETICAL INFORMATICS, 2002, 2286 : 569 - 583
  • [7] Seeing data as t-SNE and UMAP do
    Marx, Vivien
    [J]. NATURE METHODS, 2024, 21 (06) : 930 - 933
  • [8] Application of t-SNE to human genetic data
    Li, Wentian
    Cerise, Jane E.
    Yang, Yaning
    Han, Henry
    [J]. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2017, 15 (04)
  • [9] On two class-constrained versions of the multiple knapsack problem
    Shachnai, H
    Tamir, T
    [J]. ALGORITHMICA, 2001, 29 (03) : 442 - 467
  • [10] On Two Class-Constrained Versions of the Multiple Knapsack Problem
    H. Shachnai
    T. Tamir
    [J]. Algorithmica, 2001, 29 : 442 - 467