✦ LIBER ✦

The minimum feature subset selection problem

✍ Scribed by Bin Chen; Jiarong Hong; Yadong Wang

Publisher: Springer
Year: 1997
Tongue: English
Weight: 499 KB
Volume: 12
Category: Article
ISSN: 1000-9000
DOI: 10.1007/bf02951333

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minimum feature set problem

✍ Kevin S. Van Horn; Tony R. Martinez 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 334 KB

One approach to improving the generalization power of a neural net is to try to minimize the number of nonzero weights used. We examine two issues relevant to this approach, .for single-layer nets. First we bound the VC dimension of the set of linear-threshold fimctions that have nonzero weights fig

Feature Subset Selection by Bayesian net

Feature Subset Selection by Bayesian network-based optimization

✍ I. Inza; P. Larrañaga; R. Etxeberria; B. Sierra 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 307 KB

A genetic algorithm-based method for fea

A genetic algorithm-based method for feature subset selection

✍ Feng Tan; Xuezheng Fu; Yanqing Zhang; Anu G. Bourgeois 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 208 KB

Speeding up the Self-Organizing Feature

Speeding up the Self-Organizing Feature Map Using Dynamic Subset Selection

✍ Leigh Wetmore; Malcolm I. Heywood; A. Nur Zincir-Heywood 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 110 KB

An improvement on floating search algori

An improvement on floating search algorithms for feature subset selection

✍ Songyot Nakariyakul; David P. Casasent 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 346 KB

A random-size subset approach to the sel

A random-size subset approach to the selection problem

✍ W. Liu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 497 KB