Courses tagged with "Customer Service Certification Program" (208)

Learn how to draw conclusions about populations or scientific truths from data. This is the sixth course in the Johns Hopkins Data Science Course Track.

Introduction to statistics. Will eventually cover all of the major topics in a first-year statistics course.

Introduction to statistics. We start with the basics of reading and interpretting data and then build into descriptive and inferential statistics that are typically covered in an introductory course on the subject. Overview of Khan Academy statistics. Statistics intro: mean, median and mode. Constructing a box-and-whisker plot. Sample mean versus population mean.. Variance of a population. Sample variance. Review and intuition why we divide by n-1 for the unbiased sample variance. Simulation showing bias in sample variance. Simulation providing evidence that (n-1) gives us unbiased estimate. Statistics: Standard Deviation. Statistics: Alternate Variance Formulas. Introduction to Random Variables. Probability Density Functions. Binomial Distribution 1. Binomial Distribution 2. Binomial Distribution 3. Binomial Distribution 4. Expected Value: E(X). Expected Value of Binomial Distribution. Poisson Process 1. Poisson Process 2. Introduction to the Normal Distribution. Normal Distribution Excel Exercise. Law of Large Numbers. ck12.org Normal Distribution Problems: Qualitative sense of normal distributions. ck12.org Normal Distribution Problems: Empirical Rule. ck12.org Normal Distribution Problems: z-score. ck12.org Exercise: Standard Normal Distribution and the Empirical Rule. ck12.org: More Empirical Rule and Z-score practice. Central Limit Theorem. Sampling Distribution of the Sample Mean. Sampling Distribution of the Sample Mean 2. Standard Error of the Mean. Sampling Distribution Example Problem. Confidence Interval 1. Confidence Interval Example. Mean and Variance of Bernoulli Distribution Example. Bernoulli Distribution Mean and Variance Formulas. Margin of Error 1. Margin of Error 2. Small Sample Size Confidence Intervals. Hypothesis Testing and P-values. One-Tailed and Two-Tailed Tests. Z-statistics vs. T-statistics. Type 1 Errors. Small Sample Hypothesis Test. T-Statistic Confidence Interval. Large Sample Proportion Hypothesis Testing. Variance of Differences of Random Variables. Difference of Sample Means Distribution. Confidence Interval of Difference of Means. Clarification of Confidence Interval of Difference of Means. Hypothesis Test for Difference of Means. Comparing Population Proportions 1. Comparing Population Proportions 2. Hypothesis Test Comparing Population Proportions. Squared Error of Regression Line. Proof (Part 1) Minimizing Squared Error to Regression Line. Proof Part 2 Minimizing Squared Error to Line. Proof (Part 3) Minimizing Squared Error to Regression Line. Proof (Part 4) Minimizing Squared Error to Regression Line. Regression Line Example. Second Regression Example. R-Squared or Coefficient of Determination. Calculating R-Squared. Covariance and the Regression Line. Correlation and Causality. Chi-Square Distribution Introduction. Pearson's Chi Square Test (Goodness of Fit). Contingency Table Chi-Square Test. ANOVA 1 - Calculating SST (Total Sum of Squares). ANOVA 2 - Calculating SSW and SSB (Total Sum of Squares Within and Between).avi. ANOVA 3 -Hypothesis Test with F-Statistic. Another simulation giving evidence that (n-1) gives us an unbiased estimate of variance. Mean Median and Mode. Range and Mid-range. Reading Pictographs. Reading Bar Graphs. Reading Line Graphs. Reading Pie Graphs (Circle Graphs). Misleading Line Graphs. Stem-and-leaf Plots. Box-and-Whisker Plots. Reading Box-and-Whisker Plots. Statistics: The Average. Statistics: Variance of a Population. Statistics: Sample Variance. Deductive Reasoning 1. Deductive Reasoning 2. Deductive Reasoning 3. Inductive Reasoning 1. Inductive Reasoning 2. Inductive Reasoning 3. Inductive Patterns.

We live in a time of unprecedented access to information. You'll learn how to use statistics to interpret that information and make decisions. San Jose State University

This course is a broad treatment of statistics, concentrating on specific statistical techniques used in science and industry. Topics include: hypothesis testing and estimation, confidence intervals, chi-square tests, nonparametric statistics, analysis of variance, regression, correlation, decision theory, and Bayesian statistics.

This course teaches the art of guessing results and solving problems without doing a proof or an exact calculation. Techniques include extreme-cases reasoning, dimensional analysis, successive approximation, discretization, generalization, and pictorial analysis. Applications include mental calculation, solid geometry, musical intervals, logarithms, integration, infinite series, solitaire, and differential equations. (No epsilons or deltas are harmed by taking this course.) This course is offered during the Independent Activities Period (IAP), which is a special 4-week term at MIT that runs from the first week of January until the end of the month.

The subject of enumerative combinatorics deals with counting the number of elements of a finite set. For instance, the number of ways to write a positive integer n as a sum of positive integers, taking order into account, is 2^n-1. We will be concerned primarily with bijective proofs, i.e., showing that two sets have the same number of elements by exhibiting a bijection (one-to-one correspondence) between them. This is a subject which requires little mathematical background to reach the frontiers of current research. Students will therefore have the opportunity to do original research. It might be necessary to limit enrollment.

This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory.

This course is an elementary introduction to number theory with no algebraic prerequisites. Topics covered include primes, congruences, quadratic reciprocity, diophantine equations, irrational numbers, continued fractions, and partitions. 

This course covers topics such as sums of independent random variables, central limit phenomena, infinitely divisible laws, Levy processes, Brownian motion, conditioning, and martingales.

The course consists of a sampling of topics from algebraic combinatorics. The topics include the matrix-tree theorem and other applications of linear algebra, applications of commutative and exterior algebra to counting faces of simplicial complexes, and applications of algebra to tilings.

The main aims of this seminar will be to go over the classification of surfaces (Enriques-Castelnuovo for characteristic zero, Bombieri-Mumford for characteristic p), while working out plenty of examples, and treating their geometry and arithmetic as far as possible.

This course provides an introduction to algebraic number theory. Topics covered include dedekind domains, unique factorization of prime ideals, number fields, splitting of primes, class group, lattice methods, finiteness of the class number, Dirichlet's units theorem, local fields, ramification, discriminants.

The goal of this course is to describe some of the tools which enter into the proof of Sullivan's conjecture.

In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with non-bipartite matchings and cover many results extending the fundamental results of matchings, flows and matroids. The emphasis is on the derivation of purely combinatorial results, including min-max relations, and not so much on the corresponding algorithmic questions of how to find such objects. The intended audience consists of Ph.D. students interested in optimization, combinatorics, or combinatorial algorithms.