Concept

Conditional probability

In probability theory, conditional probability is a measure of the probability of an event occurring, given that another event (by assumption, presumption, assertion or evidence) has already occurred. This particular method relies on event B occurring with some sort of relationship with another event A. In this event, the event B can be analyzed by a conditional probability with respect to A. If the event of interest is A and the event B is known or assumed to have occurred, "the conditional probability of A given B", or "the probability of A under the condition B", is usually written as P(AB) or occasionally P_B(A). This can also be understood as the fraction of probability B that intersects with A, or the ratio of the probabilities of both events happening to the "given" one happening (how many times A occurs rather than not assuming B has occurred): . For example, the probability that any given person has a cough on any given day may be only 5%. But if we know or assume that the person is sick, then they are much more likely to be coughing. For example, the conditional probability that someone unwell (sick) is coughing might be 75%, in which case we would have that P(Cough) = 5% and P(CoughSick) = 75 %. Although there is a relationship between A and B in this example, such a relationship or dependence between A and B is not necessary, nor do they have to occur simultaneously. P(AB) may or may not be equal to P(A), i.e., the unconditional probability or absolute probability of A. If P(AB) = P(A), then events A and B are said to be independent: in such a case, knowledge about either event does not alter the likelihood of each other. P(AB) (the conditional probability of A given B) typically differs from P(BA). For example, if a person has dengue fever, the person might have a 90% chance of being tested as positive for the disease. In this case, what is being measured is that if event B (having dengue) has occurred, the probability of A (tested as positive) given that B occurred is 90%, simply writing P(AB) = 90%.

Official source

https://en.wikipedia.org/wiki/Conditional_probability

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related courses (32)

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, disc ...

COM-309: Introduction to quantum information processing

Information is processed in physical devices. In the quantum regime the concept of classical bit is replaced by the quantum bit. We introduce quantum principles, and then quantum communications, key distribution, quantum entropy, and spin dynamics. No prio ...

CH-110: Advanced general chemistry I

Le cours comporte deux parties. Les bases de la thermodynamique des équilibres et de la cinétique des réactions sont introduites dans l'une d'elles. Les premières notions de chimie quantique sur les électrons et les liaisons chimiques, exemplifiées en chim ...

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Official source

https://en.wikipedia.org/wiki/Conditional_probability

About this result

Related courses (32)

CS-101: Advanced information, computation, communication I

COM-309: Introduction to quantum information processing

CH-110: Advanced general chemistry I

Related lectures (32)

Fundamental Limits of Gradient-Based Learning

Delves into the fundamental limits of gradient-based learning on neural networks, covering topics such as binomial theorem, exponential series, and moment-generating functions.

Statistical Significance: Maximum Likelihood Estimation and Confidence Intervals

Explores type I and type II errors, critical values, and confidence intervals in statistical significance.

The Marriage Problem

Explores the marriage problem, modeling the process as a controlled stochastic process with dynamic programming algorithms to find the optimal policy for accepting bachelors.

Related publications (32)

Performance Evaluation of Social Learning

Social Learning is a decentralized decision-making paradigm in which spatially dispersed agents collect streaming observations regulated by one of a finite number of models (the hypotheses). The agents are interested in assigning probability scores (the beliefs) to the possible hypotheses. To this end, the agents exchange their beliefs according to a certain communication graph. It has been shown that, under reasonable conditions on the identifiability of the decision model and the network connectivity, eac

Institute of Electrical and Electronics Engineers (IEEE)2026

Efficient distributional regression trees learning algorithms for calibrated non-parametric probabilistic forecasts

The perspective of developing trustworthy AI for critical applications in science and engineering requires machine learning techniques that are capable of estimating their own uncertainty. In the context of regression, instead of estimating a conditional mean, this can be achieved by producing a predictive interval for the output, or to even learn a model of the conditional probability 𝑝⁡(𝑦|𝑥) of an output y given input features x. While this can be done under parametric assumptions with, e.g. generalized l

American Statistical Association2026

Recursive Causal Discovery (Abstract Reprint)

Causal discovery from observational data, i.e., learning the causal graph from a finite set of samples from the joint distribution of the variables, is often the first step toward the identification and estimation of causal effects, a key requirement in numerous scientific domains. Causal discovery is hampered by two main challenges: limited data results in errors in statistical testing and the computational complexity of the learning task is daunting. This paper builds upon and extends four of our prior pu

Association for the Advancement of Artificial Intelligence (AAAI)2026

Related people (32)

Sébastien Ott

Teaching & PhD Courses Large deviations MATH-533 An introduction to the theory of large deviations, focusing on studying examples and deriving the general theory from the ideas developed in the examples. Probability and statistics (for IC) MATH-232

Hélène Ruffieux

Teaching & PhD Courses Probability and statistics MATH-234(a) This course covers elementary notions of probability and statistics, such as inference, tests, and regression.

Mats Julius Stensrud

