2020
DOI: 10.1109/tvcg.2019.2934433
|View full text |Cite
|
Sign up to set email alerts
|

An Incremental Dimensionality Reduction Method for Visualizing Streaming Multidimensional Data

Abstract: Dimensionality reduction (DR) methods are commonly used for analyzing and visualizing multidimensional data. However, when data is a live streaming feed, conventional DR methods cannot be directly used because of their computational complexity and inability to preserve the projected data positions at previous time points. In addition, the problem becomes even more challenging when the dynamic data records have a varying number of dimensions as often found in real-world applications. This paper presents an incr… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
38
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
6
4

Relationship

1
9

Authors

Journals

citations
Cited by 64 publications
(39 citation statements)
references
References 67 publications
0
38
0
Order By: Relevance
“…Axis reordering may be more challenging with an increasing number of covariates 47 . Previous researches 48,49 showed dimension reduction as an alternative technique for multidimensional data visualization.…”
Section: Discussionmentioning
confidence: 99%
“…Axis reordering may be more challenging with an increasing number of covariates 47 . Previous researches 48,49 showed dimension reduction as an alternative technique for multidimensional data visualization.…”
Section: Discussionmentioning
confidence: 99%
“…In most cases, the visualization tools cover at least the target group of domain experts/practitioners [EGG*12, FMH16, FCS*20, GNRM08, HNH*12, KPN16]. Then, other target groups such as ML experts [JC17b, KJR*18, SSK10, WLN*17] and developers are in the focus of the authors [KFC16, Mad19, RL15b, YZR*18] (commonly together).…”
Section: In‐depth Categorization Of Trust Against Facets Of Interamentioning
confidence: 99%
“…Similar to the classical PCA, cPCA has the "sign ambiguity" problem [13,23,35]. Because of this problem, arbitrary sign flipping in each (c)PC occurs when performing EVD.…”
Section: Optimal Sign Flipping Of Cpcs and Fcsmentioning
confidence: 99%