Fast Branch & Bound Algorithm in Feature Selection.

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61384399%3A31160%2F00%3A00000012" target="_blank" >RIV/61384399:31160/00:00000012 - isvavai.cz</a>

Alternative codes found

RIV/67985556:_____/00:16000168

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Fast Branch & Bound Algorithm in Feature Selection.

Original language description

A novel algorithm for optimal feature selection is presented which is much faster than classical Branch & Bound algorithm due to its simple mechanism for predicting criterion values.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2000

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of SCI 2000 (4th World Multiconference).

ISBN

980-07-6702-9

ISSN

—

e-ISSN

—

Number of pages

7

Pages from-to

—

Publisher name

Cybernetics and Informatics

Place of publication

Orlando

Event location

—

Event date

—

Type of event by nationality

—

UT code for WoS article

—