Menu

Algorithms_for_Clustering_data

Neeti Pokhriyal Dasha
There is a newer version of this page. You can find it here.

Kmeans algorithm:

Clustering refers to finding groups of objects such that the objects in a group will be similar (or related) to one another and different from (or unrelated to) the objects in other groups.

Kmeans is a flat clustering algorithm.http://nlp.stanford.edu/IR-book/html/.../k-means-1.html#sec:kmeans. Kmeans is an iterative algorithm, whose first step is to select k initial centroids (also called seeds), which are randomly selected data points. In the second step, k clusters are formed by assigning all points to their closest centroid, and the centroid of each cluster is recomputed. This is done iteratively till a stopping criterion is met (for example: the centroids don't change).

The "closeness" can be measured by various distance measures, or similarity measures or correlation. Different distance measures were experimented for our case, and gave similar results. Thus, results were generated with Euclidean as the chosen distance measure. Another parameter to the kmeans algorithm is the number of clusters. Since our data is small (a matrix of size 39*49), two was selected as the number of clusters. The output of the kmeans clustering is validated with the domain knowledge, and is shown to give meaningful results.

"Anomaly Detection"

A typical problem definition of anomaly detection is: Given a dataset D, find all the data points x belonging to D having the top-n largest anomaly scores calculated by a predetermined function f(x). It is associated with numerous challenges, like:

  • How does one define normal, and define deviations from it?
  • How many outliers are there?
  • How can anomalies be validated as either real or noise?
  • How does one determine when all the anomalies have been caught?

Some of the application areas include credit card fraud detection, telecommunication fraud detection, network intrusion detection, fault detection.

The general steps for any anomaly detection algorithms include:

  • Build a profile of the “normal” behavior.
  • Profile can be patterns or summary statistics for the overall population
  • Use the “normal” profile to detect anomalies
  • Anomalies are observations whose characteristics�differ significantly from the normal profile

Types of anomaly detection �schemes Graphical & Statistical-based Distance-based Model-based


Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.