paper-with-me

홈 › Papers

Distance-based classifier by data transformation for high-dimension, strongly spiked eigenvalue models

2017-10-30 · Makoto Aoshima, Kazuyoshi Yata

We consider classifiers for high-dimensional data under the strongly spiked eigenvalue (SSE) model. We first show that high-dimensional data often have the SSE model. We consider a distance-based classifier using eigenstructures for the SSE model. We apply the noise reduction methodology to estimation of the eigenvalues and eigenvectors in the SSE model. We create a new distance-based classifier by transforming data from the SSE model to the non-SSE model. We give simulation studies and discuss the performance of the new classifier. Finally, we demonstrate the new classifier by using microarray data sets.

📄 PDF Abstract BibTeX arXiv:1710.10768

Code (1)

keisuke6616/Distance-based-classifier-by-data-transformation-for-high-dimension-strongly-spiked-eigenvalue-mode

Similar Papers 제목 키워드 기반

On a Generalization of the Average Distance Classifier

2020-01-08 · Sarbojit Roy, Soham Sarkar, Subhajit Dutta

In high dimension, low sample size (HDLSS)settings, the simple average distance classifier based on the Euclidean distance performs poorly if differences between the locations get masked by the scale differences. To rect…

High-dimensional Semi-supervised Classification via the Fermat Distance

2026-04-26 · Ruoxu Tan, Yiming Zang arxiv

Semi-supervised classification, where unlabeled data are massive but labeled data are limited, often arises in machine learning applications. We address this challenge under high-dimensional data by leveraging the manifo…

Classification Using Global and Local Mahalanobis Distances

2024-02-13 · Annesha Ghosh, Anil K. Ghosh, Rita SahaRay, Soham Sarkar

We propose a novel semiparametric classifier based on Mahalanobis distances of an observation from the competing classes. Our tool is a generalized additive model with the logistic link function that uses these distances…

Classification

An Unsupervised Algorithm For Learning Lie Group Transformations

2010-01-07 · Jascha Sohl-Dickstein, Ching Ming Wang, Bruno A. Olshausen

We present several theoretical contributions which allow Lie groups to be fit to high dimensional datasets. Transformation operators are represented in their eigen-basis, reducing the computational complexity of paramete…

parameter estimationTranslation

Gradient Boosting Mapping for Dimensionality Reduction and Feature Extraction

2024-05-14 · Anri Patron, Ayush Prasad, Hoang Phuc Hau Luu, Kai Puolamäki

A fundamental problem in supervised learning is to find a good set of features or distance measures. If the new set of features is of lower dimensionality and can be obtained by a simple transformation of the original da…

Dimensionality ReductionregressionSupervised dimensionality reduction