Using \(k\)-nearest-neighbor classification in the leaves of a tree

DOI10.1016/S0167-9473(01)00098-6zbMath0990.62050OpenAlexW2116179833MaRDI QIDQ1606094

Ciril Karo, Samuel E. Buttrey

Publication date: 31 July 2002

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-9473(01)00098-6

zbMATH Keywords

classificationnearest neighborshybrid classifiers

Mathematics Subject Classification ID

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

Related Items (5)

Aggregating classifiers with mathematical programming ⋮ Bundling classifiers by bagging trees ⋮ Taxonomy for characterizing ensemble methods in classification tasks: a review and annotated bibliography ⋮ Improving the precision of classification trees ⋮ A case study of using the generalized K-harmonic means method in decision-making processes

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• An Optimal Global Nearest Neighbor Metric
• A class of feature extraction criteria and its relation to the Bayes risk estimate
• A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms

This page was built for publication: Using \(k\)-nearest-neighbor classification in the leaves of a tree