✦ 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
DOI: 10.1109/34.990132

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

Sample Complexity for Computational Clas

Sample Complexity for Computational Classification Problems

✍ Daniil Ryabko 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 182 KB

Admissible stochastic complexity models

Admissible stochastic complexity models for classification problems

✍ Padhraic Smyth 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 788 KB

Supervised classification of human micro

Supervised classification of human microbiota

✍ Dan Knights; Elizabeth K. Costello; Rob Knight 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 770 KB

Supervised learning algorithms for multi

Supervised learning algorithms for multi-class classification problems with partial class memberships

✍ Willem Waegeman; Jan Verwaeren; Bram Slabbinck; Bernard De Baets 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 887 KB

Feature selection using localized genera

Feature selection using localized generalization error for supervised classification problems using RBFNN

✍ 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