Fast Monte-carlo low rank approximations for matrices

Proceedings 2006 IEEE/SMC International Conference on System of Systems Engineering

Volumn 2006, Issue , 2006, Pages 218-223

  Friedland, Shmuel ^a   Niknejad, Amir ^a   Kaveh, Mostafa ^b   Zare, Hossein ^b  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b University of Minnesota   (United States)

Author keywords

Fast k rank approximation; Monte Carlo algorithm; SVD decomposition

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; DATA MINING; DATA REDUCTION; ITERATIVE METHODS; MONTE CARLO METHODS; STORAGE ALLOCATION (COMPUTER);

FAST K RANK APPROXIMATION; SINGULAR VALUE DECOMPOSITION (SVD);

MATRIX ALGEBRA;

EID: 33845962871     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. C.C. Aggrawal, C.M. Procopiuc, J.L. Wolf, P.S. Yu and J.S. Park, Fast algorithms for projected clustering, Proc. of ACM SIGMOD Intl. Conf. Management of Data 1999, 61-72.
2. R. Agrawal, J.Gerhrke, D.Gunopulos, and P. Raghavan, Automatic subspace clustering of high dimensional data for data mining applications, Proc. ACM SIGMOD Conf. on Management of Data, 1998, 94-105.
3. P. Drineas, A. Frieze, R. Kannan, S. Vempala and V. Vinay, Clustering large graphs via the singular value decomposition, Journal of Machine Learning, 56 (2004), 9-33.
4. M. Ester, H.-P. Krieger, J. Sander and X.Xu, A density-based algortihm for discovering clusters in large spatial databases with nose, Proc. 2nd Intl. Conf. Knowledge Discovery and Data Mining, 1996, 226-231.
5. S. Friedland, Inverse eigenvalue problems, Linear Algebra Appl. 17 (1977), 15-51.
6. S. Friedland, M. Kaveh, A. Niknejad and H. Zare, An Algorithm for Missing Value Estimation for DNA Microarray Data, Proceedings of ICASSP 2006, Toulouse, France, 4 pp..
7. S. Friedland, A. Niknejad and L. Chihara, A simultaneous reconstruction of missing data in DNA microarrays, Linear Algebra Appl., to appear.
8. A. Frieze, R. Kannan and S. Vempala, Fast Monte-Carlo algorithms for finding low rank approximations, Proceedings of the 39th Annual Symposium on Foundation of Computer Science, 1998.
9. G.H. Golub and C.F. Van Loan, Matrix Computation, Johns Hopkins Univ. Press, 3rd Ed., 1996.
10. C.M. Procopiuc, P.K. Agarwal, M. Jones and T.M. Murali, A Monte Carlo algorithm for fast projective clustering, Proc. of ACM SIGMOD Intl. Conf. Management of Data 2002.