On Stopping Rules in Dependency-Aware Feature Ranking
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F13%3A00399659" target="_blank" >RIV/67985556:_____/13:00399659 - isvavai.cz</a>
Alternative codes found
RIV/61384399:31160/13:00043528
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-41822-8_36" target="_blank" >http://dx.doi.org/10.1007/978-3-642-41822-8_36</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-41822-8_36" target="_blank" >10.1007/978-3-642-41822-8_36</a>
Alternative languages
Result language
angličtina
Original language name
On Stopping Rules in Dependency-Aware Feature Ranking
Original language description
Feature Selection in very-high-dimensional or small sample problems is particularly prone to computational and robustness complications. It is common to resort to feature ranking approaches only or to randomization techniques. A recent novel approach tothe randomization idea in form of Dependency-Aware Feature Ranking (DAF) has shown great potential in tackling these problems well. Its original definition, however, leaves several technical questions open. In this paper we address one of these questions: how to define stopping rules of the randomized computation that stands at the core of the DAF method. We define stopping rules that are easier to interpret and show that the number of randomly generated probes does not need to be extensive.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
ISBN
978-3-642-41821-1
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
286-293
Publisher name
Springer
Place of publication
Heidelberg
Event location
Havana
Event date
Nov 20, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—