Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

PR
2008

favoriteEmaildiscussreport

102views more PR 2008»

Classification in an informative sample subspace

13 years 4 months ago

Classification in an informative sample subspace

Download www.viplab.cs.nott.ac.uk

We have developed an informative sample subspace (ISS) method that is suitable for projecting high-dimensional data onto a low-dimensional subspace for classification purposes. In this paper, we present an ISS algorithm that uses a maximal mutual information criterion to search a labelled training data set directly for the subspace's projection base vectors. We evaluate the usefulness of the ISS method using synthetic data as well as real world problems. Experimental results demonstrate that the ISS algorithm is effective and can be used as a general method for representing high-dimensional data in a low-dimensional subspace for classification. Published by Elsevier Ltd on behalf of Pattern Recognition Society.

Guoping Qiu, Jianzhong Fang

Real-time Traffic

Informative Sample Subspace | ISS Algorithm | Low-dimensional Subspace | PR 2008 |

claim paper

Related Content

» CarNonCar Classification in an Informative Sample Subspace

» Modelshared subspace boosting for multilabel classification

» Random Sampling for Subspace Face Recognition

» Classification Based on Symmetric Maximized Minimal Distance in Subspace SMMS

» Phenotype Recognition with Combined Features and Random Subspace Classifier Ensemble

» Nonlinear dimensionality reduction for classification using kernel weighted subspace metho...

» Imbalanced sentiment classification

» Learning subspace kernels for classification

» A Theory for Sampling Signals From a Union of Subspaces

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	PR
Authors	Guoping Qiu, Jianzhong Fang

Comments (0)