dissertationThis 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 introdu...
In many areas of machine learning, it becomes necessary to find the eigenvector decompositions of la...
A CUR approximation of a matrix A is a particular type of low-rank approximation where C and R consi...
Positive semidefinite matrices arise in a variety of fields, including statistics, signal processing...
Generating low-rank approximations of kernel matrices that arise in nonlinear machine learning techn...
Huge data sets containing millions of training examples with a large number of attributes (tall fat ...
Kernel methods are a broad class of algorithms that are applied in a host of scientific computing fi...
We study three fundamental problems of Linear Algebra, lying in the heart of various Machine Learnin...
The Nyström method is an efficient technique for large-scale kernel learning. It provides a low-rank...
Modern learning problems in nature language processing, computer vision, computational biology, etc....
Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequen...
We investigate, theoretically and empirically, the effectiveness of kernel K-means++ samples as land...
Low rank matrix factorization is an important step in many high dimensional machine learning algorit...
ABSTRACT. We reconsider randomized algorithms for the low-rank approximation of symmetric positive s...
The purpose of this text is to provide an accessible introduction to a set of recently developed alg...
Kernel methods are widely used to address a variety of learning tasks including classification, regr...
In many areas of machine learning, it becomes necessary to find the eigenvector decompositions of la...
A CUR approximation of a matrix A is a particular type of low-rank approximation where C and R consi...
Positive semidefinite matrices arise in a variety of fields, including statistics, signal processing...
Generating low-rank approximations of kernel matrices that arise in nonlinear machine learning techn...
Huge data sets containing millions of training examples with a large number of attributes (tall fat ...
Kernel methods are a broad class of algorithms that are applied in a host of scientific computing fi...
We study three fundamental problems of Linear Algebra, lying in the heart of various Machine Learnin...
The Nyström method is an efficient technique for large-scale kernel learning. It provides a low-rank...
Modern learning problems in nature language processing, computer vision, computational biology, etc....
Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequen...
We investigate, theoretically and empirically, the effectiveness of kernel K-means++ samples as land...
Low rank matrix factorization is an important step in many high dimensional machine learning algorit...
ABSTRACT. We reconsider randomized algorithms for the low-rank approximation of symmetric positive s...
The purpose of this text is to provide an accessible introduction to a set of recently developed alg...
Kernel methods are widely used to address a variety of learning tasks including classification, regr...
In many areas of machine learning, it becomes necessary to find the eigenvector decompositions of la...
A CUR approximation of a matrix A is a particular type of low-rank approximation where C and R consi...
Positive semidefinite matrices arise in a variety of fields, including statistics, signal processing...