K-means cluster analysis, Advanced Statistics

Assignment Help:

K-means cluster analysis is the method of cluster analysis in which from an initial partition of observations into K clusters, each observation in turn is analysed and reassigned, if suitable, to a different cluster in an attempt to optimize some predefined numerical criterion that measures in some sense the 'quality' of cluster solution. Several such clustering criteria have been suggested, but the most usually used arise from considering the features of the within groups, between groups and whole matrices of sums of squares and the cross products (W, B, T) which can be described for every partition of the observations into the particular number of groups. The two most ordinary of the clustering criteria developing from these matrices are given as follows

minimization of trace W

minimization of determinant W

The first of these has tendency to produce the 'spherical' clusters, the second to produce clusters that all have same shape, though this will not necessarily be spherical in shape. 

 


Related Discussions:- K-means cluster analysis

Historigram, difference between histogram and historigram

difference between histogram and historigram

Lagrange multipliertest, The Null Hypothesis - H0:  There is autocorrelatio...

The Null Hypothesis - H0:  There is autocorrelation The Alternative Hypothesis - H1: There is no autocorrelation Rejection Criteria: Reject H0 (n-s)R 2 > = (1515 - 4) x (0.

Cochrane collaboration, Cochrane collaboration : An international network o...

Cochrane collaboration : An international network of the individuals committed to preparing , maintaining and disseminating the systematic reviews of the effects of the health care

Explain median absolute deviation (mad), Median absolute deviation (MAD) : ...

Median absolute deviation (MAD) : It is the very robust estimator of the scale given by the following equation   or, in other words we can say that, the median of the absolute

Hill-climbing algorithm, Hill-climbing algorithm is  an algorithm which is ...

Hill-climbing algorithm is  an algorithm which is made in use in those techniques of cluster analysis which seek to find the partition of n individuals into g clusters by optimizin

Point scoring, Point scoring is an easy distribution free method which can...

Point scoring is an easy distribution free method which can be used for the prediction of a response which is a binary variable from the observations on several explanatory variab

Describe item-total correlation, Item-total correlation is an  extensively...

Item-total correlation is an  extensively used method for checking the homogeneity of the scale made up of number of items. It is simply the Pearson's product moment correlation c

Bayesian confidence interval, Bayesian confidence interval : An interval of...

Bayesian confidence interval : An interval of the posterior distribution which is so that the density of it at any point inside the interval is greater than that of the density at

Explain laplace distribution, Laplace distribution : The probability distri...

Laplace distribution : The probability distribution, f(x), given by the following formula   Can be derived as the distribution of the difference of two independent random var

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd