Del i serien Lecture Notes in Computer Science

Subspace, Latent Structure and Feature Selection

Statistical and Optimization Perspectives Workshop, SLSFS 2005 Bohinj, Slovenia, February 23-25, 2005, Revised Selected Papers

Häftad, Engelska, 2006

AvCraig Saunders,Marko Grobelnik,Steve Gunn,John Shawe-Taylor

719 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the thoroughly refereed post-proceedings of the PASCAL (pattern analysis, statistical modelling and computational learning) Statistical and Optimization Perspectives Workshop on Subspace, Latent Structure and Feature Selection techniques, SLSFS 2005. The 9 revised full papers presented together with 5 invited papers reflect the key approaches that have been developed for subspace identification and feature selection using dimension reduction techniques, subspace methods, random projection methods, among others.

Produktinformation

Utgivningsdatum2006-05-16
Mått155 x 235 x 13 mm
Vikt347 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor209
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540341376

Tillhör följande kategorier

Affärsapplikationer inom Data och IT

Invited Contributions.- Discrete Component Analysis.- Overview and Recent Advances in Partial Least Squares.- Random Projection, Margins, Kernels, and Feature-Selection.- Some Aspects of Latent Structure Analysis.- Feature Selection for Dimensionality Reduction.- Contributed Papers.- Auxiliary Variational Information Maximization for Dimensionality Reduction.- Constructing Visual Models with a Latent Space Approach.- Is Feature Selection Still Necessary?.- Class-Specific Subspace Discriminant Analysis for High-Dimensional Data.- Incorporating Constraints and Prior Knowledge into Factorization Algorithms – An Application to 3D Recovery.- A Simple Feature Extraction for High Dimensional Image Representations.- Identifying Feature Relevance Using a Random Forest.- Generalization Bounds for Subspace Selection and Hyperbolic PCA.- Less Biased Measurement of Feature Selection Benefits.