A Confidence Interval (CI) is a range of values that contains the true value of something we are trying to measure like the average height of students or average income of a population.
Instead of saying: “The average height is 165 cm.”
We can say: “We are 95% confident the average height is between 160 cm and 170 cm.”
Before diving into confidence intervals you should be familiar with:
Interpreting Confidence Intervals
Let's say we take a sample of 50 students and calculate a 95% confidence interval for their average height which turns out to be 160–170 cm. This means If we repeatedly take similar samples 95% of those intervals would contain the true average height of all students in the population.
Confidence IntervalConfidence level tells us how sure we are that the true value is within a calculated range. If we have to repeat the sampling process many times we expect that a certain percentage of those intervals will include the true value.
Confidence Level | Meaning |
---|
90% | 90 out of 100 intervals will include the true value |
---|
95% | 95 out of 100 intervals will include the true value (most commonly used) |
---|
99% | 99 out of 100 intervals will include the true value (more conservative) |
---|
\text{Confidence Level} = 1 - \alpha
Where \alpha is the significance level (commonly 0.05 for 95% CI).
Why are Confidence Intervals Important in Data Science?
- They helps to measure uncertainty in predictions and estimates.
- Through this data scientists finds the reliable results instead of just giving a single number.
- They are widely used in A/B testing, machine learning, and survey analysis.
Steps for Constructing a Confidence Interval
To calculate a confidence interval follow these simple 4 steps:
Step 1: Identify the sample problem.
Define the population parameter you want to estimate e.g., mean height of students. Choose the right statistic such as the sample mean.
Step 2: Select a confidence level.
In this step we select the confidence level some common choices are 90%, 95% or 99%. It represents how sure we are about our estimate.
Step 3: Find the margin of error.
To find the Margin of Error, you use the formula:
Margin of Error = Critical Value × Standard Error
- Critical Value: Found using Z-tables (for large samples) or T-tables (for small samples).
- Standard Error (SE): Measures how much the sample mean varies.
SE = \frac{\text{Standard Deviation}}{\sqrt{n}}
Combine these to get your Margin of Error the amount you add/subtract from your estimate to create a range.
Step 4: Specify the confidence interval.
To find a Confidence Interval, we use this formula:
Confidence Interval = Point Estimate ± Margin of Error
- The Point Estimate is usually your sample mean.
- Adding and subtracting the margin of error gives the range where the true value is likely to be.
Types of Confidence Intervals
Some of the common types of Confidence Intervals are:
Types of confidence Interval1. Confidence Interval for the Mean of Normally Distributed Data
When we want to find the mean of a population based on a sample we use this method.
- If the sample size is small (less than 30) we use the T-distribution .
- If the sample size is large (more than 30) then we use the Z-distribution.
2. Confidence Interval for Proportions
This type is used when estimating population proportions like the percentage of people who like a product. Here we use the sample proportion, the standard error and the critical Z-value to calculate the interval. It gives us the idea where the real value could fall based on sample data.
3. Confidence Interval for Non-Normally Distributed Data
If your data isn’t normally distributed (doesn’t follow a bell curve), use bootstrap methods:
- Randomly resample the data many times
- Calculate intervals from these resamples
This gives a good estimate even if the data is skewed or irregular.
For Calculating Confidence Interval
To calculate a confidence interval you need two key statistics:
- Mean (\mu): Average of all sample values
- Standard Deviation (\sigma): Shows how much values vary from the mean
Once you have these you can calculate the confidence interval either using t-distribution or z-distribution depend on the sample size whether the population standard deviation is known.
A) Using t-distribution
Used when:
- Sample size is small
- Population standard deviation is unknown
Example:
Sample size = 10
Mean weight = 240 kg
Std deviation = 25 kg
Confidence Level = 95%
Step-by-Step Process:
- Degrees of Freedom (df): For t-distribution we first calculate the degrees of freedom: df= n−1= 10−1= 9
- Significance Level (α): The confidence level (CL) is 95% so the significance level is: \alpha = \frac{1 - \text{CL}}{2} = \frac{1 - 0.95}{2} = 0.025
- Find t-value from t-distribution table: From the t-table for df = 9 and α = 0.025 the t-value is 2.262 which can be find using the below table.
(df)/(α) | 0.1 | 0.05 | 0.025 | . . |
---|
∞ | 1.282 | 1.645 | 1.960 | . . |
---|
1 | 3.078 | 6.314 | 12.706 | . . |
---|
2 | 1.886 | 2.920 | 4.303 | . . |
---|
: | : | : | : | . . |
---|
8 | 1.397 | 1.860 | 2.306 | . . |
---|
9 | 1.383 | 1.833 | 2.262 | . . |
---|
- Apply t-value in the formula:
The formula for the confidence interval is: \mu \pm t \left( \frac{\sigma}{\sqrt{n}} \right) Using the values: 240 \pm 2.262 \times \left(\frac{25}{\sqrt{10}}\right) - The confidence interval becomes: (222.117,257.883)
Therefore we are 95% confident that the true mean weight of UFC fighters is between 222.117 kg and 257.883 kg.
This can be calculated using Python’s scipy and math library to find the t-value and perform the necessary calculations. The stats module provides various statistical functions, probability distributions, and statistical tests.
Python
import scipy.stats as stats
import math
mean = 240
std = 25
n = 10
df = n - 1
alpha = 0.025
t = stats.t.ppf(1 - alpha, df)
moe = t * (std / math.sqrt(n))
lower = mean - moe
upper = mean + moe
print(f"Confidence Interval: ({lower:.2f}, {upper:.2f})")
Output:
Confidence Interval: (222.1160773511857, 257.8839226488143)
B) Using Z-distribution
Used when:
- Sample size is large
- Population standard deviation is known
Consider the following example. A random sample of 50 adult females was taken and their RBC count is measured. The sample mean is 4.63 and the standard deviation of RBC count is 0.54. Construct a 95% confidence interval estimate for the true mean RBC count in adult females.
Step-by-Step Process:
- Find the mean and standard deviation given in the problem.
- Find the z-value for the confidence level:
For a 95% confidence interval the z-value is 1.960. - Apply z-value in the formula: \mu \pm z\left(\frac{\sigma}{\sqrt{n}}\right)
Using the values: some common values in the table given below:
Confidence Interval | z-value |
---|
90% | 1.645 |
---|
95% | 1.960 |
---|
99% | 2.576 |
---|
The confidence interval becomes: (4.480,4.780)
Therefore we are 95% confident that the true mean RBC count for adult females is between 4.480 and 4.780.
Now let's do the implementation of it using Python. But before its implementation we should have some basic knowledge about numpy and scipy.
Python
from scipy import stats
import numpy as np
mean = 4.63
std_dev = 0.54
n = 50
z = 1.960
se = std_dev / np.sqrt(n)
moe = z * se
lower = mean - moe
upper = mean + moe
print(f"Confidence Interval: ({lower:.3f}, {upper:.3f})")
Output:
Confidence Interval: (4.480, 4.780)
Some Key Takeaways from Confidence Interval are:
- Confidence Intervals are essential in data science to find the uncertainty of estimates and make predictions more reliable.
- t-distribution is used for small sample sizes (n < 30) while z-distribution is used for large sample sizes (n > 30).
- Confidence intervals help to make data-driven decisions by providing a range instead of a single point estimate. This is especially important in A/B testing, market research and machine learning.
Confidence Interval in Maths
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem