Complexity of data subsets generated by the random subspace method: an experimental investigation

DOI10.1007/3-540-48219-9_35MaRDI QIDQ2777461zbMATH OpenFDO

Authors Fabio Roli, Gian Luca Marcialis, C. A. Shipp, Ludmila I. Kuncheva

Publication date 7 March 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2096/20960349

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Random subspace learning (RASSEL) with data driven weighting schemes
• Bagging and the random subspace method for redundant feature spaces
• Analysis of separating surfaces formed by a random subspace classifier
• Boosting random subspace method
• Data complexity measured by principal graphs

This page was built for publication: Complexity of data subsets generated by the random subspace method: an experimental investigation

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