3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
These leaderboards are used to track progress in supervised-dimensionality-reduction-11
No benchmarks available.
Use these libraries to find supervised-dimensionality-reduction-11 models and implementations
No datasets available.
No subtasks available.
A method to estimate causal effects from observational text data, adjusting for confounding features of the text such as the subject or writing quality, and studies causally sufficient embeddings with semi-synthetic datasets and finds that they improve causal estimation over related embedding methods.
A new DR framework that can directly model the target distribution using the notion of similarity instead of distance is introduced and it is demonstrated that it can outperform many existing DR techniques.
This work introduces an approach to extending principal components analysis by incorporating class-conditional moment estimates into the low-dimensional projection, and proves that Linear Optimal Low-Rank Projection and its generalizations lead to improved data representations for subsequent classification, while maintaining computational efficiency and scalability.
Experimental results demonstrate that the proposed SRP strategy for class-aware embedding learning can be very promising in producing embeddings that are highly competitive with existing supervised dimensionality reduction methods while achieving 1-2 orders of magnitude better computational performance.
This work proposes a novel linear dimensionality reduction approach, supervised discriminative sparse PCA with adaptive neighbors (SDSPCAAN), to integrate neighborhood-free supervised discrim inative sparsePCA and projected clustering with adaptive neighbor and validated the effectiveness and robustness of this approach.
This work explores the application of linear discriminant analysis (LDA) to the features obtained in different layers of pretrained deep convolutional neural networks (CNNs) to find that the centroids of classes corresponding to the similar data lay closer thanclasses corresponding to different data.
This work presents a dimensionality reduction network (MMINet) training procedure based on the stochastic estimate of the mutual information gradient and introduces emerging information theoretic feature transformation protocols as an end-to-end neural network training approach.
This work explored the ability of features to discriminate the classes of interest under supervised learning and unsupervised learning settings, and introduced 52 computationally efficient features to classify plant species.
This paper describes an e-cient, highly parallel GPU implementation of EmbedSOM designed to provide interactive results on large datasets, and presents BlosSOM, a high-performance semi-supervised dimensionality reduction so-called for interactive user-steerable visualization of high-dimensional datasets with millions of individual data points.
This work proposes a new supervised manifold visualisation method, slisemap, that simultaneously finds local explanations for all data items and builds a (typically) two-dimensional global visualisation of the black box model such that data items with similar local explanations are projected nearby.
Adding a benchmark result helps the community track progress.