Parametric UMAP embeddings for representation and semisupervised learning
UMAP is a nonparametric graph-based dimensionality reduction algorithm using applied
Riemannian geometry and algebraic topology to find low-dimensional embeddings of …
Riemannian geometry and algebraic topology to find low-dimensional embeddings of …
Knowledge graph summarization impacts on movie recommendations
A classical problem that frequently compromises Recommender System (RS) accuracy is
the sparsity of the data about the interactions of the users with the items to be recommended …
the sparsity of the data about the interactions of the users with the items to be recommended …
Kernel-based framework for spectral dimensionality reduction and clustering formulation: A theoretical study
This work outlines a unified formulation to represent spectral approaches for both
dimensionality reduction and clustering. Proposed formulation starts with a generic latent …
dimensionality reduction and clustering. Proposed formulation starts with a generic latent …
Kernel-based dimensionality reduction using Renyi's α-entropy measures of similarity
Dimensionality reduction (DR) aims to reveal salient properties of high-dimensional (HD)
data in a low-dimensional (LD) representation space. Two elements stipulate success of a …
data in a low-dimensional (LD) representation space. Two elements stipulate success of a …
Generalized kernel framework for unsupervised spectral methods of dimensionality reduction
This work introduces a generalized kernel perspective for spectral dimensionality reduction
approaches. Firstly, an elegant matrix view of kernel principal component analysis (PCA) is …
approaches. Firstly, an elegant matrix view of kernel principal component analysis (PCA) is …
Interactive visualization methodology of high-dimensional data with a color-based model for dimensionality reduction
Nowadays, a consequence of data overload is that world's technology capacity to collect,
communicate, and store large volumes of data is increasing faster than human analysis …
communicate, and store large volumes of data is increasing faster than human analysis …
Joint Exploration of Kernel Functions Potential for Data Representation and Classification: A First Step Toward Interactive Interpretable Dimensionality Reduction
Dimensionality reduction (DR) approaches are often a crucial step in data analysis tasks,
particularly for data visualization purposes. DR-based techniques are essentially designed …
particularly for data visualization purposes. DR-based techniques are essentially designed …
Similarity preservation in dimensionality reduction using a kernel-based cost function
Dimensionality reduction aims to preserve, as much as possible, the significant structure of
high-dimensional data in the low-dimensional space. This allows removing noise and …
high-dimensional data in the low-dimensional space. This allows removing noise and …
Interactive data visualization using dimensionality reduction and dissimilarity-based representations
This work describes a new model for interactive data visualization followed from a
dimensionality-reduction (DR)-based approach. Particularly, the mixture of the resulting …
dimensionality-reduction (DR)-based approach. Particularly, the mixture of the resulting …
A novel color-based data visualization approach using a circular interaction model and dimensionality reduction
Dimensionality reduction (DR) methods are able to produce low-dimensional
representations of an input data sets which may become intelligible for human perception …
representations of an input data sets which may become intelligible for human perception …