Beschreibung
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.
Autorenporträt
Jesse McCrosky, M.Math completed his Master''s Degree in Computer Science at the University of Waterloo. He is currently pursuing a Ph.D. in Community Health and Epidemiology at the University of Saskatchewan and working for Statistics Canada as a Research Data Centre Analyst.
