On some transformations of high dimension, low sample size data for nearest neighbor classification

DOI10.1007/S10994-015-5495-YMaRDI QIDQ255361zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

reproducing kernel Hilbert space\(\rho \)-mixing sequencesBayes riskHDLSS datahigh-dimensional geometryinter-point distanceslaw of large numbersmisclassification probability

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

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?

Cites work

• scientific article; zbMATH DE number 4049124 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 2080487 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• 10.1162/15324430260185592
• 10.1162/15324430260185646
• A distribution-free two-sample run test applicable to high-dimensional data
• A nonparametric two-sample test applicable to high dimensional data
• Choice of neighbor order in nearest-neighbor classification
• Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
• Generative models for similarity-based classification
• Geometric Representation of High Dimension, Low Sample Size Data
• Hubs in space: popular nearest neighbors in high-dimensional data
• Kernel methods in machine learning
• Nearest neighbor pattern classification
• On error-rate estimation in nonparametric classification
• PCA consistency in high dimension, low sample size context
• Pattern classification.
• Random forests
• Robust nearest-neighbor methods for classifying high-dimensional data
• Similarity-based classification: concepts and algorithms
• Similarity-based clustering by left-stochastic matrix factorization

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
• scientific article; zbMATH DE number 7625167 (Why is no real title available?)
• scientific article; zbMATH DE number 3962999 (Why is no real title available?)

Describes a project that uses

Uses Software

• ElemStatLearn
• randomForest

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)