Sparse PCA: Convex Relaxations, Algorithms and Applications

Details Sparse PCA: Convex Relaxations, Algorithms and Applications Sparse PCA: Convex Relaxations, Algorithms and Applications

2010-11-16

arxiv.org/abs/1011.3781v2

Mathematics

Optimization and Control

To appear in "Handbook on Semidefinite, Cone and Polynomial Optimization", M. Anjos and J.B. Lasserre, editors. This revision

Scientific paper

Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonzero coefficients in this combination. This is known as sparse principal component analysis and has a wide array of applications in machine learning and engineering. Unfortunately, this problem is also combinatorially hard and we discuss convex relaxation techniques that efficiently produce good approximate solutions. We then describe several algorithms solving these relaxations as well as greedy algorithms that iteratively improve the solution quality. Finally, we illustrate sparse PCA in several applications, ranging from senate voting and finance to news data.

Affiliated with

Also associated with

No associations

Rating

Sparse PCA: Convex Relaxations, Algorithms and Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sparse PCA: Convex Relaxations, Algorithms and Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparse PCA: Convex Relaxations, Algorithms and Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-465184