Frequentism vs. Baysian statistics

Since the 18th century, there has been a debate between frequentists and Bayesians. The former insisted that statistical procedures only made sense when one uses the relative frequency concept. The Bayesians supported the use of degrees of belief as a basis for statistical practice.

The frequentist position is the one you probably heard at school: perform an experiment lots of times, and measure the proportion where you get a positive result - this proportion, if you perform the experiment enough times, is the probability.

The problem comes in those cases where we haven't performed an experiment yet, or where there's no possible way an experiment could be performed - in these cases, frequentism can't help us.

-- http://en.wikipedia.org/wiki/Frequentist



Bayesianism is the philosophical tenet that the mathematical theory of probability applies to the degree of plausibility of a statement. This also applies to the degree of believability contained within the rational agents of a truth statement. Additionally, when a statement is used with the Bayes theorem, it then becomes a Bayesian inference.

This is in contrast to frequentism, which rejects degree-of-belief interpretations of mathematical probability, and assigns probabilities only to random events according to their relative frequencies of occurrence. The Bayesian interpretation of probability allows probabilities to be assigned to random events, but also allows the assignment of probabilities to any other kind of statement.

-- http://en.wikipedia.org/wiki/Bayesian_probability

Trackback URL:
http://twoday.tuwien.ac.at/mjae/stories/8155/modTrackback

logo

Manuel's Weblog

User Status

Du bist nicht angemeldet.

Suche

 

Archiv

Juni 2005
Mo
Di
Mi
Do
Fr
Sa
So
 
 
 1 
 2 
 4 
 5 
 6 
 7 
 8 
 9 
11
12
13
14
15
16
18
19
20
21
22
23
24
25
26
27
28
29
30
 
 
 
 

Aktuelle Beiträge

Singular values and eigenvalues.
Eigenvalues and Singular Valueshttp://www.mathworks.com/moler/eigs.pdf Values
e0126312 - 27. Apr, 11:39
Approximationsalgorithmen
Erklärung FPTAS für das Rucksackproblemhttp://www-i1.informatik.rwth-aachen.de/Lehre/VBuK0506/Folien/komplexitaet3.pdf...
e0126312 - 3. Apr, 12:41
Zeugs ...
P = NPhttp://kryten.mm.rpi.edu/scb_pnp_solved21.pdf...
e0126312 - 24. Mär, 13:03
Web calendar
http://www.planscalendar.com/
e0126312 - 5. Dez, 16:49
Graphs ...
An Efficient Search Algorithm to Find the Elementary...
e0126312 - 11. Okt, 14:39

Status

Online seit 1973 Tagen
Zuletzt aktualisiert: 27. Apr, 11:39

Credits

twoday.org

based on antville powered by Helma


  • xml version of this page