Hill-climbing algorithm, Advanced Statistics

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 optimizing some numerical index of the clustering. Since it is not possible to consider every partition of n individuals into g groups (because of the enormous number of the partitions), the algorithm starts with some given initial partition and considers individuals in turn for moving into the other clusters, creating the move if it causes an improvement in the value of the clustering index. The procedure is continued until no move of the single individual causes an improvement.

Posted Date: 7/28/2012 7:15:42 AM | Location : United States







Related Discussions:- Hill-climbing algorithm, Assignment Help, Ask Question on Hill-climbing algorithm, Get Answer, Expert's Help, Hill-climbing algorithm Discussions

Write discussion on Hill-climbing algorithm
Your posts are moderated
Related Questions
Basic reproduction number : A term used in the theory of infectious diseases for the number of secondary cases which one case would generate in a completely susceptible population.

facts and statistics about daycare

Different approaches to the study of early indian history

Half-normal plot is a  plot for diagnosing the model inadequacy or revealing the presence of outliers, in which the absolute values of, for instance, the residuals from the multipl

how to constuct design matrix

Discuss the use of dummy variables in both multiple linear regression and non-linear regression. Give examples if possible

O. J. Simpson paradox is a term coming from the claim made by the defence lawyer in murder trial of O. J. Simpson. The lawyer acknowledged that the statistics demonstrate that onl

Path analysis  is  a device for evaluating the interrelationships among the variables by analyzing their correlational structure. The relationships between the variables are man

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

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.