Book for the slides

1) Introduction to Data Mining

Author: P N Tan, M Steinbach and V Kumar
2) Data Mining: Concepts and Techniques
Author: J Han and M Kamber

1
 Cluster Analysis

Clustering
 Classes, or conceptually meaningful groups of objects that
share common characteristics, play an important role in how
people analyze and describe the world.
 It involves dividing objects into groups

Cluster Analysis
 It groups data objects based only on information found in the
data that describes the objects and their relationships
 The objects within a group be similar to one another and
different from the objects in other groups
 The greater the similarity within a group and the greater the
differences between groups, the better the clustering.
 It is the study of techniques for automatically finding classes
 It is the study of techniques for finding the most representative
cluster prototypes: summarization, compression, efficiently
finding nearest neighbours

2
 Cluster Analysis
Applications
 Biology: hierarchical classification of all living beings
 Information retrieval: Clustering can be used to group web
search results into a small number of clusters, e.g., movie,
trailers, stars etc. categories can be divided into subcategories
(sub-clusters).
 Climate
 Psychology and Medicine
 Business

Clustering and Classification

 Clustering: it can be regarded as a form of classification in that it
creates a labeling of objects with class (cluster) labels; It derives
these labels only from the data
 An entire collection of clusters is commonly referred to as clustering
 Classification: Unlabelled objects are assigned a class label using a
model developed from objects with known class labels (training data
objects) Classification is supervised classification. Clustering is
unsupervised classification.
3
 Cluster Analysis
Different types of clustering
 Hierarchical versus partitional
 Exclusive versus overlapping versus fuzzy
 Complete versus partial

Fuzzy clustering
 Every object belongs to every cluster with a membership
weight that is between 0 (absolutely does not belong) and 1
(absolutely belong)
 Clusters are treated as fuzzy sets
 Fuzzy set is one in which an object belongs to any set with a
weight that is between 0 and 1.
 In fuzzy clustering, the sum of the weights for each object
must equal 1

4
 Cluster Analysis
Different types of clusters
 Well-separated
 Prototype-based
 Graph-based
 Density-based
 Shared-property

Cluster analysis techniques

 K-means
 Agglomerative Hierarchical Clustering
 DBSCAN

5
 Cluster Analysis

K-means
 It is a prototype-based, partitional clustering clustering
technique that attempts to find a user-specified number of
clusters (K), which are represented by their centroids.

Basic K-means algorithm

See algorithm 8.1 (407)