Skip to Main Content
Building an Intelligent Web: Theory and Practice
book

Building an Intelligent Web: Theory and Practice

by Pawan Lingras, Rajendra Akerkar
March 2010
Intermediate to advanced content levelIntermediate to advanced
326 pages
12h 25m
English
Jones & Bartlett Learning
Content preview from Building an Intelligent Web: Theory and Practice
“4137X˙CH05˙Akerkar” 2007/9/8 11:01 page 179 #3
5.2 Statistical Methods 179
5.2.1 The kMeans Algorithm
The k-means method of cluster detection is the most commonly used. It has many variations,
but the form described here was the one first published by J. B. MacQueen in 1967. This
algorithm has an input of predefined number of clusters, which is called k. “Means” stands for
the average location of all the members of a single cluster. Assume that the data is represented
as a relational table, with each row representing an object and each column representing an
attribute. The value of every attribute from the table of data we are analyzing ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Reinventing the Organization for GenAI and LLMs

Reinventing the Organization for GenAI and LLMs

Ethan Mollick

Publisher Resources

ISBN: 9780763741372