2016
DOI: 10.1016/j.ijar.2016.03.008
|View full text |Cite
|
Sign up to set email alerts
|

Deep kernel dimensionality reduction for scalable data integration

Abstract: International audienceDimensionality reduction is used to preserve significant properties of data in a low-dimensional space. In particular , data representation in a lower dimension is needed in applications , where information comes from multiple high dimensional sources. Data integration , however , is a challenge in itself. In this contribution , we consider a general framework to perform dimen-sionality reduction taking into account that data are heterogeneous. We propose a novel approach , called Deep Ke… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…As well, the volume challenge can be reduced using dimensionality reduction. Methods such as principal component analysis (PCA), Multimodal deep learning, Isomap have proven their effectiveness in dimensionality reduction [126].…”
Section: Figure 12mentioning
confidence: 99%
“…As well, the volume challenge can be reduced using dimensionality reduction. Methods such as principal component analysis (PCA), Multimodal deep learning, Isomap have proven their effectiveness in dimensionality reduction [126].…”
Section: Figure 12mentioning
confidence: 99%
“…They propose flexible structures to efficiently store, retrieve and process data. A deep kernel dimensionality reduction technique was proposed in [21]. This technique has a scalability advantage, hence has the ability to adapt depending on the data size.…”
Section: Related Workmentioning
confidence: 99%