Sciweavers

21 search results - page 1 / 5
» Heteroscedastic Low-Rank Matrix Approximation by the Wiberg ...
Sort
View
TSP
2008
178views more  TSP 2008»
13 years 4 months ago
Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
Pei Chen
TKDE
2012
270views Formal Methods» more  TKDE 2012»
11 years 6 months ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
SIAMSC
2011
219views more  SIAMSC 2011»
12 years 11 months ago
Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
H. P. Flath, Lucas C. Wilcox, Volkan Akcelik, Judi...
CORR
2011
Springer
168views Education» more  CORR 2011»
12 years 11 months ago
Optimal Column-Based Low-Rank Matrix Reconstruction
We prove that for any real-valued matrix X ∈ Rm×n , and positive integers r k, there is a subset of r columns of X such that projecting X onto their span gives a r+1 r−k+1 -a...
Venkatesan Guruswami, Ali Kemal Sinop
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 7 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon