Data Mining - k-Means Clustering algorithm

Thomas Bayes


k-Means is an Unsupervised distance-based clustering algorithm that partitions the data into a predetermined number of clusters.

Each cluster has a centroid (center of gravity).

Cases (individuals within the population) that are in a cluster are close to the centroid.

Oracle Data Mining supports an enhanced version of k-Means. It goes beyond the classical implementation by defining a hierarchical parent-child relationship of clusters.



Discover More
Anomalies Election Fraud
Data Mining - (Anomaly|outlier) Detection

The goal of anomaly detection is to identify unusual or suspicious cases based on deviation from the norm within data that is seemingly homogeneous. Anomaly detection is an important tool: in data...
Data Mining Algorithm
Data Mining - Algorithms

An is a mathematical procedure for solving a specific kind of problem. For some data mining functions, you can choose among several algorithms. Algorithm Function Type Description Decision...
Data Mining - Clustering (Function|Model)

To identify natural groupings in the data. Useful for exploring data and finding natural groupings within the data. Members of a cluster are more like each other than they are like members of a different...
Card Puncher Data Processing
ORE (Oracle R Enterprise)

Oracle R Enterprise is a component of Oracle...
Card Puncher Data Processing

is a language and environment for statistical computing and graphics. Syntax is very similar to the S_(programming_language)S language. S is a language that was developed by John Chambers et al. at Bell...
R Orginal Vs Kmeans
R - K-means clustering

K-means in R. K-means works in any dimension, but in two dimension, we can plot data. Kmeans is in the stats package. where: 3 means that we search 3 cluster Plot the data: with the...

Share this page:
Follow us:
Task Runner