Models of computation for big data
Author(s)
Bibliographic Information
Models of computation for big data
(Advanced information and knowledge processing)(SpringerBriefs in advanced information and knowledge processing)
Springer, c2018
Available at 1 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. 101-104)
https://doi.org/10.1007/978-3-319-91851-8
Description and Table of Contents
Description
The big data tsunami changes the perspective of industrial and academic research in how they address both foundational questions and practical applications. This calls for a paradigm shift in algorithms and the underlying mathematical techniques. There is a need to understand foundational strengths and address the state of the art challenges in big data that could lead to practical impact. The main goal of this book is to introduce algorithmic techniques for dealing with big data sets. Traditional algorithms work successfully when the input data fits well within memory. In many recent application situations, however, the size of the input data is too large to fit within memory.
Models of Computation for Big Data, covers mathematical models for developing such algorithms, which has its roots in the study of big data that occur often in various applications. Most techniques discussed come from research in the last decade. The book will be structured as a sequence of algorithmic ideas, theoretical underpinning, and practical use of that algorithmic idea. Intended for both graduate students and advanced undergraduate students, there are no formal prerequisites, but the reader should be familiar with the fundamentals of algorithm design and analysis, discrete mathematics, probability and have general mathematical maturity.
Table of Contents
Preface.- Streaming Models.- Introduction.- Indyk's Algorithm.- Point Query.- Sketching.- Sub-Linear Time Models.- Introduction.- Dimentionality Reduction.- Johnson Lindenstrauss Lower Bound.- Fast Johnson Lindenstrauss Transform.- Sublinear Time Algorithmic Models.- Linear Algebraic Models.- Introduction.- Subspace Embeddings.- Low-Rank Approximation.- The Matrix Completion Problem.- Other Computational Models.- References
by "Nielsen BookData"