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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2096, Issue , 2001, Pages 349-358

  Kuncheva, L I ^a   Roli, F ^b   Marcialis, G L ^b   Shipp, C A ^a  

^a BANGOR UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF CAGLIARI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONSISTENCY MEASURES; DATA SUBSETS; EFICIENCY; EXPERIMENTAL INVESTIGATIONS; MEASURES OF COMPLEXITY; MINIMAL SPANNING TREE; RANDOM SUBSPACE METHOD; REDUNDANT FEATURES;

SET THEORY;

EID: 84925741661     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48219-9_35     Document Type: Conference Paper

References (7)

1. L. Breiman. Combining predictors. In A.J.C. Sharkey, editor, Combining Artificial Neural Nets, pages 31-50. Springer-Verlag, London, 1999.
2. J.H. Friedman and L.C. Rafsky, Multivariate generalisations of the Wald-Wolfowitz and Smirnov two-sample tests Annals of Statistics, 7, 4, 1979, 697-717 In [4]
3. T.K. Ho. The random space method for constructing decision forests. IEEE Trans-actions on Pattern Analysis and Machine Intelligence, 20(8):832-844, 1998.
4. T.K. Ho. Complexity of classification problems and comparative advantages of combined classifiers. In Proc. First International Workshop on Multiple Classifier Systems, pages 97-106, Cagliari, Italy, 2000.
5. C. Ji and S. Ma. Combination of weak classifiers. IEEE Transactions on Neural Networks, 8(1):32-42, 1997.
6. L.I. Kuncheva, C.J. Whitaker, C.A. Shipp, and R.P.W. Duin. Limits on the majority vote accuracy in classifier fusion. (submitted).
7. B. Littlewood and D.R. Miller. Conceptual modeling of coincident failures in mul-tiversion software. IEEE Transactions on Software Engineering, 15(12):1596-1614, 1989.