In probability theory and information theory, the variation of information or shared information distance is a measure of the distance between two clusterings (partitions of elements). It is closely related to mutual information; indeed, it is a simple linear expression involving the mutual information. Unlike the mutual information, however, the variation of information is a true metric, in that it obeys the triangle inequality.
Definition Suppose we have two partitions X {\displaystyle X} and Y {\displaystyle Y} of a set A {\displaystyle A} , namely X = { X 1 , X 2 , … , X k } {\displaystyle X=\{X_{1},X_{2},\ldots ,X_{k}\}} and Y = { Y 1 , Y 2 , … , Y l } {\displaystyle Y=\{Y_{1},Y_{2},\ldots ,Y_{l}\}} . Let:
n = ∑ i | X i | = ∑ j | Y j | = | A | {\displaystyle n=\sum _{i}|X_{i}|=\sum _{j}|Y_{j}|=|A|}
p i = | X i | / n {\displaystyle p_{i}=|X_{i}|/n} and q j = | Y j | / n {\displaystyle q_{j}=|Y_{j}|/n}
r i j = | X i ∩ Y j | / n {\displaystyle r_{ij}=|X_{i}\cap Y_{j}|/n}
Then the variation of information between the two partitions is:
V I ( X ; Y ) = − ∑ i , j r i j [ log ( r i j / p i ) + log ( r i j / q j ) ] {\displaystyle \mathrm {VI} (X;Y)=-\sum _{i,j}r_{ij}\left[\log(r_{ij}/p_{i})+\log(r_{ij}/q_{j})\right]} . This is equivalent to the shared information distance between the random variables i and j with respect to the uniform probability measure on A {\displaystyle A} defined by μ ( B ) := | B | / n {\displaystyle \mu (B):=|B|/n} for B ⊆ A {\displaystyle B\subseteq A} .
… excerpt ends here. Continue reading the full article.


