國立高雄大學圖資館 |

Language: English

Back

Models of computation for big data

Akerkar, Rajendra.

Models of computation for big data

Record Type:	Electronic resources : Monograph/item
Title/Author:	Models of computation for big databy Rajendra Akerkar.
Author:	Akerkar, Rajendra.
Published:	Cham :Springer International Publishing :2018.
Description:	viii, 104 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Big dataMathematical models.
Online resource:	https://doi.org/10.1007/978-3-319-91851-8
ISBN:	9783319918518$q(electronic bk.)

Models of computation for big data
Akerkar, Rajendra.

Models of computation for big data[electronic resource] /by Rajendra Akerkar. - Cham :Springer International Publishing :2018. - viii, 104 p. :ill., digital ;24 cm. - SpringerBriefs in advanced information and knowledge processing,2524-5198. - SpringerBriefs in advanced information and knowledge processing..

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.

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.

ISBN: 9783319918518$q(electronic bk.)

Standard No.: 10.1007/978-3-319-91851-8doiSubjects--Topical Terms:

825713
Big data
--Mathematical models.

LC Class. No.: QA76.9.B45

Dewey Class. No.: 005.7

Models of computation for big data
LDR:02814nmm a2200337 a 4500 001 546703
003 DE-He213
005 20181204222550.0
006 m d
007 cr nn 008maaau
008 190627s2018 gw s 0 eng d
020 $a 9783319918518$q(electronic bk.)
020 $a 9783319918501$q(paper)
024 7 $a 10.1007/978-3-319-91851-8 $2 doi
035 $a 978-3-319-91851-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.B45
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.7 $2 23
090 $a QA76.9.B45 $b A314 2018
100 1 $a Akerkar, Rajendra. $3 743409
245 1 0 $a Models of computation for big data $h [electronic resource] / $c by Rajendra Akerkar.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a viii, 104 p. : $b ill., digital ; $c 24 cm.
490 1 $a SpringerBriefs in advanced information and knowledge processing, $x 2524-5198
505 0 $a 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.
520 $a 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.
650 0 $a Big data $x Mathematical models. $3 825713
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Data Mining and Knowledge Discovery. $3 275288
650 2 4 $a Linear Algebra. $3 821215
650 2 4 $a Models and Principles. $3 273718
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a SpringerBriefs in advanced information and knowledge processing. $3 825712
856 4 0 $u https://doi.org/10.1007/978-3-319-91851-8
950 $a Computer Science (Springer-11645)