A Way for Low Ranking Matrices and its Stochastic Computations Using Monte Carlo Method

Behrouz Fathi-Vajargah; Ateyeh Jahanbin

doi:10.2478/jamsi-2014-0006

.blurhash-client-img { display: none !important; }

A Way for Low Ranking Matrices and its Stochastic Computations Using Monte Carlo Method

Journal of Applied Mathematics, Statistics and Informatics

Volume 10 (2014): Issue 1 (May 2014)

By: Behrouz Fathi-Vajargah and Ateyeh Jahanbin

Open Access

|Jul 2014

Abstract

We present approximation theory of matrices based on its low ranking and stochastic computation. Finally, based on our introduced algorithm, we show the performance of these approximations to evaluate the desired results.

References

ACHLIOPTAS. D AND McSHERRY. F, Fast computation of low rank matrix approximations, J.ACM, to appear.
Search in Google Scholar
Agrawal. R, Gerhrke. J, Gunopulos. D, and Raghavan. P, Automaticsubspace clustering of high dimensional data for data mining applications, Proc. ACMSIGMOD Conf. on Management of Data, 1998, 94-105.10.1145/276305.276314
Search in Google Scholar
Barbara. D, Faloutsos. Hellerstein. C, Ioannidis. Y, Jagadish. H. V., Johnson. T, R. Ng,
Search in Google Scholar
POOSALA.V, ROSS. K, AND Sevcik. K. C, The New Jersey data reduction report, Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 1997.
Search in Google Scholar
Drineas. P, Kannan. R, and Mahoney. M. W, Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication, SIAM J. Comput., 36 (2006), pp. 132-157.
Search in Google Scholar
DRINEAS. P, Kannan. R, AND MAHONEY. M. W, Fast Monte Carlo algorithms for matricesll: Computing a low-rank approximation to a matrix, SIAM J. Comput., 36 (2006), pp.158-183.
Search in Google Scholar
DRINEAS. P AND Kannan. R, Pass efficient algorithms for approximating large matrices, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 223-232.
Search in Google Scholar
Feigenbaum. J, Kannan. S, Strauss. M, and Viswanathan. M, An approximate L1 -dfference algorithm for massive data sets, in Proceedings of the 40th Annual IEEE Symposium on the Foundations of Computer Science, 1999, pp. 501-511.
Search in Google Scholar
Golub. G. H and Van Loan. C. F, Matrix Computations, Johns Hopkins University Press, London, 1989.
Search in Google Scholar
Henzinger. M. R, RAGHAVAN. P, AND Rajagopalan. S, Computing on Data Streams, Tech. Report 1998011, Digital Systems Research Center, Palo Alto, CA, 1998.
Search in Google Scholar
MUNRO. J. I AND PATERSON. M. S, Selection and sorting with limited storage, in Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, 1978, pp. 253-258.10.1109/SFCS.1978.32
Search in Google Scholar

Articles in this issue

DOI: https://doi.org/10.2478/jamsi-2014-0006 | Journal eISSN: 1339-0015 | Journal ISSN: 1336-9180

Journal RSS Feed

Language: English

Page range: 63 - 74

Published on: Jul 15, 2014

Published by: University of Ss. Cyril and Methodius in Trnava

In partnership with: Paradigm Publishing Services

Publication frequency: 2 issues per year

Keywords:

Low rank,

Randomized algorithm,

Monte Carlo method,

Singular value decomposition,

Matrix multiplication

Related subjects:

Computer sciences,

Information technology,

Mathematics,

Logic and set theory,

Probability and statistics,

Applied mathematics

© 2014 Behrouz Fathi-Vajargah, Ateyeh Jahanbin, published by University of Ss. Cyril and Methodius in Trnava
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Volume 10 (2014): Issue 1 (May 2014)