Data analysis and visualization using basis selection for matrix approximation

Update Item Information
Title Data analysis and visualization using basis selection for matrix approximation
Publication Type dissertation
School or College College of Engineering
Department Computing
Author Perry, Daniel J.
Date 2017
Description This dissertation is about analyzing and visualizing datasets using basis selection techniques for matrix approximation. A large portion of the previous work in basis selection and matrix approximation has been focused entirely on new algorithms to improve specific measures of quality and has been largely motivated by the goals of reducing runtime and minimizing the error introduced. We contribute to that body of knowledge, but we also enlarge the types of motivating problems and interesting applications available to basis selection techniques. Specifically, in addition to contributing to well-studied problems, such as the computational aspects of kernel-based learning and general low-rank matrix approximations, we also introduce two real-world problems where basis selection aids in significant ways: subset-based visualization and proxy-construction for uncertainty quantification of resource-demanding simulations. We hope this dissertation will motivate others to study and extend ideas and techniques that are specifically motivated by these fascinating problems. The full set of concepts discussed here can be categorized into two fundamental ideas: using appropriate basis selection to improve human interpretability of datasets and basis selection to address computational burden. We present these ideas in a collection of five papers. The first paper introduces a novel subset-based visualization motivated by an application to topology optimization design exploration, and emphasizes the ability of a subset matrix to visually summarize a dataset. The second and third papers address computational limitations in kernel-based learning, introducing a novel basis search technique for the Nystrom approximation and a random-projection type approximation, respectively. The fourth paper introduces a novel algorithm and analysis related to general subset-based matrix approximation, touching on both computational and interpretation aspects of basis selection. The fifth paper considers a novel basis selection approach to proxy-function construction for faster uncertainty quantification of compute-intensive simulations.
Type Text
Publisher University of Utah
Subject Computer science
Dissertation Name Doctor of Philosophy
Language eng
Rights Management (c) Daniel J. Perry
Format application/pdf
Format Medium application/pdf
ARK ark:/87278/s6bg7x99
Setname ir_etd
ID 1536060
Reference URL https://collections.lib.utah.edu/ark:/87278/s6bg7x99
Back to Search Results