Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Dimensionality Reduction for Classification with High-Dimensional Data

Dimensionality Reduction for Classification with High-Dimensional Data

Tian, Siva

Paperback

Probability & Statistics

ISBN10: 3639288688
ISBN13: 9783639288681
Publisher: Blues Kids Of Amer
Published: Aug 25 2010
Pages: 124
Weight: 0.42
Height: 0.29 Width: 6.00 Depth: 9.00
Language: English
High-dimensional data refers to data with a large number of variables. Classifying these data is a difficult problem because the enormous number of variables poses challenges to conventional classification methods and renders many classical techniques impractical. A natural solution is to add a dimensionality reduction step before a classification technique is applied. We Propose three methods to deal with this problem: a simulated annealing (SA) based method, a multivariate adaptive stochastic search (MASS) method, and a functional adaptive classification (FAC) method. The third method considers functional predictors. They all utilize stochastic search algorithms to select a handful of optimal transformation directions from a large number of random directions in each iteration. These methods are designed to mimic variable selection type methods, such as the Lasso, or variable combination methods, such as PCA, or a method that combines the two approaches. We demonstrate the strengths of our methods on an extensive range of simulation and real-world studies.

Also in

Probability & Statistics

View All