arrow
Return

Interpretable Embedding and Visualization of Compressed Data

delete2023-02-20
delete2
PRE
AI
N
Nikolaos M. Freris *
A
Ahmad Ajalloeian
M
Michail Vlachos
DOI:10.1145/3537901delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Traditional embedding methodologies, also known as dimensionality reduction techniques, assume the availability of exact pairwise distances between the high-dimensional objects that will be embedded in a lower dimensionality. In this article, we propose an embedding that overcomes this limitation and can operate on pairwise distances that are represented as a range of lower and upper bounds. Such bounds are typically estimated when objects are compressed in a lossy manner, so our approach is highly applicable in the case of big compressed datasets. Our methodology can preserve multiple aspects of the original data relationships: distances, correlations, and object scores/ranks, whereas existing techniques typically preserve only distances. Comparative experiments with prevalent embedding methodologies (ISOMAP, t-SNE, MDS, UMAP) illustrate that our approach can provide fidelitous preservation of multiple object relationships, even in the presence of inexact distance information. Our visualization method is also easily interpretable.
Keywords:
Dimensionality reduction
data embedding
compressed data

Journal

ACM Transactions on Knowledge Discovery from Data cover
ACM Transactions on Knowledge Discovery from Data
IF:
4.8
Papers:
1.3K
Citations:
4.4K

Organization

U
university of science & technology of china, cas
Scholars:
3.2W
Papers: 2.7W
Citations: 74
C
chinese academy of sciences
Scholars:
56.5W
Papers: 44.9W
Citations: 704