Sunday, 21 September 2014

Probability Theory Problems

Let's have fun on probability theory, here is my first problem set in the said subject.

Problems

  1. It was noted that statisticians who follow the deFinetti school do not accept the Axiom of Countable Additivity, instead adhering to the Axiom of Finite Additivity.
    1. Show that the Axiom of Countable Additivity implies Finite Additivity.
    2. Although, by itself, the Axiom of Finite Additivity does not imply Countable Additivity, suppose we supplement it with the following. Let $A_1\supset A_2\supset\cdots\supset A_n\supset \cdots$ be an infinite sequence of nested sets whose limit is the empty set, which we denote by $A_n\downarrow\emptyset$. Consider the following:

      Axiom of Continuity: If $A_n\downarrow\emptyset$, then $P(A_n)\rightarrow 0$

      Prove that the Axiom of Continuity and the Axiom of Finite Additivity imply Countable Additivity.
  2. Prove each of the following statements. (Assume that any conditioning event has positive probability.)
    1. If $P(B)=1$, then $P(A|B)=P(A)$ for any $A$.
    2. If $A\subset B$, then $P(B|A)=1$ and $P(A|B)=P(A)/P(B)$.
    3. If $A$ and $B$ are mutually exclusive, then \begin{equation}\nonumber P(A|A\cup B) = \displaystyle\frac{P(A)}{P(A)+P(B)}. \end{equation}
    4. $P(A\cap B\cap C)=P(A|B\cap C)P(B|C)P(C)$.

Friday, 12 September 2014

R: k-Means Clustering on an Image

Enough with the theory we recently published, let's take a break and have fun on the application of Statistics used in Data Mining and Machine Learning, the k-Means Clustering.
k-means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster. (Wikipedia, Ref 1.)
We will apply this method to an image, wherein we group the pixels into k different clusters. Below is the image that we are going to use,
Colorful Bird From Wall321
We will utilize the following packages for input and output:
  1. jpeg - Read and write JPEG images; and,
  2. ggplot2 - An implementation of the Grammar of Graphics.

Monday, 8 September 2014

Lebesgue Measure and Outer Measure Problems

More proving, still on Real Analysis. This is my solution and if you find any errors, do let me know.

Problems

Lebesgue Measure: Let $\mu$ be set function defined for all set in $\sigma$-algebra $\mathscr{F}$ with values in $[0,\infty]$. Assume $\mu$ is countably additive over countable disjoint collections of sets in $\mathscr{F}$.
  1. Prove that if $A$ and $B$ are two sets in $\mathscr{F}$, with $A\subseteq B$, then $\mu(A)\leq \mu(B)$. This property is called monotonicity.
  2. Prove that if there is a set $A$ in the collection $\mathscr{F}$ for which $\mu(A)<\infty$, then $\mu(\emptyset)=0$.
  3. Let $\{E_{k}\}_{k=1}^{\infty}$ be a countable collection of sets in $\mathscr{F}$. Prove that $\mu\left(\displaystyle\bigcup_{k=1}^{\infty}E_{k}\right)\leq \displaystyle\sum_{k=1}^{\infty}\mu(E_k)$
Lebesgue Outer Measure:
  1. By using property of outer measure, prove that the interval $[0,1]$ is not countable.
  2. Let $A$ be the set of irrational numbers in the interval $[0,1]$. Prove that $\mu^{*}(A)=1$.
  3. Let $B$ be the set of rational numbers in the interval $[0,1]$, and let $\{I_k\}_{k=1}^{n}$ be finite collection of open intervals that covers $B$. Prove that $\displaystyle\sum_{k=1}^{n}\mu^{*}(I_k)\geq 1$.
  4. Prove that if $\mu^{*}(A)=0$, then $\mu^{*}(A\cup B)=\mu^{*}(B).$

Fork me on GitHub