Lecture 10: Probability Theory Flashcards

1
Q

What is Probability?

A

These are statements about outcomes which are possible but may not be guaranteed.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How can probabilities be expressed?

A

Through:

  • fractions
  • ratios
  • percentages
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Why is probability important?

A
  1. Allows us to reason about a computer sustems reliability
    1. What is the likelohood of a critical component failing?
    2. where should we build in redundancy?
  2. Helps describe a network server availability
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

List other examples were probability theory is used

A
  • data mining
  • pattern recognition
  • encryption
  • tracking
  • robotics
  • IS
  • data compression
  • Bayesian networks
  • automatic classifciation
  • information fusion
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

what are other factors of probability?

A
  1. Can be considered as “relative frequency”
  2. usually expressed as real numbers ranging between zero and one
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

what does the term experiement mean?

A

It is a process which generates data

  1. a single performance of the experiment is call atrial
  2. each trial has an outcome
  3. e.g. tossing a coin
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What does the term sample space mean?

A

The set of all possible outcomes

  • e.g single coin tose (h, t)
  • e.g2. coin tossed twice (hh, ht etc…)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What does the term event mean?

A

A subset of the sample space

  • the outcome with particular characteristics
  • e.g. getting the same result in two coin tosses (HH,TT)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Describe discrete probability.

A

considers only experiments for which the sample space contains a finite number of elements or a countably infinite number of elements.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is a probability density function?

A

assigns probabilities to all of the elements in the sample space

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Explain Uniform probabilities. (uniform probability density functions)

A

If a sample space contains N elements, all of which are likely to occur, then probability assigned to each are 1/N.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What does it mean by “Counting sample points”?

A

some problems need to be solved by specifically counting the number of elements in a set or subset, without actually listing each element

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

list the 7 basic counting strategies.

A
  1. addition principle
  2. subtraction principle
  3. pigeon-hole principle
  4. complementation
  5. combinations
  6. permutations of distinct objects
  7. permutations of repeated objects
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Addition.

A

suppose one element is to be selected from a collection of disjoint or mutually exclusive sets A1, A2…An

then the total amount of possible choices is given by A1 + A2 + An…

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What does it mean to be mutually exclusive set?

A

to have no elements in common

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Multiplication

A

a process can be performed in a sequence of m distinct steps.

total outcomes: n = n1 x n2…..x Nm

17
Q

permutations of distinct objects

A

When the order DOES MATTER in a counting problem

a permutation is a selection (without replacement), of items from a set, where the order of selection is important.

18
Q

What is a circular permutation of distinct objects

A
  • where items are aranged in a circle.
  • There are no ends to the arrangements
  • 2 arrangements can be similar if one can be transformed into another by a clockwise rotation of elements
  • e.g. abc = cba (same circular permutation)
19
Q

Combination

A

order DOES NOT MATTER

combination is an unordered selection of items in a set

20
Q

Complementation

A

it may be easier calculation the number of sample points which do not have a particular characteristic

Complementary sets - a set which have a required characteristic and a set which dosent.

21
Q

Pigeon-hole principle

A
  • If m objects are to be placed in n locations and m > n > 0, then at least one location must receive two objects.
  • IN counting context: if the total number of elements in a set, is larger then the total number of distinct properties, then at least 2 of the elements have the same property.
  • e.g 15000 customers, 1000 PINS, 2 have the same
22
Q

Joint probabilities

A

two or more events may include the same elements of the sample space

e.g. the characteristics defining the two events may be found in the sample space

23
Q

Conditional Probabilities

A

Involves calculating the probability of an event when it is known that some other event has occurred.

e.g. A1 occurrence may depend on the occurrence of event A2

24
Q

Independent Events

A

two events are independent if the probability of one, event is not affected by the occurrence of the other event

25
Q

Binomial Distribution

A

occurs when

  • repeated trials are independent
  • probability of success is constant then, experiment is binomal

some experiments consist of repeated trials, where each trial has only two possible outcomes:

  • heads or tails
  • 0 or 1
  • working or defective
  • success or failure
26
Q

Summarise. 5 main points to remember.

A
  • Probability can be considered as the relative frequency of occurrence of an event
  • The probability of an event is a value between 0 to
  • The probabilities for all of the points in the sample space sum to 1
  • To calculate the probability of an event you may need to:
    • Count sample points
    • Decide if events are conditional or independent
  • The binomial distribution is useful for calculating probabilities of events associated with a particular type of experiment