1.1K views

Original Title: Clustering

Uploaded by sunnynnus

- Chapter 3
- Midterm Review Solution
- Data Warehousing and Data Mining
- Chap8 Basic Cluster Analysis
- Machine Learning
- Assosiation Rule
- k-Means Clustering, Hierarchical Clustering
- Data Mining Homework 1
- Clustering
- Data Warehousing and Data Mining_handbook
- Ch3 Data Preprocessing
- Chapter 3 Exercises
- Cluster Analysis
- chap9_advanced_cluster_analysis
- Factor Analysis
- ch07
- AB1202-ILE-10-Wk-13-Lect13-SOLUTIONS-20180215 (1)
- Homework2 Sol
- Decision Tree & Techniques
- Master Opp Gave

You are on page 1of 97

Concepts and

Techniques

Cluster Analysis

1

Chapter 8. Cluster Analysis

Types of Data in Cluster Analysis

A Categorization of Major Clustering Methods

Partitioning Methods

Hierarchical Methods

Density-Based Methods

Grid-Based Methods

Model-Based Clustering Methods

Outlier Analysis

2

What is Cluster Analysis?

3

What is Cluster Analysis?

Cluster: a collection of data objects

Similar to one another within the same

cluster

Dissimilar to the objects in other clusters

Cluster analysis

Grouping a set of data objects into

clusters

Clustering is unsupervised classification: no

predefined classes

Typical applications

As a stand-alone tool to get insight into

data distribution 4

General Applications of Clustering

Pattern Recognition

Spatial Data Analysis

create thematic maps in GIS by clustering

feature spaces

detect spatial clusters and explain them in

Image Processing

Economic Science (especially market research)

WWW

Document classification

5

Examples of Clustering

Applications

Marketing: Help marketers discover distinct groups

in their customer bases, and then use this

knowledge to develop targeted marketing

programs

Land use: Identification of areas of similar land use

in an earth observation database

Insurance: Identifying groups of motor insurance

policy holders with a high average claim cost

City-planning: Identifying groups of houses

according to their house type, value, and

geographical location

Earth-quake studies: Observed earth quake 6

What Is Good Clustering?

quality clusters with

high intra-class similarity

low inter-class similarity

The quality of a clustering result depends on both

the similarity measure used by the method and its

implementation.

The quality of a clustering method is also

measured by its ability to discover some or all of

the hidden patterns.

7

Requirements of Clustering in Data

Mining

Scalability

Ability to deal with different types of attributes

Discovery of clusters with arbitrary shape

Minimal requirements for domain knowledge to

determine input parameters

Able to deal with noise and outliers

Insensitive to order of input records

High dimensionality

Incorporation of user-specified constraints

Interpretability and usability

8

Types of Data in Cluster Analysis

9

Data Structures

Data matrix

... ... ... ... ...

(two modes) x ... xif ... xip

i1

... ... ... ... ...

x ... xnf ... xnp

n1

0

d(2,1) 0

Dissimilarity matrix

d(3,1) d ( 3,2) 0

(one mode)

: : :

d ( n,1) d ( n,2) ... ... 0

10

Measure the Quality of

Clustering

Dissimilarity/Similarity metric: Similarity is

expressed in terms of a distance function, which is

typically metric: d(i, j)

There is a separate “quality” function that

measures the “goodness” of a cluster.

The definitions of distance functions are usually

very different for interval-scaled, Boolean,

categorical, ordinal and ratio variables.

Weights should be associated with different

variables based on applications and data

semantics.

It is hard to define “similar enough” or “good

enough”

11

Type of data in clustering analysis

Interval-scaled variables

Binary variables

Nominal, ordinal, and ratio variables

Variables of mixed types

12

Interval-valued variables

Standardize data (convert measurements to unitless

measurements)

Calculate 1 (| x mean

s f =the

n 1 f − m f | +absolute

| x2 f − m f | +deviation

...+ | xnf − m f: |)

.

where

x1f,…,xnf are n measurements of f, and mf is mean value

xif − moff f

zif = sf

Calculate the standardized measurement (z-score)

standard deviation

13

Similarity and Dissimilarity Between

Objects

similarity or dissimilarity between two data

objects

d (i, j) = (| x − x |2 + | x − x |2 + ...+ | x − x |2 )

Euclidean distance i1 j1 i2 j2 ip jp

