Back to search

University of Washington

Dimensionality Reduction for Supervised and Unsupervised Learning: New Algorithms, Analysis and Application

Abstract

dc:description.abstract

Dimensionality reduction is an essential topic in data science, particularly when data are high-dimensional or have more features than samples. The process of reducing the data dimension usually involves solving an eigenvalue problem. For example, the ubiquitously used principal component analysis obtains the principal subspace by solving a standard eigenvalue problem, and linear discriminant analysis obtains a discriminative subspace by solving a generalized eigenvalue problem. A vast array of real-world data problems can be framed mathematically as variants of eigenvalue problems, including eigenvalue problems with sparsity constraints and penalties, and nonlinear eigenvalue problems. In this thesis, I present new formulations of penalized and constrained eigenvalue problems for dimensionality reduction, propose new provably convergent algorithms to solve these formulations, and present real-world applications spanning many fields, including examples from both supervised and unsupervised learning.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Liu, Hexuan
Advisors dc:contributor.advisor
  • Aravkin, Aleksandr
  • Greenbaum, Anne

Subjects

dc:subject × 9

Rights

dc:rights
Statement dc:rights
  • none
Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1773/48810

Chain of custody

source
Harvested from
University of Washington
Base URL
digital.lib.washington.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Liu, Hexuan. Dimensionality Reduction for Supervised and Unsupervised Learning: New Algorithms, Analysis and Application. 2022. http://hdl.handle.net/1773/48810