New algorithms for efficient high-dimensional nonparametric classification

MaRDI QIDQ3093385zbMATH OpenFDO

Authors Ting Liu, Andrew W. Moore, Alexander Gray

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v7/liu06a.html

zbMATH Keywords

\(k\)-NN classificationball-tree

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Nonparametric inference (62G99)

Recommendations

• scientific article; zbMATH DE number 1559575
• scientific article; zbMATH DE number 1947041
• Parallel algorithms for nearest neighbor search problems in high dimensions
• Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality?
• Improved \(k\)-nearest neighbor classification

Cited in

(7)

• Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data
• A training algorithm for classification of high-dimensional data
• Concurrent linearizable nearest neighbour search in LockFree-kD-tree
• KNN and adaptive comfort applied in decision making for HVAC systems
• Utility-Maximizing Binary Prediction via the Nearest Neighbor Method and Its Application to Credit Scoring
• Computable bounds for the reach and \(r\)-convexity of subsets of \({{\mathbb{R}}}^d\)
• Fast exact \(k\) nearest neighbors search using an orthogonal search tree

This page was built for publication: New algorithms for efficient high-dimensional nonparametric classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093385)