d (i, j) = | x − x | + | x − x | + ...+ | x − x |

Manhattan distance i1 j1 i2 j 2 ip jp

dimensional data objects

14

Similarity and Dissimilarity Between

Objects

Minkowski distance:

d (i, j) = q (| x − x |q + | x − x |q + ...+ | x − x |q )

i1 j1 i2 j 2 i p jp

where i = (xi1, xi2, …, xip) and j = (xj1, xj2, …, xjp) are

two p-dimensional data objects, and q is a positive

integer

d (i, j) =| x −distance

If q = 1, d is Manhattan x | + | x − x | + ...+ | x − x |

i1 j1 i2 j 2 ip jp

If q = 2, d is Euclidean distance :

d (i, j) = (| x − x |2 + | x − x |2 + ...+ | x − x |2 )

i1 j1 i2 j 2 ip jp

15

Similarity and Dissimilarity

Between Objects

Properties

d(i,j) ≥ 0: Distance is a nonnegative no

d(i,i) = 0: Distance of an object to itself is 0

d(i,j) = d(j,i): Distance is a symmetric func

d(i,j) ≤ d(i,k) + d(k,j): Triangular inequality

Also one can use weighted distance, parametric

Pearson product moment correlation, or other

dissimilarity measures.

16

Binary Variables

A contingency table for binary data Object j

1 0 sum

1 a b a +b

Object i 0 c d c +d

sum a +c b +d p

for object i and 0 for j, c is no. of variables =0 for object i and 1 for

j, d is no. of variables =0 for objects i,j

total p= a+b+c+d

Simple matching coefficient (invariant, if the binary variable is

symmetric): d (i, j) = b +c

a +b +c +d

if the b +c is

) = variable

asymmetric): a +b +c

17

Dissimilarity between Binary

Variables

Example

Name Gender Fever Cough Test-1 Test-2 Test-3 Test-4

Jack M Y N P N N N

Mary F Y N P N P N

Jim M Y P N N N N

valuable)

the remaining attributes are asymmetric binary

let dthe values Y and 0 +1

) = P be set =

to01,

.33and the value N be

( jack , mary

set to 0 2 +0 +1

1 +1

d ( jack , jim ) = =0.67

1 +1 +1

1 +2

d ( jim , mary ) = =0.75

1 +1 +2

18

Nominal Variables

take more than 2 states, e.g. map_color may have

5 states like red, yellow, blue, green, pink

Method 1: Simple matching

m: # of matches, p: total # of variables

d (i, j) = p −

p

m

creating a new binary variable for each of the M

nominal states

19

Ordinal Variables

variable, except that M states of the ordinal

value are ordered in a meaningful sequence. E.g

professional ranks are enumerated in sequential

order like assistant, associate, full

A continuous ordinal variable looks like a set of

continuous data of an unknown scale; i.e the

relative ordering of the values is essential but

their actual magnitude is not. E.g, relative

ranking in a sport (gold, silver, bronze)

20

Ordinal Variables

Can be treated like interval-scaled

replacing xif by their rank (value of f for the ith object is xif

and Mf ordered states, representing the ranking 1,…, Mf).

r ∈{1,..., M

Replace each xif by its corresponding

if

rank

} f

th object in the f-th variable by rif − 1

zif =

M f

−1

scaled variables

21

Ratio-Scaled

Variables

Ratio-scaled variable: a positive measurement on a

nonlinear scale, approximately at exponential

scale, such as AeBt or Ae-Bt

Methods:

treat them like interval-scaled variables — not a

good choice b’coz scale may be distorted

apply logarithmic transformation

yif = log(xif)

treat them as continuous ordinal data treat their

rank as interval-scaled.

22

Variables of Mixed

Types

A database may contain all the six types of variables

symmetric binary, asymmetric binary, nominal, ordinal,

One may use a weighted formula to combine their effects.

Σ

d (i, j ) = f =

p

1

δ ( f )

ij

d ( f )

ij

Σ p

f = 1

δ ( f )

ij

variable f for objcet I or object j)

f is binary or nominal:

f is interval-based: use the normalized distance

f is ordinal or ratio-scaled zif = rif −1

compute ranks r and

if

M f −1

and treat zif as interval-scaled

23

A Categorization of Major Clustering Methods

24

Major Clustering Approaches

and then evaluate them by some criterion

