NUMERICAL LINEAR ALGEBRA IN DATA EXPLORATION

CSci 8363 -- Fall 2008

Daniel Boley

TTh 4-5:15pm, MechE 102

Linear Algebra has contributed many methods for handling very large quantities of numerical data. Here we examine many of these linear algebra methods and how they have been applied to the exploration and analysis of very large data collections. After a brief review of some basic concepts in linear algebra, most of the class will be devoted to how these linear algebra methods have been used in information retrieval, data mining, unsupervised clustering, bioinformatics, and the like. Examples of methods we will examine are Latent Semantic Indexing, Linear Least Squares Fit, Principal Direction Divisive Partitioning, Hubs and Authorities Analysis, Support Vector Machines, and recent ideas on non-negative matrix decompositions. A collection of basic research papers, some of a tutorial nature, will be used for the class. Examples will be taken from vision recognition systems, biological gene analysis, document retrieval.

Prerequisites

Students should be familiar with basic linear algebra concepts and methods such as Gaussian elimination for systems of linear equations, plus some familarity with. concepts such as matrix eigenvalues, singular values, and matrix least squares problems, though some time will be spent reviewing these latter topics.

Work Plan

Students will be expected to do the following. Your project will count toward the Project Requirements for a Plan C MS degree in Computer Science.

Topics

For Further Information

Contact Daniel Boley, 6-209 EE/CS Bldg, boley@cs.umn.edu, 625-3887. http://www-users.cs.umn.edu/~boley