Bagging, boosting and the random subspace method for linear classifiers

DOI10.1007/s100440200011zbMath1024.68092OpenAlexW2157124852WikidataQ59444171 ScholiaQ59444171MaRDI QIDQ1849236

Marina Skurichina, Robert P. W. Duin

Publication date: 1 December 2002

Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s100440200011

zbMATH Keywords

linear discriminant analysislinear classifiers

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (14)

Representation in the (artificial) immune system ⋮ Training a reciprocal-sigmoid classifier by feature scaling-space ⋮ Experimental study for the comparison of classifier combination methods ⋮ A linear discriminant analysis framework based on random subspace for face recognition ⋮ Supervised dictionary learning with multiple classifier integration ⋮ Unnamed Item ⋮ An optimal symmetrical null space criterion of Fisher discriminant for feature extraction and recognition ⋮ C443: a methodology to see a forest for the trees ⋮ Classification Problem in a Quantum Framework ⋮ Taxonomy for characterizing ensemble methods in classification tasks: a review and annotated bibliography ⋮ Bagging null space locality preserving discriminant classifiers for face recognition ⋮ Decision trees using model ensemble-based nodes ⋮ Prototype Classification: Insights from Machine Learning ⋮ Improving patient flow in a primary care clinic

This page was built for publication: Bagging, boosting and the random subspace method for linear classifiers