IDEALS Home University of Illinois at Urbana-Champaign logo The Alma Mater The Main Quad

Spectral Regression for Dimensionality Reduction

Show full item record

Bookmark or cite this item: http://hdl.handle.net/2142/11335

Files in this item

File Description Format
PDF Spectral Regres ... mensionality Reduction.pdf (273KB) (no description provided) PDF
Title: Spectral Regression for Dimensionality Reduction
Author(s): Cai, Deng; He, Xiaofei; Han, Jiawei
Subject(s): algorithms spectral methods
Abstract: Spectral methods have recently emerged as a powerful tool for dimensionality reduction and manifold learning. These methods use information contained in the eigenvectors of a data affinity (\ie, item-item similarity) matrix to reveal low dimensional structure in high dimensional data. The most popular manifold learning algorithms include Locally Linear Embedding, Isomap, and Laplacian Eigenmap. However, these algorithms only provide the embedding results of training samples. There are many extensions of these approaches which try to solve the out-of-sample extension problem by seeking an embedding function in reproducing kernel Hilbert space. However, a disadvantage of all these approaches is that their computations usually involve eigen-decomposition of dense matrices which is expensive in both time and memory. In this paper, we propose a novel dimensionality reduction method, called {\bf Spectral Regression} (SR). SR casts the problem of learning an embedding function into a regression framework, which avoids eigen-decomposition of dense matrices. Also, with the regression based framework, different kinds of regularizers can be naturally incorporated into our algorithm which makes it more flexible. SR can be performed in supervised, unsupervised and semi-supervised situation. It can make efficient use of both labeled and unlabeled points to discover the intrinsic discriminant structure in the data. Experimental results on classification and semi-supervised classification demonstrate the effectiveness and efficiency of our algorithm.
Issue Date: 2007-05
Genre: Technical Report
Type: Text
URI: http://hdl.handle.net/2142/11335
Other Identifier(s): UIUCDCS-R-2007-2856
Rights Information: You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).
Date Available in IDEALS: 2009-04-22
 

This item appears in the following Collection(s)

Show full item record

Item Statistics

  • Total Downloads: 503
  • Downloads this Month: 13
  • Downloads Today: 0

Browse

My Account

Information

Access Key