Hierarchy algorithms: Create a hierarchical

decomposition of the set of data (or objects) using

some criterion

Density-based: based on connectivity and density

functions

Grid-based: based on a multiple-level granularity

structure

Model-based: A model is hypothesized for each of

25

Partitioning Methods

26

Partitioning Algorithms: Basic

Concept

Partitioning method: Construct a partition of a

database D of n objects into a set of k clusters

Given a k, find a partition of k clusters that

optimizes the chosen partitioning criterion

Global optimal: exhaustively enumerate all

partitions

Heuristic methods: k-means and k-medoids

algorithms

k-means : Each cluster is represented by the

center of the cluster

k-medoids or PAM (Partition around medoids):

Each cluster is represented by one of the objects 27

The K-Means Clustering Method

in 4 steps:

Partition objects into k nonempty subsets

centroid is the center (mean point) of the

cluster.

Assign each object to the cluster with the

Go back to Step 2, stop when no more new

assignment.

28

The K-Means Clustering Method

Example

10 10

9 9

8 8

7 7

6 6

5 5

4 4

3 3

2 2

1 1

0 0

0 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 5 6 7 8 9 10

10 10

9 9

8 8

7 7

6 6

5 5

4 4

3 3

2 2

1 1

0 0

0 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 5 6 7 8 9 10

29

Comments on the K-Means Method

Strength

Relatively efficient: O(tkn), where n is # objects, k

<< n.

Often terminates at a local optimum. The global

deterministic annealing and genetic algorithms

Weakness

Applicable only when mean is defined, then what

Need to specify k, the number of clusters, in

advance

Unable to handle noisy data and outliers

30

Variations of the K-Means Method

A few variants of the k-means which differ in

Selection of the initial k means

Dissimilarity calculations

Replacing means of clusters with modes

categorical objects

Using a frequency-based method to update

modes of clusters

A mixture of categorical and numerical data: k-

prototype method

31

K-Medoids Clustering Method

clusters

PAM (Partitioning Around Medoids)

starts from an initial set of medoids and

iteratively replaces one of the medoids by one

of the non-medoids if it improves the total

distance of the resulting clustering

PAM works effectively for small data sets, but

does not scale well for large data sets

CLARA

CLARANS : Randomized sampling

32

K-Medoids Clustering Method

data or data in a non-vector space.

Since we cannot compute the cluster

center (think text data), we take the

“most representative” data point in the

cluster.

This data point is called the medoid (the

object that “lies in the center”).

33

PAM (Partitioning Around Medoids)

Use real object to represent the cluster

Select k representative objects arbitrarily

For each pair of non-selected object h and

selected object i, calculate the total swapping

cost TCih

For each pair of i and h,

If TCih < 0, i is replaced by h

Then assign each non-selected object to the

most similar representative object

34

PAM Clustering: Total swapping cost TCih=∑

j Cjih

10 10

9 9

j

8

t 8

t

7 7

5

j 6

4

i h 4

h

3

2

3

2

i

1 1

0 0

0 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 5 6 7 8 9 10

10

10

9

9

8

h 8

j

7

7

6

6

5

5 i

i h j

t

4

4

3

3

2

2

1

t

1

0

0

0 1 2 3 4 5 6 7 8 9 10

0 1 2 3 4 5 6 7 8 9 10

Typical k-medoids algorithm (PAM)

Total Cost = 20

10 10 10

9 9 9

8 8 8

7 7 7

6

Arbitrar 6

Assign 6

5

y 5 each 5

4 choose 4 remaini 4

3

k object 3

ng 3

2

as 2

object 2

1 1

initial to

1

0 0 0

0 1 2 3 4 5 6 7 8 9 10

medoid 0 1 2 3 4 5 6 7 8 9 10

nearest 0 1 2 3 4 5 6 7 8 9 10

s medoid

K=2 s Randomly select a

Total Cost = 26 nonmedoid

object,Oramdom

10 10

Do loop 9

8

Compute

9

8

Swapping 7 total cost 7

Until no O and 6

of 6

Oramdom

change

5 5

4

swapping 4

If quality is 3

2

3

improved. 1 1

0 0

0 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 5 6 7 8 9 10

36

CLARA (Clustering Large

Applications)

CLARA

Built in statistical analysis packages, such as

S+

It draws multiple samples of the data set, applies

PAM on each sample, and gives the best

