Andere Kunden interessierten sich auch für
![Degree correlations and clustering hierarchy in networks]( "Degree correlations and clustering hierarchy in networks")
Degree correlations and clustering hierarchy in networks38,99 €![Bayesian Variable Selection for High Dimensional Data Analysis]( "Bayesian Variable Selection for High Dimensional Data Analysis")
Bayesian Variable Selection for High Dimensional Data Analysis32,99 €![Some Results of Matrix Linear Relations]( "Some Results of Matrix Linear Relations")
Some Results of Matrix Linear Relations40,99 €![CLUSTERING APPROACH FOR SPATIAL ANALYSIS]( "CLUSTERING APPROACH FOR SPATIAL ANALYSIS")
CLUSTERING APPROACH FOR SPATIAL ANALYSIS29,99 €![On The Correlation Clustering Problem]( "On The Correlation Clustering Problem")
On The Correlation Clustering Problem32,99 €![Estimation Following Selection of Discrete Distributions]( "Estimation Following Selection of Discrete Distributions")
Estimation Following Selection of Discrete Distributions51,99 €![Augustin-Louis Cauchy]( "Augustin-Louis Cauchy")
Augustin-Louis Cauchy74,99 €
Typical k-means clustering procedures require a priori knowledge of the number of clusters in the data set. This value can be very difficult to ascertain. Existing heuristic methods work in some cases, but are rarely very reliable. Herein, a new method for determining the number of k-means clusters in a given data set is presented. The algorithm is developed from its theoretical basis and its implementation is examined and compared to existing solutions.