Abstract
This chapter presents some of the fundamental linear algebraic tools for large scale data analysis and machine learning. Specifically, the focus will fall on large scale linear algebra, including iterative, approximate and randomized algorithms for basic linear algebra computations and matrix functions. Algorithms of such type are mostly pass-efficient, requiring only a constant number of passes over the matrix data for creating samples or sketches, and other work. Most these algorithms require at least two passes for their efficient performance guarantees, with respect to error or failure probability. Such a one-pass algorithm is close to the streaming model of computation, where there is one pass over the data, and resource bounds are sublinear in the data size.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Akerkar, R. (2018). Linear Algebraic Models. In: Models of Computation for Big Data. Advanced Information and Knowledge Processing(). Springer, Cham. https://doi.org/10.1007/978-3-319-91851-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-91851-8_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91850-1
Online ISBN: 978-3-319-91851-8
eBook Packages: Computer ScienceComputer Science (R0)