Ensemble of a subset of \(k\)NN classifiers

DOI10.1007/s11634-015-0227-5zbMath1416.62338OpenAlexW2300264992WikidataQ59470671 ScholiaQ59470671MaRDI QIDQ1630834

Asma Gul, Werner Adler, Zardad Khan, Aris Perperoglou, Berthold Lausen, Miftahuddin Miftahuddin, Osama Mahmoud

Publication date: 5 December 2018

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11634-015-0227-5

zbMATH Keywords

baggingensemble methodsnearest neighbour classifiernon-informative features

Mathematics Subject Classification ID

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

Related Items

Ensemble of penalized logistic models for classification of high-dimensional data, Nonparametric regression and classification with functional, categorical, and mixed covariates, SUBiNN: a stacked uni- and bivariate \(k\)NN sparse ensemble, Is-ClusterMPP: clustering algorithm through point processes and influence space towards high-dimensional data, Ensemble of optimal trees, random forest and random projection ensemble classification

Uses Software

• R
• UCI-ml
• Kernlab
• e1071
• ipred
• mlbench
• ESKNN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bagging predictors
• Optimal weighted nearest neighbour classifiers
• Bundling classifiers by bagging trees
• Double-bagging: Combining classifiers by bootstrap aggregation
• Identifying predictive hubs to condense the training set of \(k\)-nearest neighbour classifiers
• Feature selection for fault level diagnosis of planetary gearboxes
• Probability estimation with machine learning methods for dichotomous and multicategory outcome: Applications
• Properties of Bagged Nearest Neighbour Classifiers
• Random-projection Ensemble Classification
• Nearest neighbor pattern classification