clustering as the output

Strength: deals with larger data sets than PAM

Weakness:

Efficiency depends on the sample size

A good clustering based on samples will not

37

CLARANS (“Randomized” CLARA)

CLARANS (A Clustering Algorithm based on

Randomized Search)

CLARANS draws sample of neighbors dynamically

The clustering process can be presented as

searching a graph where every node is a potential

solution, that is, a set of k medoids

If the local optimum is found, CLARANS starts with

new randomly selected node in search for a new

local optimum

It is more efficient and scalable than both PAM and

CLARA

Focusing techniques and spatial access structures 38

Hierarchical Methods

39

Hierarchical Clustering

Use distance matrix as clustering criteria. This

method does not require the number of clusters k

as an input, but needs a termination condition

Step 0 Step 1 Step 2 Step 3 Step 4

agglomerative

(AGNES)

a ab

b abcde

c

cde

d

de

e

divisive

Step 4 Step 3 Step 2 Step 1 Step 0 (DIANA)

40

AGNES (Agglomerative Nesting)

Implemented in statistical analysis packages, e.g.,

Splus

Use the Single-Link method and the dissimilarity

matrix.

Merge nodes that have the least dissimilarity

Go on in a non-descending fashion

Eventually all nodes belong to the same cluster

10 10 10

9 9 9

8 8 8

7 7 7

6 6 6

5 5 5

4 4 4

3 3 3

2 2 2

1 1 1

0 0 0

0 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 5 6 7 8 9 10

41

A Dendrogram Shows How the

Clusters are Merged Hierarchically

partitioning (tree of clusters), called a dendrogram.

dendrogram at the desired level, then each connected

component forms a cluster.

42

DIANA (Divisive Analysis)

Splus

Inverse order of AGNES

Eventually each node forms a cluster on its own

10 10

10

9 9

9

8 8

8

7 7

7

6 6

6

5 5

5

4 4

4

3 3

3

2 2

2

1 1

1

0 0

0

0 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 5 6 7 8 9 10

0 1 2 3 4 5 6 7 8 9 10

43

More on Hierarchical Clustering

Methods

Major weakness of agglomerative clustering

methods

do not scale well: time complexity of at least

can never undo what was done previously

clustering

BIRCH (1996): uses CF-tree and incrementally

CURE (1998): selects well-scattered points from

center of the cluster by a specified fraction

CHAMELEON (1999): hierarchical clustering using 44

BIRCH

Birch: Balanced Iterative Reducing and Clustering

using Hierarchies

Incrementally construct a CF (Clustering Feature)

tree, a hierarchical data structure for multiphase

clustering

Phase 1: scan DB to build an initial in-memory CF

tree (a multi-level compression of the data that

tries to preserve the inherent clustering structure

of the data)

Phase 2: use an arbitrary clustering algorithm to

cluster the leaf nodes of the CF-tree

Scales linearly: finds a good clustering with a single

scan and improves the quality with a few additional

scans 45

Clustering Feature Vector

N: Number of data points

LS: ∑Ni=1=Xi

SS: ∑Ni=1=Xi2 CF = (5, (16,30),(54,190))

10

7

(3,4)

6

5

(2,6)

(4,5)

4

1 (4,7)

0

0 1 2 3 4 5 6 7 8 9 10

(3,8)

46

B = Max. no. of CF in a non-leaf node

L = Max. no. of CF in a leaf node

CF Tree Root

CF1 CF2 CF3 CF6

child1 child2 child3 child6

Non-leaf node

CF1 CF2 CF3 CF5

child1 child2 child3 child5

prev CF1 CF2 CF6 next prev CF1 CF2 CF4 next

47

CURE (Clustering Using

REpresentatives )

CURE:

Stops the creation of a cluster hierarchy if a

level consists of k clusters

Uses multiple representative points to evaluate

the distance between clusters, adjusts well to

arbitrary shaped clusters and avoids single-link

effect 48

Drawbacks of Distance-Based

Method

method

Consider only one point as representative of a

cluster

Good only for convex shaped, similar size and 49

Cure: Shrinking Representative

Points

y y

x x

the gravity center by a fraction of α.

Multiple representatives capture the shape of the

cluster

50

Clustering Categorical Data:

ROCK

ROCK: Robust Clustering using linKs,

Use links to measure similarity/proximity

Computational complexity:

