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

Resentful demoralization, Resentful demoralization is the possible phenome...

Resentful demoralization is the possible phenomenon in the clinical trials and intervention studies in which comparison groups not attaining a perceived desirable treatment become

Mobile Marketing statistics., 1) Has smartphones affected the consumer beh...

1) Has smartphones affected the consumer behavior? If so How ? And how is it going to change in future? 2) Forecasting of Mobile market (Time series analysis) 3) Comparison of fou

Tests for heteroscedasticity, The Null Hypothesis - H0: There is no heteros...

The Null Hypothesis - H0: There is no heteroscedasticity i.e. β 1 = 0 The Alternative Hypothesis - H1:  There is heteroscedasticity i.e. β 1 0 Reject H0 if nR2 > MTB >

Barnard, Barnard, George Alfred (1915^2002) : Born in Walthamstow in the ea...

Barnard, George Alfred (1915^2002) : Born in Walthamstow in the east of London, Barnard achieved a scholarship to St. John's College, Cambridge, from where he graduated in the math

Ecme algorithm, The Expectation/Conditional Maximization Either algorithm w...

The Expectation/Conditional Maximization Either algorithm which is the generalization of ECM algorithm attained by replacing some of the CM-steps of ECM which maximize the constrai

Probability, Modern hotels and certain establishments make use of an electr...

Modern hotels and certain establishments make use of an electronic door lock system. To open a door an electronic card is inserted into a slot. A green light indicates that the doo

Times series plots, The time series for RESI1, HI1 and COOK1 have appeared ...

The time series for RESI1, HI1 and COOK1 have appeared again with different outlier values even though the 17 outliers found early were removed.

Probability and random processes, how to find the PDF and CDF of a gamma ra...

how to find the PDF and CDF of a gamma random variable with given equation?

Disclosure risk, The risk of being able to recognize the respondent's confi...

The risk of being able to recognize the respondent's confidential information in the data set. Number of approaches has been proposed to measure the disclosure risk some of which c

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