Foundations of data science / Avrim Blum, John Hopcroft, Ravi Kannan.
Blum, Avrim, 1966-| Call Number | 004 |
| Author | Blum, Avrim, 1966- author. |
| Title | Foundations of data science / Avrim Blum, John Hopcroft, Ravi Kannan. |
| Physical Description | 1 online resource (viii, 424 pages) : digital, PDF file(s). |
| Notes | Title from publisher's bibliographic system (viewed on 29 Jan 2020). |
| 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. |
| Added Author | Hopcroft, John E., 1939- author. Kannan, Ravindran, 1953- author. |
| Subject | COMPUTER SCIENCE. STATISTICS. Quantitative research. |
| Multimedia |
Total Ratings:
0
02441nam a22003858i 4500
001
vtls001584834
003
VRT
005
20200921122200.0
006
m|||||o||d||||||||
007
cr||||||||||||
008
200921s2020||||enk o ||1 0|eng|d
020
$a 9781108755528 (ebook)
020
$z 9781108485067 (hardback)
035
$a (UkCbUP)CR9781108755528
039
9
$y 202009211222 $z santha
040
$a UkCbUP $b eng $e rda $c UkCbUP
050
0
0
$a QA76 $b .B5675 2020
082
0
0
$a 004 $2 23
100
1
$a Blum, Avrim, $d 1966- $e author.
245
1
0
$a Foundations of data science / $c Avrim Blum, John Hopcroft, Ravi Kannan.
264
1
$a Cambridge : $b Cambridge University Press, $c 2020.
300
$a 1 online resource (viii, 424 pages) : $b digital, PDF file(s).
336
$a text $b txt $2 rdacontent
337
$a computer $b c $2 rdamedia
338
$a online resource $b cr $2 rdacarrier
500
$a Title from publisher's bibliographic system (viewed on 29 Jan 2020).
520
$a 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.
650
0
$a COMPUTER SCIENCE.
650
0
$a STATISTICS.
650
0
$a Quantitative research.
700
1
$a Hopcroft, John E., $d 1939- $e author.
700
1
$a Kannan, Ravindran, $d 1953- $e author.
776
0
8
$i Print version: $z 9781108485067
856
4
0
$u https://doi.org/10.1017/9781108755528
999
$a VIRTUA
No Reviews to Display
| 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. |
| Notes | Title from publisher's bibliographic system (viewed on 29 Jan 2020). |
| Subject | COMPUTER SCIENCE. STATISTICS. Quantitative research. |
| Multimedia |