Basic ideas: O ( n 2

+ nm m

m a + n 2

log n)

Similarity function and neighbors:

T ∩T

Let T1 = {1,2,3}, T2={3,4,5} Sim(T , T ) = 1 2

T1 ∪T2

1 2

{3} 1

Sim( T 1, T 2) = = =0.2

{1,2,3,4,5} 5

51

CHAMELEON

dynamic modeling

Measures the similarity based on a dynamic

model

Two clusters are merged only if the

between two clusters are high relative to the

internal interconnectivity of the clusters and

closeness of items within the clusters

A two phase algorithm

1. Use a graph partitioning algorithm: cluster

sub-clusters

2. Use an agglomerative hierarchical

52

Overall Framework of

CHAMELEON

Construct

Sparse Graph Partition the Graph

Data Set

Merge Partition

Final Clusters

53

Density-Based Methods

54

Density-Based Clustering

Methods

Clustering based on density (local cluster

criterion), such as density-connected points

Major features:

Discover clusters of arbitrary shape

Handle noise

One scan

condition

Several interesting studies:

DBSCAN

OPTICS

DENCLUE

CLIQUE

55

Density-Based Clustering:

Background

Two parameters:

Eps: Maximum radius of the neighbourhood

MinPts: Minimum number of points in an Eps-

neighbourhood of that point

NEps(p): {q belongs to D | dist(p,q) <= Eps}

Directly density-reachable: A point p is directly density-

reachable from a point q wrt. Eps, MinPts if

1) p belongs to NEps(q) p MinPts = 5

2) core point condition: q

Eps = 1 cm

|NEps (q)| >= MinPts

• If the ε-neighborhood of an object contains at least

minimum no. Minpts, of objects, then the object is

56

Density-Based Clustering:

Background

Density-reachable:

p

A point p is density-reachable

from a point q wrt. Eps, MinPts p1

if there is a chain of points p1, q

…, pn, p1 = q, pn = p such that

pi+1 is directly density-

reachable from pi

Density-connected p q

A point p is density-connected o

to a point q wrt. Eps, MinPts if

there is a point o such that

both, p and q are density-

reachable from o wrt. Eps and 57

DBSCAN: Density Based Spatial

Clustering of Applications with

Noise

cluster is defined as a maximal set of density-

connected points

Discovers clusters of arbitrary shape in spatial

databases with noise

Outlier

Border

Eps = 1cm

Core MinPts = 5

58

DBSCAN: The Algorithm

Retrieve all points density-reachable from p wrt

Eps and MinPts.

If p is a core point, a cluster is formed.

If p is a border point, no points are density-

reachable from p and DBSCAN visits the next

point of the database.

Continue the process until all of the points have

been processed.

59

OPTICS: A Cluster-Ordering Method

Structure

Produces a special order of the database wrt its

This cluster-ordering contains info equiv to the

broad range of parameter settings

Good for both automatic and interactive cluster

structure

Can be represented graphically or using

visualization techniques

60

OPTICS: Some Extension from

DBSCAN

Index-based:

k = number of dimensions

N = 20

p = 75% D

M = N(1-p) = 5

Complexity: O(kN2)

Core Distance p1

o

Reachability Distance

p2 o

Max (core-distance (o), d (o, p))

MinPts = 5

r(p1, o) = 2.8cm. r(p2,o) = 4cm

ε = 3 cm 61

Reachability

-distance

undefined

ε

ε

ε ‘

Cluster-order

of the objects 62

DENCLUE: using density

functions

DENsity-based CLUstEring

Major features

Solid mathematical foundation

Good for data sets with large amounts of noise

Allows a compact mathematical description of

arbitrarily shaped clusters in high-dimensional

data sets

Significant faster than existing algorithm (faster

than DBSCAN by a factor of up to 45)

But needs a large number of parameters

63

Denclue: Technical Essence

Uses grid cells but only keeps information about

grid cells that do actually contain data points

and manages these cells in a tree-based access

structure.

Influence function: describes the impact of a

data point within its neighborhood.

Overall density of the data space can be

calculated as the sum of the influence function

of all data points.

Clusters can be determined mathematically by

identifying density attractors.

Density attractors are local maximal of the 64

Gradient: The steepness of a slope

Example

d ( x , y )2

−

f Gaussian ( x , y ) = e 2σ 2

