mirror of
https://github.com/Brandon-Rozek/website.git
synced 2024-12-24 00:42:40 +00:00
303 lines
27 KiB
HTML
303 lines
27 KiB
HTML
|
<!DOCTYPE html>
|
|||
|
|
<html>
|
|||
|
|
<head>
|
|||
|
|
<meta charset="utf-8" />
|
|||
|
|
<meta name="author" content="Fredrik Danielsson, http://lostkeys.se">
|
|||
|
|
<meta name="viewport" content="width=device-width, initial-scale=1.0">
|
|||
|
|
<meta name="robots" content="noindex" />
|
|||
|
|
<title>Brandon Rozek</title>
|
|||
|
|
<link rel="stylesheet" href="themes/bitsandpieces/styles/main.css" type="text/css" />
|
|||
|
|
<link rel="stylesheet" href="themes/bitsandpieces/styles/highlightjs-github.css" type="text/css" />
|
|||
|
|
</head>
|
|||
|
|
<body>
|
|||
|
|
|
|||
|
|
<aside class="main-nav">
|
|||
|
|
<nav>
|
|||
|
|
<ul>
|
|||
|
|
<li class="menuitem ">
|
|||
|
|
<a href="index.html%3Findex.html" data-shortcut="">
|
|||
|
|
Home
|
|||
|
|
</a>
|
|||
|
|
</li>
|
|||
|
|
<li class="menuitem ">
|
|||
|
|
<a href="index.html%3Fcourses.html" data-shortcut="">
|
|||
|
|
Courses
|
|||
|
|
</a>
|
|||
|
|
</li>
|
|||
|
|
<li class="menuitem ">
|
|||
|
|
<a href="index.html%3Flabaide.html" data-shortcut="">
|
|||
|
|
Lab Aide
|
|||
|
|
</a>
|
|||
|
|
</li>
|
|||
|
|
<li class="menuitem ">
|
|||
|
|
<a href="index.html%3Fpresentations.html" data-shortcut="">
|
|||
|
|
Presentations
|
|||
|
|
</a>
|
|||
|
|
</li>
|
|||
|
|
<li class="menuitem ">
|
|||
|
|
<a href="index.html%3Fresearch.html" data-shortcut="">
|
|||
|
|
Research
|
|||
|
|
</a>
|
|||
|
|
</li>
|
|||
|
|
<li class="menuitem ">
|
|||
|
|
<a href="index.html%3Ftranscript.html" data-shortcut="">
|
|||
|
|
Transcript
|
|||
|
|
</a>
|
|||
|
|
</li>
|
|||
|
|
</ul>
|
|||
|
|
</nav>
|
|||
|
|
</aside>
|
|||
|
|
<main class="main-content">
|
|||
|
|
<article class="article">
|
|||
|
|
<h1>Measures of similarity</h1>
|
|||
|
|
<p>To identify clusters of observations we need to know how <strong>close individuals are to each other</strong> or <strong>how far apart they are</strong>.</p>
|
|||
|
|
<p>Two individuals are 'close' when their dissimilarity of distance is small and their similarity large.</p>
|
|||
|
|
<p>Special attention will be paid to proximity measures suitable for data consisting of repeated measures of the same variable, for example taken at different time points.</p>
|
|||
|
|
<h2>Similarity Measures for Categorical Data</h2>
|
|||
|
|
<p>Measures are generally scaled to be in the interval $[0, 1]$, although occasionally they are expressed as percentages in the range $0-100\%$</p>
|
|||
|
|
<p>Similarity value of unity indicates that both observations have identical values for all variables</p>
|
|||
|
|
<p>Similarity value of zero indicates that the two individuals differ maximally for all variables.</p>
|
|||
|
|
<h3>Similarity Measures for Binary Data</h3>
|
|||
|
|
<p>An extensive list of similarity measures for binary data exist, the reason for such is that a large number of possible measures has to do with the apparent uncertainty as to how to <strong>deal with the count of zero-zero matches</strong></p>
|
|||
|
|
<p>In some cases, zero-zero matches are equivalent to one-one matches and therefore should be included in the calculated similarity measure</p>
|
|||
|
|
<p><u>Example</u>: Gender, where there is no preference as to which of the two categories should be coded as zero or one</p>
|
|||
|
|
<p>In other cases the inclusion or otherwise of the matches is more problematic</p>
|
|||
|
|
<p><u>Example</u>: When the zero category corresponds to the genuine absence of some property, such as wings in a study of insects</p>
|
|||
|
|
<p>The question that then needs to be asked is do the co-absences contain useful information about the similarity of the two objects?</p>
|
|||
|
|
<p>Attributing a high degree of similarity to a pair of individuals simply because they both lack a large number of attributes may not be sensible in many situations </p>
|
|||
|
|
<p>The following table below will help when it comes to interpreting the measures</p>
|
|||
|
|
<p><img src="file:///home/rozek/Documents/Spring2018/Cluster%20Analysis/BinaryOutcomeTable.png?lastModify=1516246712" alt="img" /></p>
|
|||
|
|
<p>Measure that ignore the co-absence (lack of both objects having a zero) are Jaccard's Coefficient (S2), Sneath and Sokal (S4)</p>
|
|||
|
|
<p>When co-absences are considered informative, the simple matching coefficient (S1) is usually employed.</p>
|
|||
|
|
<p>Measures S3 and S5 are further examples of symmetric coefficients that treat positive matches (a) and negative matches (d) in the same way. </p>
|
|||
|
|
<p></p>
|
|||
|
|
<h3>Similarity Measures for Categorical Data with More Than Two Levels</h3>
|
|||
|
|
<p>Categorical data where the variables have more than two levels (for example, eye color) could be dealt with in a similar way to binary data, with each level of a variable being regarded as a single binary variable. </p>
|
|||
|
|
<p>This is not an attractive approach, however, simply because of the large number of ‘negative’ matches which will inevitably be involved. </p>
|
|||
|
|
<p>A superior method is to allocate a score of zero or one to each variable depending on whether the two observations are the same on that variable. These scores are then averaged over all p variables to give the required similarity coefficient as
|
|||
|
|
$$
|
|||
|
|
s<em>{ij} = \frac{1}{p}\sum</em>{k = 1}^p{s_{ik}}
|
|||
|
|
$$</p>
|
|||
|
|
<h3>Dissimilarity and Distance Measures for Continuous Data</h3>
|
|||
|
|
<p>A <strong>metric</strong> on a set $X$ is a distance function
|
|||
|
|
$$
|
|||
|
|
d : X \times X \to [0, \infty)
|
|||
|
|
$$
|
|||
|
|
where $[0, \infty)$ is the set of non-negative real numbers and for all $x, y, z \in X$, the following conditions are satisfied</p>
|
|||
|
|
<ol>
|
|||
|
|
<li>$d(x, y) \ge 0$ non-negativity or separation axiom
|
|||
|
|
<ol>
|
|||
|
|
<li>$d(x, y) = 0 \iff x = y$ identity of indiscernibles</li>
|
|||
|
|
</ol></li>
|
|||
|
|
<li>$d(x, y) = d(y, x)$ symmetry</li>
|
|||
|
|
<li>$d(x, z) \le d(x, y) + d(y, z)$ subadditivity or triangle inequality</li>
|
|||
|
|
</ol>
|
|||
|
|
<p>Conditions 1 and 2 define a positive-definite function</p>
|
|||
|
|
<p>All distance measures are formulated so as to allow for differential weighting of the quantitative variables $w_k$ denotes the nonnegative weights of $p$ variables</p>
|
|||
|
|
<p></p>
|
|||
|
|
<p>Proposed dissimilarity measures can be broadly divided into distance measures and correlation-type measures.</p>
|
|||
|
|
<h4>Distance Measures</h4>
|
|||
|
|
<h5>$L^p$ Space</h5>
|
|||
|
|
<p>The Minkowski distance is a metric in normed vector space which can be considered as a generalization of both the Euclidean distance and the Manhattan distance
|
|||
|
|
$$
|
|||
|
|
D(X, Y) = (\sum_{i = 1}^n{w_i^p|x_i - y_i|^p})^{\frac{1}{p}}
|
|||
|
|
$$
|
|||
|
|
This is a metric for $p > 1$</p>
|
|||
|
|
<h6>Manhattan Distance</h6>
|
|||
|
|
<p>This is the case in the Minkowski distance when $p = 1$
|
|||
|
|
$$
|
|||
|
|
d(X, Y) = \sum_{i = 1}^n{w_i|x_i - y_i|}
|
|||
|
|
$$
|
|||
|
|
Manhattan distance depends on the rotation of the coordinate system, but does not depend on its reflection about a coordinate axis or its translation
|
|||
|
|
$$
|
|||
|
|
d(x, y) = d(-x, -y)
|
|||
|
|
$$</p>
|
|||
|
|
<p>$$
|
|||
|
|
d(x, y) = d(x + a, y + a)
|
|||
|
|
$$</p>
|
|||
|
|
<p>Shortest paths are not unique in this metric</p>
|
|||
|
|
<h6>Euclidean Distance</h6>
|
|||
|
|
<p>This is the case in the Minkowski distance when $p = 2$. The Euclidean distance between points X and Y is the length of the line segment connection them.
|
|||
|
|
$$
|
|||
|
|
d(X, Y) = \sqrt{\sum_{i = 1}^n{w_i^2(x_i - y_i)^2}}
|
|||
|
|
$$
|
|||
|
|
There is a unique path in which it has the shortest distance. This distance metric is also translation and rotation invariant</p>
|
|||
|
|
<h6>Squared Euclidean Distance</h6>
|
|||
|
|
<p>The standard Euclidean distance can be squared in order to place progressively greater weight on objects that are farther apart. In this case, the equation becomes
|
|||
|
|
$$
|
|||
|
|
d(X, Y) = \sum_{i = 1}^n{w_i^2(x_i - y_i)^2}
|
|||
|
|
$$
|
|||
|
|
Squared Euclidean Distance is not a metric as it does not satisfy the <a href="https://en.wikipedia.org/wiki/Triangle_inequality">triangle inequality</a>, however, it is frequently used in optimization problems in which distances only have to be compared.</p>
|
|||
|
|
<h6>Chebyshev Distance</h6>
|
|||
|
|
<p>The Chebyshev distance is where the distance between two vectors is the greatest of their differences along any coordinate dimension.</p>
|
|||
|
|
<p>It is also known as <strong>chessboard distance</strong>, since in the game of <a href="https://en.wikipedia.org/wiki/Chess">chess</a> the minimum number of moves needed by a <a href="https://en.wikipedia.org/wiki/King_(chess)">king</a> to go from one square on a <a href="https://en.wikipedia.org/wiki/Chessboard">chessboard</a> to another equals the Chebyshev distance
|
|||
|
|
$$
|
|||
|
|
d(X, Y) = \lim<em>{p \to \infty}{(\sum</em>{i = 1}^n{|x_i - y_i|^p})}^\frac{1}{p}
|
|||
|
|
$$</p>
|
|||
|
|
<p>$$
|
|||
|
|
= max_i(|x_i - y_i|)
|
|||
|
|
$$</p>
|
|||
|
|
<p>Chebyshev distance is translation invariant</p>
|
|||
|
|
<h5>Canberra Distance Measure</h5>
|
|||
|
|
<p>The Canberra distance (D4) is a weighted version of the $L<em>1$ Manhattan distance. This measure is very sensitive to small changes close to $x</em>{ik} = x_{jk} = 0$. </p>
|
|||
|
|
<p>It is often regarded as a generalization of the dissimilarity measure for binary data. In this context the measure can be divided by the number of variables, $p$, to ensure a dissimilarity coefficient in the interval $[0, 1]$</p>
|
|||
|
|
<p>It can then be shown that this measure for binary variables is just one minus the matching coefficient.</p>
|
|||
|
|
<h3>Correlation Measures</h3>
|
|||
|
|
<p>It has often been suggested that the correlation between two observations can be used to quantify the similarity between them. </p>
|
|||
|
|
<p>Since for correlation coefficients we have that $-1 \le \phi<em>{ij} \le 1$ with the value ‘1’ reflecting the strongest possible positive relationship and the value ‘-1’ the strongest possible negative relationship, these coefficients can be transformed into dissimilarities, $d</em>{ij}$, within the interval $[0, 1]$</p>
|
|||
|
|
<p>The use of correlation coefficients in this context is far more contentious than its noncontroversial role in assessing the linear relationship between two variables based on $n$ observations.</p>
|
|||
|
|
<p>When correlations between two individuals are used to quantify their similarity the <u>rows of the data matrix are standardized</u>, not its columns.</p>
|
|||
|
|
<p><strong>Disadvantages</strong></p>
|
|||
|
|
<p>When variables are measured on different scales the notion of a difference between variable values and consequently that of a mean variable value or a variance is meaningless.</p>
|
|||
|
|
<p>In addition, the correlation coefficient is unable to measure the difference in size between two observations.</p>
|
|||
|
|
<p><strong>Advantages</strong></p>
|
|||
|
|
<p>However, the use of a correlation coefficient can be justified for situations where all of the variables have been measured on the same scale and precise values taken are important only to the extent that they provide information about the subject's relative profile</p>
|
|||
|
|
<p><u>Example:</u> In classifying animals or plants, the absolute size of the organisms or their parts are often less important than their shapes. In such studies the investigator requires a dissimilarity coefficient that takes the value zero if and only if two individuals' profiles are multiples of each other. The angular separation dissimilarity measure has this property.</p>
|
|||
|
|
<p><strong>Further considerations</strong></p>
|
|||
|
|
<p>The Pearson correlation is sensitive to outliers. This has prompted a number of suggestions for modifying correlation coefficients when used as similarity measures; for example, robust versions of correlation coefficients such as <em>jackknife correlation</em> or altogether more general association coefficients such as <em>mutual information distance measure</em></p>
|
|||
|
|
<h4>Mahalanobis (Maximum) Distance [Not between 2 observations]</h4>
|
|||
|
|
<p>Mahalanobis distance is a measure of distance between a point P and a distribution D. It is a multi-dimensional generalization of the idea of measuring how many standard deviations away P is from the mean of D</p>
|
|||
|
|
<p>Mahalanobis distance is unitless and scale-invariant and takes into account the correlations of the data set
|
|||
|
|
$$
|
|||
|
|
D(\vec{x}) = \sqrt{(\vec{x} - \vec{\mu})^T S^{-1}(\vec{x}-\vec{\mu})}
|
|||
|
|
$$
|
|||
|
|
Where $\mu$ is a set of mean observations and $S$ is the covariance matrix</p>
|
|||
|
|
<p>If the covariance matrix is diagonal then the resulting distance measure is called a normalized Euclidean distance.
|
|||
|
|
$$
|
|||
|
|
d(\vec{x}, \vec{y}) = \sqrt{\sum_{i = 1}^N{\frac{(x_i - y_i)^2}{s^2_i}}}
|
|||
|
|
$$
|
|||
|
|
Where $s_i$ is the standard deviation of the $x_i$ and $y_i$ over the sample set</p>
|
|||
|
|
<h4>Discrete Metric</h4>
|
|||
|
|
<p>This metric describes whether or not two observations are equivalent
|
|||
|
|
$$
|
|||
|
|
\rho(x, y) = \begin{cases}
|
|||
|
|
1 & x \not= y \
|
|||
|
|
0 & x = y
|
|||
|
|
\end{cases}
|
|||
|
|
$$</p>
|
|||
|
|
<h2>Similarity Measures for Data Containing both Continuous and Categorical Variables</h2>
|
|||
|
|
<p>There are a number of approaches to constructing proximities for mixed-mode data, that is, data in which some variables are continuous and some categorical.</p>
|
|||
|
|
<ol>
|
|||
|
|
<li>Dichotomize all variables and use a similarity measure for binary data</li>
|
|||
|
|
<li>Rescale all the variables so that they are on the same scale by replacing variable values by their ranks among the objects and then using a measure for continuous data</li>
|
|||
|
|
<li>Construct a dissimilarity measure for each type of variable and combine these, either with or without differential weighting into a single coefficient.</li>
|
|||
|
|
</ol>
|
|||
|
|
<p>Most general-purpose statistical software implement a number of measurs for converting two-mode data matrix into a one-mode dissimilarity matrix.</p>
|
|||
|
|
<p>R has <code>cluster</code>, <code>clusterSim</code>, or <code>proxy</code></p>
|
|||
|
|
<h3>Proximity Measures for Structured Data</h3>
|
|||
|
|
<p>We'll be looking at data that consists of repeated measures of the same outcome variable but under different conditions.</p>
|
|||
|
|
<p>The simplest and perhaps most commonly used approach to exploiting the reference variable is in the construction of a reduced set of relevant summaries per object which are then used as the basis for defining object similarity.</p>
|
|||
|
|
<p>Here we will look at some approaches for choosing summary measures and resulting proximity measures for the most frequently encountered reference vectors (e.g. time, experimental condition, and underlying factor)</p>
|
|||
|
|
<p>Structured data arise when the variables can be assumed to follow a known <em>factor model</em>. Under <em>confirmatory factor analysis model</em> each variable or item can be allocated to one of a set of underlying factors or concepts. The factors cannot be observed directly but are 'indicated' by a number of items that are all measured on the same scale.</p>
|
|||
|
|
<p>Note that the summary approach, while typically used with continuous variables, is not limited to variables on an interval scale. The same principles can be applied to dealing with categorical data. The difference is that summary measures now need to capture relevant aspects of the distribution of categorical variables over repeated measures.</p>
|
|||
|
|
<p>Rows of <strong>$X$</strong> which represent ordered lists of elements, that is all the variables provide a categorical outcome and these variables can be aligned in one dimension, are more generally referred to as <em>sequences</em>. <em>Sequence analysis</em> is an area of research that centers on problems of events and actions in their temporal context and includes the measurements of similarities between sequences.</p>
|
|||
|
|
<p>The most popular measure of dissimilarity between two sequences is the Levenhstein distance and counts the minimum number of operations needed to transform one sequence of categories into another, where an operation is an insertion, a deletion, or a substitution of a single category. Each operation may be assigned a penalty weight (a typical choice would be to give double the penalty to a substitution as opposed to an insertion or deletion. The measure is sometimes called the 'edit distance' due to its application in spell checkers.</p>
|
|||
|
|
<p>Optimal matching algorithms (OMAs) need to be employed to find the minimum number of operations required to match one sequence to another. One such algorithm for aligning sequences is the Needleman-Wunsch algorithm, which is commonly used in bioinformatics to align proteins.</p>
|
|||
|
|
<p>The <em>Jary similarity measure</em> is a related measure of similarity between sequences of categories often used to delete duplicates in the area of record linkage.</p>
|
|||
|
|
<h2>Inter-group Proximity Measures</h2>
|
|||
|
|
<p>In clustering applications, it becomes necessary to consider how to measure the proximity between groups of individuals.</p>
|
|||
|
|
<ol>
|
|||
|
|
<li>The proximity between two groups might be defined by a suitable summary of the proximities between individuals from either group</li>
|
|||
|
|
<li>Each group might be described by a representative observation by choosing a suitable summary statistic for each variable, and the inter group proximity defined as the proximity between the representative observations.</li>
|
|||
|
|
</ol>
|
|||
|
|
<h3>Inter-group Proximity Derived from the Proximity Matrix</h3>
|
|||
|
|
<p>For deriving inter-group proximities from a matrix of inter-individual proximities, there are a variety of possibilities</p>
|
|||
|
|
<ul>
|
|||
|
|
<li>Take the smallest dissimilarity between any two individuals, one from each group. This is referred to as <em>nearest-neighbor distance</em> and is the basis of the clustering technique known as <em>single linkage</em></li>
|
|||
|
|
<li>Define hte intergroup distance as the largest distance between any two individuals, one from each group. This is known as the <em>furthest-neighbour distance</em> and constitute the basis of <em>complete linkage</em> cluster method.</li>
|
|||
|
|
<li>Define as the average dissimiliarity between individuals from both groups. Such a measure is used in <em>group average clustering</em></li>
|
|||
|
|
</ul>
|
|||
|
|
<h3>Inter-group Proximity Based on Group Summaries for Continuous Data</h3>
|
|||
|
|
<p>One method for constructing inter-group dissimilarity measures for continuous data is to simply substitute group means (also known as the centroid) for the variable values in the formulae for inter-individual measures</p>
|
|||
|
|
<p>More appropriate, however, might be measures which incorporate in one way or another, knowledge of within-group variation. One possibility is to use Mahallanobis's generalized distance.</p>
|
|||
|
|
<h4>Mahalanobis (Maximum) Distance</h4>
|
|||
|
|
<p>Mahalanobis distance is a measure of distance between a point P and a distribution D. It is a multi-dimensional generalization of the idea of measuring how many standard deviations away P is from the mean of D</p>
|
|||
|
|
<p>Mahalanobis distance is unitless and scale-invariant and takes into account the correlations of the data set
|
|||
|
|
$$
|
|||
|
|
D(\vec{x}) = \sqrt{(\vec{x} - \vec{\mu})^T S^{-1}(\vec{x}-\vec{\mu})}
|
|||
|
|
$$
|
|||
|
|
Where $\mu$ is a set of mean observations and $S$ is the covariance matrix</p>
|
|||
|
|
<p>If the covariance matrix is diagonal then the resulting distance measure is called a normalized Euclidean distance.
|
|||
|
|
$$
|
|||
|
|
d(\vec{x}, \vec{y}) = \sqrt{\sum_{i = 1}^N{\frac{(x_i - y_i)^2}{s^2_i}}}
|
|||
|
|
$$
|
|||
|
|
Where $s_i$ is the standard deviation of the $x_i$ and $y_i$ over the sample set</p>
|
|||
|
|
<p>Thus, the Mahalanobis distance incraeses with increasing distances between the two group centers and with decreasing within-group variation.</p>
|
|||
|
|
<p>By also employing within-group correlations, the Mahalanobis distance takes account the possibly non-spherical shapes of the groups.</p>
|
|||
|
|
<p>The use of Mahalanobis implies that the investigator is willing to <strong>assume</strong> that the covariance matrices are at least approximately the same in the two groups. When this is not so, this measure is an inappropriate inter-group measure. Other alternatives exist such as the one proposed by Anderson and Bahadur</p>
|
|||
|
|
<img src="http://proquest.safaribooksonline.com.ezproxy.umw.edu/getfile?item=cjlhZWEzNDg0N2R0cGMvaS9zMG1nODk0czcvN3MwczM3L2UwLXMzL2VpL3RtYTBjMGdzY2QwLmkxLWdtaWY-" alt="equation">
|
|||
|
|
<p>Another alternative is the <em>normal information radius</em> suggested by Jardine and Sibson</p>
|
|||
|
|
<img src="http://proquest.safaribooksonline.com.ezproxy.umw.edu/getfile?item=cjlhZWEzNDg0N2R0cGMvaS9zMG1nODk0czcvN3MwczM4L2UwLXMzL2VpL3RtYTBjMGdzY2QwLmkxLWdtaWY-" alt="equation">
|
|||
|
|
<h3>Inter-group Proximity Based on Group Summaries for Categorical Data</h3>
|
|||
|
|
<p>Approaches for measuring inter-group dissimilarities between groups of individuals for which categorical variables have been observed have been considered by a number of authors. Balakrishnan and Sanghvi (1968), for example, proposed a dissimilarity index of the form</p>
|
|||
|
|
<p><img src="http://proquest.safaribooksonline.com.ezproxy.umw.edu/getfile?item=cjlhZWEzNDg0N2R0cGMvaS9zMG1nODk0czcvN3MwczMwL2UwLXMzL2VpL3RtYTBjMGdzY2QwLmkyLWdtaWY-" alt="equation" /></p>
|
|||
|
|
<p>where $p<em>{Akl}$ and $p</em>{Bkl}$ are the proportions of the lth category of the kth variable in group A and B respectively, <img src="http://proquest.safaribooksonline.com.ezproxy.umw.edu/getfile?item=cjlhZWEzNDg0N2R0cGMvaS9zMG1nODk0czcvN3MwczNmL2VnMi8zbGVpL3RtYTBjbmdzaWUuMGlpbg--" alt="img" />, ck + 1 is the number of categories for the kth variable and p is the number of variables.</p>
|
|||
|
|
<p>Kurczynski (1969) suggested adapting the generalized Mahalanobis distance, with categorical variables replacing quantitative variables. In its most general form, this measure for inter-group distance is given by</p>
|
|||
|
|
<p><img src="http://proquest.safaribooksonline.com.ezproxy.umw.edu/getfile?item=cjlhZWEzNDg0N2R0cGMvaS9zMG1nODk0czcvN3MwczMxL2UwLXMzL2VpL3RtYTBjMGdzY2QwLmkyLWdtaWY-" alt="equation" /></p>
|
|||
|
|
<p>where <img src="http://proquest.safaribooksonline.com.ezproxy.umw.edu/getfile?item=cjlhZWEzNDg0N2R0cGMvaS9zMG1nODk0czcvN3MwczNmL2VnMy8zbGVpL3RtYTBjbmdzaWUuMGlpbg--" alt="img" /> contains sample proportions in group A and <img src="http://proquest.safaribooksonline.com.ezproxy.umw.edu/getfile?item=cjlhZWEzNDg0N2R0cGMvaS9zMG1nODk0czcvN3MwczNmL2VnNC8zbGVpL3RtYTBjbmdzaWUuMGlpbg--" alt="img" /> is defined in a similar manner, and <img src="http://proquest.safaribooksonline.com.ezproxy.umw.edu/getfile?item=cjlhZWEzNDg0N2R0cGMvaS9zMG1nODk0czcvN3MwczNmL2VnNS8zbGVpL3RtYTBjbmdzaWUuMGlpbg--" alt="img" /> is the m × m common sample covariance matrix, where <img src="http://proquest.safaribooksonline.com.ezproxy.umw.edu/getfile?item=cjlhZWEzNDg0N2R0cGMvaS9zMG1nODk0czcvN3MwczNmL2VnNi8zbGVpL3RtYTBjbmdzaWUuMGlpbg--" alt="img" />. </p>
|
|||
|
|
<h2>Weighting Variables</h2>
|
|||
|
|
<p>To weight a variable means to give it greater or lesser importance than other variables in determining the proximity between two objects. </p>
|
|||
|
|
<p>The question is 'How should the weights be chosen?' Before we discuss this question, it is important to realize that the selection of variables for inclusion into the study already presents a form of weighting, since the variables not included are effectively being given the weight $0$.</p>
|
|||
|
|
<p>The weights chosen for the variables reflect the importance that the investigator assigns the variables for the classification task.</p>
|
|||
|
|
<p>There are several approaches to this</p>
|
|||
|
|
<ul>
|
|||
|
|
<li>Authors obtain perceived dissimilarities between selected objects, they then model the dissimilarities using the underlying variables and weights that indicate their relative importance. The weights that best fit the perceived dissimilarities are then chosen.</li>
|
|||
|
|
<li>Define the weights to be inversely proportion to some measure of variability in this variable. This choice of weights implies that the importance of a variable decreases when its variability increases.
|
|||
|
|
<ul>
|
|||
|
|
<li>For a continous variable, the most commonly emplyed weight is either the reciprocal of its standard deviation or the reciprocal of its range</li>
|
|||
|
|
<li>Employing variability weights is equivalent to what is commonly referred to as <em>standardizing</em> the variables.</li>
|
|||
|
|
</ul></li>
|
|||
|
|
<li>Construct weights from the data matrix using <em>variable section</em>. In essence, such procedures proceed in an iterative fashion to identify variables which, when contributing to a cluster algorithm, lead to internally cohesive and externally isolated clusters and, when clustered singly, produce reasonable agreement.</li>
|
|||
|
|
</ul>
|
|||
|
|
<p>The second approach assumed the importance of a variable to be inversely proportional to the total variability of that variable. The total variability of a variable comprises variation both within and between groups which may exist within the set of individuals. The aim of cluster analysis is typically to identify such groups. Hence it can be argued that the importance of a variable should not be reduced because of between-group variation (on the contrary, one might wish to assign more importance to a variable that shows larger between-group variation.)</p>
|
|||
|
|
<p>Gnanadesikan et al. (1995) assessed the ability of squared distance functions based on data-determined weights, both those described above and others, to recover groups in eight simulated and real continuous data sets in a subsequent cluster analysis. Their main findings were:</p>
|
|||
|
|
<ol>
|
|||
|
|
<li>Equal weights, (total) standard deviation weights, and range weights were generally ineffective, but range weights were preferable to standard deviation weights.</li>
|
|||
|
|
<li>Weighting based on estimates of within-cluster variability worked well overall.</li>
|
|||
|
|
<li>Weighting aimed at emphasizing variables with the most potential for identifying clusters did enhance clustering when some variables had a strong cluster structure.</li>
|
|||
|
|
<li>Weighting to optimize the fitting of a hierarchical tree was often even less effective than equal weighting or weighting based on (total) standard deviations.</li>
|
|||
|
|
<li>Forward variable selection was often among the better performers. (Note that all-subsets variable selection was not assessed at the time.)</li>
|
|||
|
|
</ol>
|
|||
|
|
<h2>Standardization</h2>
|
|||
|
|
<p>In many clustering applications, the variables describing the objects to be clustered will not be measured in the same units. A number of variability measures have been used for this purpose</p>
|
|||
|
|
<ul>
|
|||
|
|
<li>When standard deviations calculated from the complete set of objects to be clustered are used, the technique is often referred to as <em>auto-scaling, standard scoring, or z-scoring</em>. </li>
|
|||
|
|
<li>Division by the median absolute deviations or by the ranges.</li>
|
|||
|
|
</ul>
|
|||
|
|
<p>The second is shown to outperform auto-scaling in many clustering applications. As pointed out in the previous section, standardization of variables to unit variance can be viewed as a special case of weighting.</p>
|
|||
|
|
<h2>Choice of Proximity Measure</h2>
|
|||
|
|
<p>Firstly, the nature of the data should strongly influence the choice of the proximity measure. </p>
|
|||
|
|
<p>Next, the choice of measure should depend on the scale of the data. Similarity coefficients should be used when the data is binary. For continuous data, distance of correlation-type dissimilarity measure should be used according to whether 'size' or 'shape' of the objects is of interest. </p>
|
|||
|
|
<p>Finally, the clustering method to be used might have some implications for the choice of the coefficient. For example, making a choice between several proximity coefficients with similar properties which are also known to be monotonically related can be avoided by employing a cluster method that depends only on the ranking of the proximities, not their absolute values.</p>
|
|||
|
|
</article>
|
|||
|
|
</main>
|
|||
|
|
|
|||
|
|
<script src="themes/bitsandpieces/scripts/highlight.js"></script>
|
|||
|
|
<script src="themes/bitsandpieces/scripts/mousetrap.min.js"></script>
|
|||
|
|
<script type="text/x-mathjax-config">
|
|||
|
|
MathJax.Hub.Config({
|
|||
|
|
tex2jax: {
|
|||
|
|
inlineMath: [ ['$','$'], ["\\(","\\)"] ],
|
|||
|
|
processEscapes: true
|
|||
|
|
}
|
|||
|
|
});
|
|||
|
|
</script>
|
|||
|
|
|
|||
|
|
<script type="text/javascript"
|
|||
|
|
src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
|
|||
|
|
</script>
|
|||
|
|
<script>
|
|||
|
|
hljs.initHighlightingOnLoad();
|
|||
|
|
|
|||
|
|
document.querySelectorAll('.menuitem a').forEach(function(el) {
|
|||
|
|
if (el.getAttribute('data-shortcut').length > 0) {
|
|||
|
|
Mousetrap.bind(el.getAttribute('data-shortcut'), function() {
|
|||
|
|
location.assign(el.getAttribute('href'));
|
|||
|
|
});
|
|||
|
|
}
|
|||
|
|
});
|
|||
|
|
</script>
|
|||
|
|
|
|||
|
|
</body>
|
|||
|
|
</html>
|