Probabilities and Probabilistic Models



Similar documents
PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

What is Candidate Sampling

Recurrence. 1 Definitions and main statements

The OC Curve of Attribute Acceptance Plans

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

STATISTICAL DATA ANALYSIS IN EXCEL

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification

DEFINING %COMPLETE IN MICROSOFT PROJECT

Extending Probabilistic Dynamic Epistemic Logic

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

Logistic Regression. Steve Kroon

CS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements

Probabilistic Linear Classifier: Logistic Regression. CS534-Machine Learning

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Evaluating credit risk models: A critique and a new proposal

Latent Class Regression. Statistics for Psychosocial Research II: Structural Models December 4 and 6, 2006

SIMPLE LINEAR CORRELATION

Calculation of Sampling Weights

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

We are now ready to answer the question: What are the possible cardinalities for finite fields?

Risk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008

ANALYSIS OF A CIRCULAR CODE MODEL

GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 -NORM

Hallucinating Multiple Occluded CCTV Face Images of Different Resolutions

Prediction of Disability Frequencies in Life Insurance

How To Find The Dsablty Frequency Of A Clam

Lecture 2 Sequence Alignment. Burr Settles IBS Summer Research Program 2008 bsettles@cs.wisc.edu

MARKET SHARE CONSTRAINTS AND THE LOSS FUNCTION IN CHOICE BASED CONJOINT ANALYSIS

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES

Data Visualization by Pairwise Distortion Minimization

Power law distribution of dividends in horse races

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)

CHAPTER 14 MORE ABOUT REGRESSION

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek

Applied Research Laboratory. Decision Theory and Receiver Design

Optimal Bidding Strategies for Generation Companies in a Day-Ahead Electricity Market with Risk Management Taken into Account

Implementation of Deutsch's Algorithm Using Mathcad

An Alternative Way to Measure Private Equity Performance

Fault tolerance in cloud technologies presented as a service

Exhaustive Regression. An Exploration of Regression-Based Data Mining Techniques Using Super Computation

Testing The Torah Code Hypothesis: The Experimental Protocol

Chapter 7: Answers to Questions and Problems

Rapid Estimation Method for Data Capacity and Spectrum Efficiency in Cellular Networks

Approximating Cross-validatory Predictive Evaluation in Bayesian Latent Variables Models with Integrated IS and WAIC

How To Evaluate A Dia Fund Suffcency

Lecture 2: Single Layer Perceptrons Kevin Swingler

Generalizing the degree sequence problem

Daily O-D Matrix Estimation using Cellular Probe Data

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol

Quantization Effects in Digital Filters

FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES

Brigid Mullany, Ph.D University of North Carolina, Charlotte

Statistical Methods to Develop Rating Models

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy

1.1 The University may award Higher Doctorate degrees as specified from time-to-time in UPR AS11 1.

Support Vector Machines

Fragility Based Rehabilitation Decision Analysis

A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña

Stochastic Protocol Modeling for Anomaly Based Network Intrusion Detection

A multiple objective test assembly approach for exposure control problems in Computerized Adaptive Testing

Classification errors and permanent disability benefits in Spain

Tracking with Non-Linear Dynamic Models

Efficient Project Portfolio as a tool for Enterprise Risk Management

Title Language Model for Information Retrieval

Time Delayed Independent Component Analysis for Data Quality Monitoring

Estimation of Dispersion Parameters in GLMs with and without Random Effects

1 De nitions and Censoring

Number of Levels Cumulative Annual operating Income per year construction costs costs ($) ($) ($) 1 600,000 35, , ,200,000 60, ,000

MAC Layer Service Time Distribution of a Fixed Priority Real Time Scheduler over

"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *

Portfolio Loss Distribution

Generalized Linear Models for Traffic Annuity Claims, with Application to Claims Reserving

BERNSTEIN POLYNOMIALS

Evaluating the generalizability of an RCT using electronic health records data

The Current Employment Statistics (CES) survey,

Adaptive Clinical Trials Incorporating Treatment Selection and Evaluation: Methodology and Applications in Multiple Sclerosis

Single and multiple stage classifiers implementing logistic discrimination

Traffic-light a stress test for life insurance provisions

A Probabilistic Theory of Coherence

Using Supervised Clustering Technique to Classify Received Messages in 137 Call Center of Tehran City Council

RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST)

Hidden Markov Models: Fundamentals and Applications Part 1: Markov Chains and Mixture Models

Staff Paper. Farm Savings Accounts: Examining Income Variability, Eligibility, and Benefits. Brent Gloy, Eddy LaDue, and Charles Cuykendall

Optimal Pricing Using Online Auction Experiments: A Polya Tree Approach. Edward I. George. Sam K. Hui* First Submission: September, 2009

Modelling high-dimensional data by mixtures of factor analyzers

Chapter XX More advanced approaches to the analysis of survey data. Gad Nathan Hebrew University Jerusalem, Israel. Abstract

Searching for Interacting Features for Spam Filtering

Underwriting Risk. Glenn Meyers. Insurance Services Office, Inc.

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

Planning for Marketing Campaigns

Cost-of-Capital Margin for a General Insurance Liability Runoff

A Model of Private Equity Fund Compensation

Bag-of-Words models. Lecture 9. Slides from: S. Lazebnik, A. Torralba, L. Fei-Fei, D. Lowe, C. Szurka