d ( x , xi ) 2

−

( x) = ∑i =1 e

D N

2σ 2

f Gaussian

d ( x , xi ) 2

−

( x, xi ) = ∑ i =1 ( xi − x) ⋅ e

N

∇f D

Gaussian

2σ 2

65

Density Attractor

66

Center-Defined and Arbitrary

67

Grid-Based Methods

68

Grid-Based Clustering Method

Using multi-resolution grid data structure

Several interesting methods

STING: (a STatistical INformation Grid

approach)

WaveCluster: A multi-resolution clustering

approach using wavelet method

CLIQUE: Clustering High-Dimensional Space

69

STING: A Statistical Information

Grid Approach

The spatial area area is divided into rectangular

cells

There are several levels of cells corresponding to

different levels of resolution

70

STING: A Statistical

Information Grid Approach

Each cell at a high level is partitioned into a number

of smaller cells in the next lower level

Statistical info of each cell is calculated and stored

beforehand and is used to answer queries

Parameters of higher level cells can be easily

calculated from parameters of lower level cell

count, mean, s, min, max

queries

Start from a pre-selected layer—typically with a

small number of cells

For each cell in the current level compute the

confidence interval 71

STING: A Statistical

Information Grid Approach

Remove the irrelevant cells from further

consideration

When finish examining the current layer,

proceed to the next lower level

Repeat this process until the bottom layer is

reached

Advantages:

Query-independent, easy to parallelize,

incremental update

O(K), where K is the number of grid cells at

Disadvantages:

All the cluster boundaries are either

WaveCluster

A multi-resolution clustering approach which

applies wavelet transform to the feature space

A wavelet transform is a signal processing

technique that decomposes a signal into

different frequency sub-band.

Both grid-based and density-based

Input parameters:

# of grid cells for each dimension

the wavelet, and the # of applications of

wavelet transform.

73

What is Wavelet

74

WaveCluster

How to apply wavelet transform to find clusters

Summaries the data by imposing a

multidimensional grid structure onto data

space

These multidimensional spatial data objects

space

Apply wavelet transform on feature space to

Apply wavelet transform multiple times which

to coarse

75

What Is Wavelet

76

Quantization

77

Transformation

78

WaveCluster

Why is wavelet transformation useful for

clustering

Unsupervised clustering

where points cluster, but simultaneously to

suppress weaker information in their boundary

Multi-resolution

Cost efficiency

Major features:

Complexity O(N)

scales 79

CLIQUE (Clustering In QUEst)

Automatically identifying subspaces of a high

dimensional data space that allow better clustering

than original space

CLIQUE can be considered as both density-based

and grid-based

It partitions each dimension into the same

number of equal length interval

It partitions an m-dimensional data space into

non-overlapping rectangular units

A unit is dense if the fraction of total data points

contained in the unit exceeds the input model

parameter

A cluster is a maximal set of connected dense 80

CLIQUE: The Major Steps

Partition the data space and find the number of

points that lie inside each cell of the partition.

Identify the subspaces that contain clusters using

the Apriori principle

Identify clusters:

Determine dense units in all subspaces of

interests

Determine connected dense units in all

subspaces of interests.

Generate minimal description for the clusters

Determine maximal regions that cover a cluster

Determination of minimal cover for each cluster 81

Salary

(10,000)

τ=3

0 1 2 3 4 5 6 7

20

30

40

S

50

a l a r

Vacation

y

60

age

30

Vacation

(week)

50

0 1 2 3 4 5 6 7

20

30

40

age

50

60

age

82

Strength and Weakness of

CLIQUE

Strength

It automatically finds subspaces of the highest

exist in those subspaces

It is insensitive to the order of records in input

distribution

It scales linearly with the size of input and has

in the data increases

Weakness

The accuracy of the clustering result may be

Model-Based Clustering Methods

84

Model-Based Clustering

Methods

Attempt to optimize the fit between the data and

some mathematical model

Statistical and AI approach

Conceptual clustering

A form of clustering in machine learning

Produces a classification scheme for a set of unlabeled

objects

Finds characteristic description for each concept (class)

COBWEB

A popular a simple method of incremental conceptual

learning

Creates a hierarchical clustering in the form of a

classification tree

Each node refers to a concept and contains a

85

COBWEB Clustering

Method

A classification tree

86

More on Statistical-Based

Clustering

