WORLD'S LARGEST MARKET RESEARCH RESOURCE — 1,519,265 REPORTS

 
 
• SEARCH FOR A REPORT

Viewing report

Search
Enter keywords, a title or a report id number below.
Advanced

• ORDER BY FAX

Order By Fax

• SELECT SITE CURRENCY

Select a currency for use throughout the site



This product is currently not available for purchase.
Live Chat Live Help Software for Website

Customers who bought this item also bought

A New Measure for Clustering Model Selection. Edition No. 1

VDM Publishing House, September 2010, Pages: 68

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.

Jesse, McCrosky.
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.