Predictive performances of implicitly and explicitly robust classifiers on high dimensional data

DOI10.1501/COMMUA1_0000000797MaRDI QIDQ4566316zbMATH OpenOpenAlexFDO

Authors Necla Gunduz, Ernest Fokoué

Publication date 14 June 2018

Published in Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1501/commua1_0000000797

zbMATH Keywords

classificationcontaminationdiscriminant analysisensemble learninghigh dimensionallarge \(p\) small \(n\)minimum covariance determinantprediction errorprojection pursuitrandom forestrandom subspace learningrobust

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Recommendations

• Classification by ensembles from random partitions of high-dimensional data
• An efficient random forests algorithm for high dimensional data classification
• Random-projection ensemble classification. (With discussion).
• Robust centroid based classification with minimum error rates for high dimension, low sample size data
• Distance-based classifier by data transformation for high-dimension, strongly spiked eigenvalue models

Cited in

(1)

• Identifying learners robust to low quality data

This page was built for publication: Predictive performances of implicitly and explicitly robust classifiers on high dimensional data

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