Data complexity analysis for classifier combination

DOI10.1007/3-540-48219-9_6MaRDI QIDQ2777431zbMATH OpenFDO

Authors T. K. Ho

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/20960053

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1860779
• scientific article; zbMATH DE number 2044158
• Data dependency in multiple classifier systems
• scientific article; zbMATH DE number 2044167
• An experimental evaluation of some classification methods

Cited in

(10)

• Data dependency in multiple classifier systems
• Data complexity meta-features for regression problems
• Synergetic methods of data complexation
• Cherry-picking for complex data: robust structure discovery
• scientific article; zbMATH DE number 2044158 (Why is no real title available?)
• scientific article; zbMATH DE number 2090238 (Why is no real title available?)
• Decision region connectivity analysis: A method for analyzing high-dimensional classifiers
• Trainable fusion rules. I. Large sample size case
• Domains of competence of the semi-naive Bayesian network classifiers
• Taxonomy for characterizing ensemble methods in classification tasks: a review and annotated bibliography

This page was built for publication: Data complexity analysis for classifier combination

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