Psicológica Universidad de Valencia ISSN (Versión impresa): ISSN (Versión en línea): ESPAÑA

Mixtures of Factor Analyzers with Common Factor Loadings for the Clustering and Visualisation of High-Dimensional Data

Estimating Correlated Jumps and Stochastic Volatilities

Transcription:

Probabltes and Probablstc Models

Probablstc models A model means a system that smulates an obect under consderaton. A probablstc model s a model that produces dfferent outcomes wth dfferent probabltes t can smulate a whole class of obects, assgnng each an assocated probablty. In bonformatcs, the obects usually are DNA or proten sequences and a model mght descrbe a famly of related sequences.

Eamples 1. The roll of a s-sded dce s parameters p 1, p 2,, p 6, where p s the probablty of rollng the number. For probabltes, p > 0 and p 2. Three rolls of a dce: the model mght be that the rolls are ndependent, so that the probablty of a sequence such as [2, 4, 6] would be p 2 p 4 p 6. 3. An etremely smple model of any DNA or proten sequence s a strng over a 4 (nucleotde) or 20 (amno acd) letter alphabet. Let q a denote the probablty, that resdue a occurs at a gven poston, at random, ndependent of all other resdues n the sequence. Then, for a gven length n, the probablty of the sequence 1, 2,, n s n P (,, q 1 1 n ) 1

Condtonal, ont, and margnal probabltes two dce D 1 and D 2. For = 1,2, assume that the probablty of usng de D s P(D ), and for = 1,2,, 6, and the probablty of rollng an wth dce D s ( ). PD In ths smple two dce model, the condtonal probablty of rollng an wth dce D s: P ( D ) PD ( ). The ont probablty of pckng de D and rollng an s: The probablty of rollng margnal probablty P ( ) 2 1 P (, D ) P ( D ) P ( D ). P (, D ) 2 1 P ( D ) P ( D )

Mamum lkelhood estmaton (mamálne verohodný odhad) Probablstc models have parameters that are usually estmated from large sets of trusted eamples, called a tranng set. For eample, the probablty q a for seeng amno acd a n a proten sequence can be estmated as the observed frequency f a of a n a database of known proten sequences, such as SWISS-PROT. Ths way of estmatng models s called Mamum lkelhood estmaton, because t can be shown that usng the observed frequences mamzes the total probablty of the tranng set, gven the model. In general, gven a model wth parameters and a set of data D, the mamum lkelhood estmate (MLE) for s the value whch mamzes P (D ).

Model comparson problem An occasonally dshonest casno uses two knds of dce, of whch 99% are far, but 1% are loaded, so that a 6 appears 50% of the tme. We pck up a dce and roll [6, 6, 6]. Ths looks lke a loaded dce, s t? Ths s an eample of a model comparson problem. I.e., our hypothess D loaded s that the dce s loaded. The other alternatve s D far. Whch model fts the observed data better? We want to calculate: P (D loaded [6, 6, 6])

Pror and posteror probablty P (D loaded [6, 6, 6]) s the posteror probablty that the dce s loaded, gven the observed data. Note that the pror probablty of ths hypothess s 1/100 pror because t s our best guess about the dce before havng seen any nformaton about the t. The lkelhood of the hypothess D loaded : P ([ 6,6,6] Dloaded) Posteror probablty usng Bayes theorem Aposterórna pravdepodobnosť P ( X Y ) aprórna pravdepodobnosť 1 2 1 2 P ( Y X ) P ( X ) P ( Y ) 1 2 1 8

Comparng models usng Bayes theorem We set X = D loaded and Y = [6,6,6], thus obtanng The probablty P (D loaded ) of pckng a loaded de s 0.01. The probablty P ([6, 6, 6] D loaded ) of rollng three ses usng a loaded de s 0.5 3 = 0.125. The total probablty P ([6, 6, 6]) of three ses s Now, P P ([6, 6, 6] D loaded ) P (D loaded ) + P ([6, 6, 6] D far ) P (D far ). P Thus, the de s probably far. D loaded 6,6,6 P 6,6,6 Dloaded P D loaded P 6,6,6 3 0.5 0.01 D loaded 6,6,6 3 3 1 0.5 0.01 0.99 6 0.214

Bologcal eample Lets assume that etracellular (et ) protens have a slghtly dfferent composton than ntercellular (nt ) ones. We want to use ths to udge whether a new proten sequence 1,, n s et or nt. To obtan tranng data, classfy all protens n SWISS-PROT nto et, nt and unclassfable ones. et f a nt f a Determne the frequences and of each amno acd a n et and nt protens, respectvely. To be able to apply Bayes theorem, we need to determne the prors p nt and p et,.e. the probablty that a new (uneamned) sequence s etracellular or ntercellular, respectvely.

Bologcal eample - cont. et We have: P ( et ) q and n 1 P ( nt ) n 1 q nt If we assume that any sequence s ether etracellular or ntercellular, then we have P ( ) = p et P ( et ) + p nt P ( nt ). By Bayes theorem, we obtan P ( et ) P ( et ) P ( et ) P ( ) the posteror probablty that a sequence s etracellular. (In realty, many transmembrane protens have both ntraand etracellular components and more comple models such as HMMs are approprate.) p et p et q et q p et nt q nt

Probablty vs. lkelhood pravdepodobnosť vs. verohodnosť If we consder P ( X Y ) as a functon of X, then ths s called a probablty. If we consder P ( X Y ) as a functon of Y, then ths s called a lkelhood.