Calculating clusters with AI methods

Clever Fellow

Article from Issue 145/2012
Author(s):

A human observer can register clusters in a two-dimensional set of points at a glance. Artificial intelligence has a harder time getting it done; however, the relatively simple k-means method delivers usable results.

Nature lovers who tagged along with the previous edition of this column and generated a map with all US national parks [1] might subsequently ask themselves how they can tour all these attractions using as few resources as possible. Figure 1 shows that the parks are concentrated in certain areas. A tourist can thus visit about a dozen spectacles of nature by focusing on one area during a single visit.

Unbeatable Brain

The human brain registers clusters of thumbtacks on the map with hardly any effort. Within a fraction of a second, it perceives that most national parks are to be found in the West of the contiguous United States, with a few more in the Southeast, six more up in Alaska, and some farther away on the islands of Hawaii, Samoa, and Puerto Rico.

A computer lacks this kind of overview – in the literal sense of the word. It has to calculate painstakingly the areas of concentration, also called clusters. The book Data Analysis with Open Source Tools [2] explains how to implement a series of promising methods. However, these approaches are all inferior to the human brain, as demonstrated by simple tests in which computerized data analysis fails miserably.

[...]

Use Express-Checkout link below to read the full article (PDF).

Buy this article as PDF

Express-Checkout as PDF
Price $2.95
(incl. VAT)

Buy Linux Magazine

SINGLE ISSUES
 
SUBSCRIPTIONS
 
TABLET & SMARTPHONE APPS
Get it on Google Play

US / Canada

Get it on Google Play

UK / Australia

Related content

  • Perl – k-means Clusters

    A human observer can register clusters in a two-dimensional set of points at a glance. Artificial intelligence has a harder time getting it done; however, the relatively simple k-means method delivers usable results.

  • Unsupervised Learning

    The most tedious part of supervised machine learning is providing sufficient supervision. However, if the samples come from a restricted sample space, unsupervised learning might be fine for the task.

  • Machine Learning

    We explore some machine learning techniques with a simple missing person app.

  • Data Science Methods

    Data science is all about gaining insights from mountains of data. We tour some important tools for the trade.

  • Treasure Hunt

    A geolocation guessing game based on the popular Wordle evaluates a player's guesses based on the distance from and direction to the target location. Mike Schilli turns this concept into a desktop game in Go using the photos from his private collection.

comments powered by Disqus
Subscribe to our Linux Newsletters
Find Linux and Open Source Jobs
Subscribe to our ADMIN Newsletters

Support Our Work

Linux Magazine content is made possible with support from readers like you. Please consider contributing when you’ve found an article to be beneficial.

Learn More

News