Teaching & PhD PhD Students Ignacio Gonzalez Perez, Gellért Géza Perényi, Lorenzo Gasparollo, Julien David Laurendeau Past EPFL PhD Students Matias Janvin, Amit Sawant Courses Causal thinking MATH-352 This course will give a unified presentation of modern methods for causal inference. We focus on concepts, and we will present examples and ideas from various scientific disciplines, including medicine, computer science, engineering, economics and epidemiology. Probability and statistics (

Vivek Subramanian

Teaching & PhD PhD Students Giovanni Ruffolo, Giada Romano, Sanjay Manoharan, Kyle Haas, Claude Dahan, Biruktait Ayele Lemecho, Yagmur Ceren Alatas, Tugçe Delipinar Past EPFL PhD Students Amin Hodaei, Mustafa Mohieldin Fadlelmula Fadlelseed Past EPFL PhD Students as codirector Mohammad Jafarpour Courses Organic and printed electronics MICRO-505 This course addresses the implementation of organic and printed electronics technologies using large area manufacturing techniques. It will provide

Sixuan Sven Wang

Teaching & PhD PhD Students Leonardo Nevali Courses Bayesian statistics MATH-339 A first introduction to Bayesian statistics, assuming knowledge from first courses in statistics and probability. We will focus on foundational statistical and mathematical aspects such as the decision theoretic background, consistency for large sample sizes, and algorithms for Bayesian computation.

Elena Perazzi

Teaching & PhD Courses Advanced derivatives FIN-503 The course covers a wide range of advanced topics in derivatives pricing Game theory and strategic decisions MGT-300 Game theory studies the strategic interactions between rational agents. It has a myriad of applications in politics, business, sports. A special branch of Game Theory, Auction Theory, has recently guided the development of Ebay, Google advertising auctions, and of the Wireless spectrum auctions. Probabili

Hervé Bourlard

Teaching & PhD Past EPFL PhD Students Astrid Hagen, Katrin Weber, Todd Stephenson, Jitendra Ajmera, Shajith Ikbal, Mathew Magimai Doss, Mohamed Faouzi Benzeghiba, Mark Barnard, Yann Rodriguez, Hemant Misra, Christos Dimitrakakis, Guillaume Lathoud, Alexei Pozdnoukhov, Agnès Just, Mikaela Keller, Norman Hoon Thian Poh, Dong Zhang, Florent Monay Michaud, Pedro Manuel Da Silva Quelhas, Kevin Smith, Silèye Oumar Ba, Bertrand Mesot, Hamed Ketabdar, David Grangier, Guillermo Aradilla, Jean-François Paiement, Nico

Pascal Fua

Pascal Fua received an engineering degree from Ecole Polytechnique, Paris, in 1984 and the Ph.D. degree in Computer Science from the University of Orsay in 1989. He then worked at SRI International and INRIA Sophia-Antipolis as a Computer Scientist. He joined EPFL in 1996 where he is now a Professor in the School of Computer and Communication Science and heads the Computer Vision Laboratory. His research interests include shape modeling and motion recovery from images, analysis of microscopy images, and Augmented Reality. His research interests include shape modeling and motion recovery from images, analysis of microscopy images, and machine learning. He has (co)authored over 300 publications in refereed journals and conferences. He is an IEEE Fellow and has been an Associate Editor of IEEE journal Transactions for Pattern Analysis and Machine Intelligence. He often serves as program committee member, area chair, and program chair of major vision conferences and has cofounded three spinoff companies (Pix4D, PlayfulVision, and NeuralConcept).

François Fleuret

Samy Bengio

Expertise Large Language ModelsReasoningStatistical machine learningSpeech processingPerson authenticationMultimodal processingSequence processingArtificial neural networks, support vector machinesHidden markov models, gaussian mixture modelsetc Expertise Large Language ModelsReasoningStatistical machine learningSpeech processingPerson authenticationMultimodal processingSequence processingArtificial neural networks, support vector machinesHidden markov models, gaussian mixture modelsetc Mission Samy Bengio

Related units (12)

Transportation and Mobility Laboratory

TRACE - Administration

Distributed Computing Laboratory

Related concepts (18)

Conditioning (probability)

Beliefs depend on the available information. This idea is formalized in probability theory by conditioning. Conditional probabilities, conditional expectations, and conditional probability distributions are treated on three levels: discrete probabilities, probability density functions, and measure theory. Conditioning leads to a non-random result if the condition is completely specified; otherwise, if the condition is left random, the result of conditioning is also random.

Conditional probability distribution

In probability theory and statistics, given two jointly distributed random variables and , the conditional probability distribution of given is the probability distribution of when is known to be a particular value; in some cases the conditional probabilities may be expressed as functions containing the unspecified value of as a parameter. When both and are categorical variables, a conditional probability table is typically used to represent the conditional probability.

Bayesian epistemology

Bayesian epistemology is a formal approach to various topics in epistemology that has its roots in Thomas Bayes' work in the field of probability theory. One advantage of its formal method in contrast to traditional epistemology is that its concepts and theorems can be defined with a high degree of precision. It is based on the idea that beliefs can be interpreted as subjective probabilities. As such, they are subject to the laws of probability theory, which act as the norms of rationality.

Related notebooks (3)

Basic Example of Anderson Localization in a 1D System

Demonstration of Anderson localization[1]¶ This notebook is intended to show a very basic example of the Anderson localization in one-dimensional system. In [1]: import numpy as np from numpy import linalg as LA import matplotlib.pyplot as plt

from future import print_function

from ipywidgets import interact, interactive, fixed, interact_manual import ipywidgets as widgets %matplotlib inline To show the idea of Anderson localization, we can consider 1D chain of

N

atoms with perio

Building a Dual-Tone Multi-Frequency (DTMF) Decoder using Short-Time Fourier Transform

Dual-tone multi-frequency (DTMF) signaling[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

In this notebook we will build a dual-tone multi-frequency decoder based on the short-time Fourier transform. In [1]:

first our usual bookkeeping

%matplotlib inline import matplotlib import matplotlib.pyplot as plt import numpy as np import IPython In [2]: plt.rcParams["figure.figsize"] = (14,4)

Introduction[4]¶ DTMF signaling is the way analog phones send the n

Voice Transformation Techniques Using Digital Signal Processing

A Gallery of Voice Transformers[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

In this notebook we will explore various ways to implement a system that changes the voice of a speaker. Typical applications for these techniques, strictly sorted by plausibility, include international spy missions and prank telephone calls, and devices such as the one displayed here can be easily bought on the web... or in a novelty shop. No description has been provided for t