Amazon cover image
Image from Amazon.com

Foundations of data science

By: Contributor(s): Material type: TextTextPublication details: New York : Cambridge University Press, ©2020Description: viii, 424 p. : ill. ; 26 cmISBN:
  • 9781108485067
Subject(s): Additional physical formats: Online version:: Foundations of data scienceDDC classification:
  • 004 23 BLU-F
LOC classification:
  • QA76 .B5675 2020
Contents:
1 Introduction 2 High-Dimensional Space 3 Best-Fit Subspaces and Singular Value Decomposition (SVD) 4 Random Walks and Markov Chains 5 Machine Learning 6 Algorithms for Massive Data Problems: Streaming, Sketching, and Sampling 7 Clustering 8 Random Graphs 9 Topic Models, Nonnegative Matrix Factorization, Hidden Markov Models, and Graphical Models 10 Other Topics 11 Wavelets 12 Background Material
Summary: "This book provides an introduction to the mathematical and algorithmic foundations of data science, including machine learning, high-dimensional geometry, and analysis of large networks. Topics include the counterintuitive nature of data in high dimensions, important linear algebraic techniques such as singular value decomposition, the theory of random walks and Markov chains, the fundamentals of and important algorithms for machine learning, algorithms and analysis for clustering, probabilistic models for large networks, representation learning including topic modelling and non-negative matrix factorization, wavelets and compressed sensing. Important probabilistic techniques are developed including the law of large numbers, tail inequalities, analysis of random projections, generalization guarantees in machine learning, and moment methods for analysis of phase transitions in large random graphs. Additionally, important structural and complexity measures are discussed such as matrix norms and VC-dimension. This book is suitable for both undergraduate and graduate courses in the design and analysis of algorithms for data"--
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
Books Books IIITD General Stacks Computer Science and Engineering 004 BLU-F (Browse shelf(Opens below)) Available 012056
Total holds: 0

Includes bibliographical references and index.

1 Introduction





2 High-Dimensional Space 3 Best-Fit Subspaces and Singular Value Decomposition (SVD) 4 Random Walks and Markov Chains 5 Machine Learning 6 Algorithms for Massive Data Problems: Streaming, Sketching, and Sampling 7 Clustering 8 Random Graphs 9 Topic Models, Nonnegative Matrix Factorization, Hidden Markov Models, and Graphical Models 10 Other Topics 11 Wavelets
12 Background Material

"This book provides an introduction to the mathematical and algorithmic foundations of data science, including machine learning, high-dimensional geometry, and analysis of large networks. Topics include the counterintuitive nature of data in high dimensions, important linear algebraic techniques such as singular value decomposition, the theory of random walks and Markov chains, the fundamentals of and important algorithms for machine learning, algorithms and analysis for clustering, probabilistic models for large networks, representation learning including topic modelling and non-negative matrix factorization, wavelets and compressed sensing. Important probabilistic techniques are developed including the law of large numbers, tail inequalities, analysis of random projections, generalization guarantees in machine learning, and moment methods for analysis of phase transitions in large random graphs. Additionally, important structural and complexity measures are discussed such as matrix norms and VC-dimension. This book is suitable for both undergraduate and graduate courses in the design and analysis of algorithms for data"--

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in