Skip to main content

Clustering Evaluation

The major tasks of clustering evaluation are as follows

Clustering tendency assessment

The assessment to be carried out to check whether nonrandom structure exists in the given data set.

The Hopkins Statistic is a spatial statistic that tests the spatial randomness of a variable as distributed in a space. The Hopkins statistic value would be about 0.5 if data set are uniformly distributed. If the data set are highly skewed, then H would be close to 0. The uniformly distributed data set contains no meaningful clusters, that is if Hopkin statistic value is greater than 0.5 then it is unlikely that the data set has significant clusters.

No of Clusters determination

The number of clusters can be regarded as an important summary statistic of a data set. It is desirable to estimate the number of clusters even before a clustering algorithm is used to derive detailed clusters.

The appropriate number of clusters controls the proper granularity of cluster analysis. The right number of clusters depends on the distribution’s shape and scale in the data set, as well as the clustering resolution required.

A simple method is to set the number of clusters to about square root of half of the data set points(n). The elbow method is based on the observation that increasing the number of clusters can help to reduce the sum of within-cluster variance of each cluster. The heuristic method of selecting the right number of clusters is to use the turning point in the curve of the sum of within cluster variance with respect to the number of clusters. The right number of clusters in a data set can also be determined by cross validation, a technique often used in classification.

Cluster quality measurement

A number of measures can be used to measure how well the clusters fit the data set and how well the clusters match the ground truth. The methods for measuring the quality of clustering are categorized into two based on whether ground truth (Ideal Clustering) is available or not. The method is called as Extrinsic methods if ground truth is available, else it is called as Intrinsic methods which evaluate the goodness of a clustering by considering how well the clusters are separated. Extrinsic method is also known as Supervised method and Intrinsic method is known as Unsupervised method. The measurement of clustering quality is effective if it satisfies the following criteria.

  • Cluster homogeneity
  • Cluster completeness
  • Rag bag
  • Small cluster preservation

Popular posts from this blog

Matrix Eigenvalues & Eigenvectors

The process of finding an unknown scalar, λ and a nonzero vector, x for a given non zero square matrix, A of dimension n x n is called matrix eigenvalue or eigenvalue. Ax = λ x The λ and x which satisfies the above equation is called eigen value and eigenvector. Ax should be proportional to x. The multiplication will produce a new vector that will have the same or opposite direction as the original vector. The set of all the eigenvalues of A is called the  spectrum of A. The largest of the absolute values of the  eigenvalues of A is called the spectral radius of A. To determine eigenvalue and eigenvector, the equation can be written in matrix notation, (A - λI)x = 0 By Cramer's theorem,  the  homogeneous linear system of equations has a  nontrivial solution if and only if the corresponding determinant of the coefficients is zero. A - λI is called characteristic matrix and D( λ) is characteristic determinant of A. The above equation is called characteristic ...

Gaussian Elimination - Row reduction Algorithm

 Gaussian elimination is a method for solving matrix equations of the form, Ax=b.  This method is also known as the row reduction algorithm. Back  Substitution Solving the last equation for the variable and then work backward into the first equation to solve it.  The fundamental idea is to add multiples of one equation to the others in order to eliminate a variable and to continue this process until only one variable is left. Pivot row The row that is used to perform elimination of a variable from other rows is called the pivot row. Example: Solving a linear equation The augmented matrix for the above equation shall be The equation shall be solved using back substitution. The eliminating the first variable (x1) in the first row (Pivot row) by carrying out the row operation. As the second row become zero, the row will be shifted to bottom by carrying out partial pivoting. Now, the second variable (x2)  shall be eliminated by carrying out the row operation again. ...

Cache Memory

The supplementary memory system that temporarily stores frequently used instructions and data for quicker processing by CPU of a computer. Main memory consists of up to 2n addressable words, with each word having a unique n-bit address. there are M = 2n/K fixed length of blocks in main memory. where K - words The cache consists of m blocks called lines. The length of a line, not including tag and control bits, is the line size. As there are more blocks in main memory than lines in cache, an individual line cannot be uniquely and permanently dedicated to a particular block. Thus, each line includes a tag that identifies which particular block is currently being stored. The cache connects to the processor via data, control, and address lines. When a cache hit occurs, the data and address buffers  are disabled and communication is only between processor and cache, with no system bus traffic. When a cache miss occurs, the desired address is loaded onto the system bus and the data are r...