๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Complexity measures of supervised classification problems

โœ Scribed by Tin Kam Ho; Basu, M.


Book ID
117873786
Publisher
IEEE
Year
2002
Tongue
English
Weight
486 KB
Volume
24
Category
Article
ISSN
0162-8828

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Complexity of classification problems
โœ I. V. Sergienko; A. M. Gupal; S. V. Pashko ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Springer US ๐ŸŒ English โš– 650 KB
Supervised classification of human micro
โœ Dan Knights; Elizabeth K. Costello; Rob Knight ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 770 KB
Feature selection using localized genera
โœ Wing W.Y. Ng; Daniel S. Yeung; Michael Firth; Eric C.C. Tsang; Xi-Zhao Wang ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 668 KB

A pattern classification problem usually involves using high-dimensional features that make the classifier very complex and difficult to train. With no feature reduction, both training accuracy and generalization capability will suffer. This paper proposes a novel hybrid filter-wrapper-type feature