Research Repository

Bagging tree classifiers for laser scanning images: A data- and simulation-based strategy

Hothorn, T and Lausen, B (2003) 'Bagging tree classifiers for laser scanning images: A data- and simulation-based strategy.' Artificial Intelligence in Medicine, 27 (1). 65 - 79. ISSN 0933-3657

Full text not available from this repository.

Abstract

Diagnosis based on medical image data is common in medical decision making and clinical routine. We discuss a strategy to derive a classifier with good performance on clinical image data and to justify the properties of the classifier by an adapted simulation model of image data. We focus on the problem of classifying eyes as normal or glaucomatous based on 62 routine explanatory variables derived from laser scanning images of the optic nerve head. As learning sample we use a case-control study of 98 normal and 98 glaucomatous subjects matched by age and sex. Aggregating multiple unstable classifiers allows substantial reduction of misclassification error in many applications and bench mark problems. We investigate the performance of various classifiers for the clinical learning sample as well as for a simulation model of eye morphologies. Bagged classification trees (bagged-CTREE) are compared to single classification trees and linear discriminant analysis (LDA). We additionally compare three estimators of misclassification error: 10-fold cross-validation, the 0.632+ bootstrap and the out-of-bag estimate. In summary, the application of our strategy of a knowledge-based decision support shows that bagged classification trees perform best for glaucoma classification. © 2002 Elsevier Science B.V. All rights reserved.

Item Type: Article
Subjects: H Social Sciences > HA Statistics
R Medicine > RE Ophthalmology
Divisions: Faculty of Science and Health > Mathematical Sciences, Department of
Depositing User: Berthold Lausen
Date Deposited: 04 Jul 2012 21:48
Last Modified: 17 Aug 2017 18:12
URI: http://repository.essex.ac.uk/id/eprint/2493

Actions (login required)

View Item View Item