On some transformations of high dimension, low sample size data for nearest neighbor classification
DOI10.1007/S10994-015-5495-YzbMATH Open1352.62100OpenAlexW1965999538MaRDI QIDQ255361FDOQ255361
Authors: Subhajit Dutta, Anil K. Ghosh 
Publication date: 9 March 2016
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-015-5495-y
Recommendations
- Robust nearest-neighbor methods for classifying high-dimensional data
- Pattern recognition via projection-based \(k\)NN rules
- When is `nearest neighbour' meaningful: A converse theorem and implications
- Distance-based classifier by data transformation for high-dimension, strongly spiked eigenvalue models
- Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality?
reproducing kernel Hilbert space\(\rho \)-mixing sequencesBayes riskHDLSS datahigh-dimensional geometryinter-point distanceslaw of large numbersmisclassification probability
Nonparametric estimation (62G05) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Cites Work
- Random forests
- Title not available (Why is that?)
- Nearest neighbor pattern classification
- Title not available (Why is that?)
- Pattern classification.
- Kernel methods in machine learning
- A nonparametric two-sample test applicable to high dimensional data
- PCA consistency in high dimension, low sample size context
- Title not available (Why is that?)
- Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
- Robust nearest-neighbor methods for classifying high-dimensional data
- Generative models for similarity-based classification
- Similarity-based classification: concepts and algorithms
- Hubs in space: popular nearest neighbors in high-dimensional data
- Similarity-based clustering by left-stochastic matrix factorization
- A distribution-free two-sample run test applicable to high-dimensional data
- 10.1162/15324430260185592
- 10.1162/15324430260185646
- On error-rate estimation in nonparametric classification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric Representation of High Dimension, Low Sample Size Data
- Choice of neighbor order in nearest-neighbor classification
Cited In (9)
- Graphical Comparison of High‐Dimensional Distributions
- Pattern recognition via projection-based \(k\)NN rules
- Interpoint distances: applications, properties, and visualization
- Robust nearest-neighbor methods for classifying high-dimensional data
- Interpoint Distance Classification of High Dimensional Discrete Observations
- Random forest kernel for high-dimension low sample size classification
- Scale adjustments for classifiers in high-dimensional, low sample size settings
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: On some transformations of high dimension, low sample size data for nearest neighbor classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255361)
