CS 361

Introduction to probability theory and statistics with applications to computer science. Topics include: visualizing datasets, summarizing data, basic descriptive statistics, conditional probability, independence, Bayes theorem, random variables, joint and conditional distributions, expectation, variance and covariance, central limit theorem. Markov inequality, Chebyshev inequality, law of large numbers, Markov chains, simulation, the PageRank algorithm, populations and sampling, sample mean, standard error, maximum likelihood estimation, Bayes estimation, hypothesis testing, confidence intervals, linear regression, principal component analysis, classification, and decision trees. Course Information: Same as STAT 361. Credit is not given for both CS 361 and ECE 313. Prerequisite: MATH 220 or 221; credit or concurrent registration in MATH 225. For majors only.

Forsyth, D. A. "Probability and Statistics for Computer Science," Springer (2018)

Visualize and summarize data and reason about outliers and relationships (1), (3)

Apply the principles of probability to analyze and simulate random events (1)

Use inference to fit statistical models to data and evaluate how good the fit is (1), (3)

Apply machine learning tools to dimensionality reduction, classification, clustering, regression and hidden Markov model problems (1), (2), (6)

visualizing datasets, summarizing data, basic descriptive statistics, conditional probability, independence, Bayes theorem, random variables, joint and conditional distributions, expectation, variance and covariance, central limit theorem. Markov inequality, Chebyshev inequality, law of large numbers, Markov chains, simulation, the PageRank algorithm, populations and sampling, sample mean, standard error, maximum likelihood estimation, Bayes estimation, hypothesis testing, confidence intervals, linear regression, principal component analysis, classification, decision trees, clustering and Markov chains

2/7/2019by David Varodayan