About: Fast Dependency-Aware Feature Selection in Very-High-Dimensional Pattern Recognition

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Fast Dependency-Aware Feature Selection in Very-High-Dimensional Pattern Recognition Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	The paper addresses the problem of making dependency-aware feature selection feasible in pattern recognition problems of very high dimensionality. The idea of individually best ranking is generalized to evaluate the contextual quality of each feature in a series of randomly generated feature subsets. Each random subset is evaluated by a criterion function of arbitrary choice (permitting functions of high complexity). Eventually, the novel dependency-aware feature rank is computed, expressing the average benefit of including a feature into feature subsets. The method is efficient and generalizes well especially in very-high-dimensional problems, where traditional context-aware feature selection methods fail due to prohibitive computational complexity or to over-fitting. The method is shown well capable of over-performing the commonly applied individual ranking which ignores important contextual information contained in data. The paper addresses the problem of making dependency-aware feature selection feasible in pattern recognition problems of very high dimensionality. The idea of individually best ranking is generalized to evaluate the contextual quality of each feature in a series of randomly generated feature subsets. Each random subset is evaluated by a criterion function of arbitrary choice (permitting functions of high complexity). Eventually, the novel dependency-aware feature rank is computed, expressing the average benefit of including a feature into feature subsets. The method is efficient and generalizes well especially in very-high-dimensional problems, where traditional context-aware feature selection methods fail due to prohibitive computational complexity or to over-fitting. The method is shown well capable of over-performing the commonly applied individual ranking which ignores important contextual information contained in data. (en)
Title	Fast Dependency-Aware Feature Selection in Very-High-Dimensional Pattern Recognition Fast Dependency-Aware Feature Selection in Very-High-Dimensional Pattern Recognition (en)
skos:prefLabel	Fast Dependency-Aware Feature Selection in Very-High-Dimensional Pattern Recognition Fast Dependency-Aware Feature Selection in Very-High-Dimensional Pattern Recognition (en)
skos:notation	RIV/67985556:_____/11:00365937!RIV12-AV0-67985556
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1M0572), Z(AV0Z10750506)
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Grim, Jiří Somol, Petr
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Ústav teorie informace a automatizace AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	199355
http://linked.open...ai/riv/idVysledku	RIV/67985556:_____/11:00365937
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	feature selection; high dimensionality; ranking; classification; machine learning (en)
http://linked.open.../riv/klicoveSlovo	high dimensionality classification ranking feature selection machine learning
http://linked.open...ontrolniKodProRIV	[E8935AB0B921]
http://linked.open...v/mistoKonaniAkce	Anchorage, Alaska
http://linked.open...i/riv/mistoVydani	Piscataway
http://linked.open...i/riv/nazevZdroje	Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (IEEE SMC 2011)
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Data, algorithms, decision making
http://linked.open...UplatneniVysledku	2011
http://linked.open...iv/tvurceVysledku	Grim, Jiří Pudil, P. Somol, Petr
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2011-10-09 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Pokročilé matematické metody získávání, zpracování a využití informací a znalostí ve složitých a nedeterministických systémech
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-4577-0653-0

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software