Limitations of COBWEB

The assumption that the attributes are

because correlation may exist

Not suitable for clustering large database data

distributions

CLASSIT

an extension of COBWEB for incremental

suffers similar problems as COBWEB

AutoClass

Uses Bayesian statistical analysis to estimate

Popular in industry

87

Other Model-Based

Clustering Methods

Neural network approaches

Represent each cluster as an exemplar, acting

New objects are distributed to the cluster

to some distance measure

Competitive learning

Involves a hierarchical architecture of several

units (neurons)

Neurons compete in a “winner-takes-all”

presented

88

Model-Based Clustering Methods

89

Self-organizing feature maps

(SOMs)

several units competing for the current

object

The unit whose weight vector is closest to

the current object wins

The winner and its neighbors learn by

having their weights adjusted

SOMs are believed to resemble

processing that can occur in the brain

Useful for visualizing high-dimensional

data in 2- or 3-D space

90

Outlier Analysis

91

What Is Outlier Discovery?

What are outliers?

The set of objects are considerably dissimilar

Example: Sports: Michael Jordon, Wayne

Gretzky, ...

Problem

Find top n outlier points

Applications:

Credit card fraud detection

Customer segmentation

Medical analysis

92

Outlier Discovery:

Statistical

Approaches

generates data set (e.g. normal distribution)

Use discordancy tests depending on

data distribution

Drawbacks

most tests are for single attribute

known 93

Outlier Discovery: Distance-

Based Approach

imposed by statistical methods

We need multi-dimensional analysis without

Distance-based outlier: A DB(p, D)-outlier is an

object O in a dataset T such that at least a

fraction p of the objects in T lies at a distance

greater than D from O

Algorithms for mining distance-based outliers

Index-based algorithm

Nested-loop algorithm

Cell-based algorithm

94

Outlier Discovery: Deviation-

Based Approach

Identifies outliers by examining the main

characteristics of objects in a group

Objects that “deviate” from this description are

considered outliers

sequential exception technique

simulates the way in which humans can

distinguish unusual objects from among a

series of supposedly like objects

OLAP data cube technique

uses data cubes to identify regions of

anomalies in large multidimensional data

95

Problems and Challenges

Considerable progress has been made in scalable

clustering methods

Partitioning: k-means, k-medoids, CLARANS

Hierarchical: BIRCH, CURE

Density-based: DBSCAN, CLIQUE, OPTICS

Grid-based: STING, WaveCluster

Model-based: Autoclass, Denclue, Cobweb

Current clustering techniques do not address all

the requirements adequately

Constraint-based clustering analysis: Constraints

exist in data space (bridges and highways) or in

96

Constraint-Based Clustering

Analysis

desired constraints, e.g., an ATM allocation problem

97

- Chapter 3Uploaded byZiad Al-otaibi
- Midterm Review SolutionUploaded bynurnuraddin
- Data Warehousing and Data MiningUploaded bykingloky
- Chap8 Basic Cluster AnalysisUploaded byapi-3717234
- Machine LearningUploaded byLDaggerson
- Assosiation RuleUploaded byNaglaa Mostafa
- k-Means Clustering, Hierarchical ClusteringUploaded byakirank1
- Data Mining Homework 1Uploaded byJoseph Chang
- ClusteringUploaded bylalith_nandana
- Data Warehousing and Data Mining_handbookUploaded bymannanabdulsattar
- Ch3 Data PreprocessingUploaded byCheri Fille
- Chapter 3 ExercisesUploaded byShaun KidGhost Claasen
- Cluster AnalysisUploaded byAllison Collier
- chap9_advanced_cluster_analysisUploaded byWenxiao Gu
- Factor AnalysisUploaded byjaya1117sarkar
- ch07Uploaded bynischitha87
- AB1202-ILE-10-Wk-13-Lect13-SOLUTIONS-20180215 (1)Uploaded byBryan 林裕强
- Homework2 SolUploaded byYavuz Sayan
- Decision Tree & TechniquesUploaded byjain
- Master Opp GaveUploaded bycompaq1501
- Document Clustering in Correlation SimilarityUploaded byshtl2901
- DMDW-Solution for Unit 1-5Uploaded byManish Arya
- Digital mage processing ClusteringUploaded byNazakat Ali
- Solutions to II Unit Exercises From KamberUploaded byjyothibellaryv
- Clustering(26.9.12)Uploaded bypriyasuji1
- Chapter 7Uploaded bymehmetgunn
- Class 6 Cluster AnalysisUploaded byapi-3697538
- PaperUploaded byprateek
- IJETR031236Uploaded byerpublication

