Page 1 |
Save page Remove page | Previous | 1 of 115 | Next |
|
small (250x250 max)
medium (500x500 max)
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
Subset |
DIMENSIONALITY REDUCTION FOR CLASSIFICATION WITH
HIGH-DIMENSIONAL DATA
by
T. Siva Tian
A Dissertation Presented to the
FACULTY OF THE GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(PSYCHOLOGY)
August 2009
Copyright 2009 T. Siva Tian
Object Description
| Title | Dimensionality reduction for classification with high-dimensional data |
| Author | Tian, Tian Siva |
| Author email | ttian@usc.edu; siva.tian827@gmail.com |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Psychology |
| School | College of Letters, Arts and Sciences |
| Date defended/completed | 2009-06-15 |
| Date submitted | 2009 |
| Restricted until | Unrestricted |
| Date published | 2009-07-30 |
| Advisor (committee chair) |
Wilcox, Rand R. James, Gareth M. |
| Advisor (committee member) |
John, Richard Lu, Zhong-Lin Lv, Jinchi |
| Abstract | This thesis addresses dimensionality reduction problems in classification for both high-dimensional multivariate and functional data.; High-dimensional data refers to data with a large number of variables, often larger than the number of observations. High-dimensional data are encountered in a wide range of areas such as engineering, biometrics, psychometrics, and neuroimaging. 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.; In order to deal with multivariate data, two approaches are proposed. One is a simulated annealing (SA) based method and the other is a multivariate adaptive stochastic search (MASS) method. They both utilize stochastic search algorithms to select a handful of optimal transformation directions from a large number of random directions in each iteration. One advantage of the proposed methods is that they can accurately project the data onto very low-dimensional non-linear, as well as linear, spaces. 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. Particularly, MASS can adaptively adjust the model complexity level, and hence performs well in situations where variable selection or variable combination methods fail. We demonstrate the strengths of SA and MASS on an extensive range of simulation and real studies by comparing them to many classical and modern classification methods.; Classification problems associated with functional data are also addressed. We propose a functional adaptive classification (FAC) approach which takes the functional response into consideration and produces highly accurate and interpretable results. FAC is also based on a stochastic search procedure guided by the evaluation of model complexity. This often results in a simple relationship between functional covariates and the reduced data and makes the model interpretable. Simulation studies and an fMRI time course study are also provided to show the effectiveness of the proposed method. |
| Keyword | dimensionality reduction; classification; variable selection; variable combination; stochastic search |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m2426 |
| Rights | Tian, Tian Siva |
| Repository name | Libraries, University of Southern California |
| Repository address | Los Angeles, California |
| Repository email | http://www.usc.edu/isd/libraries/services/ask_a_librarian/email/ |
| Filename | etd-Tian-3069 |
| Archival file | uscthesesreloadpub_Volume56/etd-Tian-3069.pdf |
Description
| Title | Page 1 |
| Full text | DIMENSIONALITY REDUCTION FOR CLASSIFICATION WITH HIGH-DIMENSIONAL DATA by T. Siva Tian A Dissertation Presented to the FACULTY OF THE GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (PSYCHOLOGY) August 2009 Copyright 2009 T. Siva Tian |
Comments
Post a Comment for Page 1