- 7 ClassificationUploaded bysunnynnus
- Smart Vehicle Information Tracking System Introduction: Svits is a MobileUploaded bysunnynnus
- AssociationUploaded bysunnynnus
- Pro LoadUploaded bysunnynnus
- Keil SoftwareUploaded bysunnynnus
- CCC Exams PostponedUploaded bysunnynnus
- LDR: LDRs or Light Dependent Resistors Are Very Useful EspeciallyUploaded bysunnynnus
- Defragmented File System DocumentationUploaded bysunnynnus
- Data Mining: Concepts and TechniquesUploaded bysunnynnus
- Data MiningUploaded bysunnynnus
- Port DescriptionUploaded bysunnynnus
- cseUploaded byapi-3798998
- cseUploaded byapi-3798998
- MadUploaded bysunnynnus
- 3 Prep 2Uploaded bysunnynnus
- chap03_2Uploaded bysunnynnus
- p44Uploaded bysunnynnus
- chap02_2Uploaded bysunnynnus
- chap03_1Uploaded bysunnynnus
- p66Uploaded byRajesh Cool
- chap03_3Uploaded bysunnynnus
- p222Uploaded bysunnynnus
- p222Uploaded bysunnynnus
- Grams: “TECHNOLOGY” Phone: Off: +91–40–23156113 Fax: +91–40–23156113 E Mail: Dejntuh@Gmail.comUploaded bysunnynnus
- Grams: “TECHNOLOGY” Phone: Off: +91–40–23156113 Fax: +91–40–23156113 E Mail: Dejntuh@Gmail.comUploaded bysunnynnus
- cseUploaded byapi-3798998
- AIM: 3. Create and Save AnXML Document at the Server,WhichUploaded bysunnynnus
- p55Uploaded bysunnynnus
- chap02_3Uploaded bysunnynnus

- A Comparative Study of ACO, GA and SA for TSPUploaded bySharad Kumbharana
- Paper 10- Survey of Nearest Neighbor Condensing TechniquesUploaded byEditor IJACSA
- Assignment IB Stack Queue SolutionsUploaded byKashif Amjad
- Heuristic Search Techniques in Video-Game Pathfinding- A Survey of Issues and Techniques by(1)Uploaded byijr_journal
- Decision Tree ReportUploaded byIshan Dalmia
- What is the Best Book to Learn Data Structures Using JavaUploaded byg26720038462
- NCM: Neutrosophic c-means clustering algorithmUploaded byMia Amalia
- amortized.pdfUploaded bySubhajit Bhattacharyya
- Algorithmic ComplexityUploaded byMuhammad Kaife Uddin
- Data Structure NotesUploaded byGaurav Agrawal
- ArmUploaded byAditya Phatak
- BU ROSA TUGAS AKHIR.docxUploaded byKrens Krisal Kapitarauw
- Data Structures Using CUploaded byVikram Rao
- system verilog queue conceptUploaded byKeerthiKalyan
- NelderMeadProofUploaded bySuresh Kumar
- MIT6 832s09 Exam01 PracticeUploaded byPiero Raurau
- Particle Swarm OptimizationUploaded byChristopher Herring
- External SortingUploaded bySheeba Elavarasi
- 2355 Big m SupplementUploaded byAshraf Rios Khater
- Actp Iori Route 2011 (Slides)Uploaded byEduardo Moreira
- AIAliUploaded byrobindiv
- Data Structure Through C Language V2Uploaded bysolvedcare
- JAVA Coding Interview Questions and AnswersUploaded byKaushal Prajapati
- Discrete Maths TreesUploaded byOcira Oyaro
- Assign 3Uploaded byVipul Gupta
- Chapter 4Uploaded byaaqlain
- Chaotic Biogeography-based Optimisation (CBBO) Algorithm - File Exchange - MATLAB CentralUploaded byTrương Xuân Quý
- International Olympiad in Informatics Training Camp notesUploaded byGovind Gopakumar
- Fast Algorithms for Projected Clustering PDFUploaded byGeorge
- Chap6 CPU SchedulingUploaded byshubham