Scribd
Upload
11 views

Density

Uploaded by

ishita.sengupta.06
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

Density

Uploaded by

ishita.sengupta.06
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Density-based clustering in data minin

Density-based clustering refers to a method that is based on local cluster criterion,


such as density connected points. In this tutorial, we will discuss density-based
clustering with examples.

What is Density-based clustering?


Density-Based Clustering refers to one of the most popular unsupervised learning
methodologies used in model building and machine learning algorithms. The data
points in the region separated by two clusters of low point density are considered as
noise. The surroundings with a radius ε of a given object are known as the ε
neighbourhood of the object. If the ε neighbourhood of the object comprises at least
a minimum number, MinPts of objects, then it is called a core object.

Density-Based Clustering - Background


There are two different parameters to calculate the density-based clustering

EPS: It is considered as the maximum radius of the neighbourhood.

MinPts: MinPts refers to the minimum number of points in an Eps neighborhood of that
point.

NEps (i) : { k belongs to D and dist (i,k) < = Eps}

Directly density reachable:

A point i is considered as the directly density reachable from a point k with respect to Eps,
MinPts if

i belongs to NEps(k)

Core point condition:

NEps (k) >= MinPts


Density reachable:

A point denoted by i is a density reachable from a point j with respect to Eps, MinPts if there
is a sequence chain of a point i1,…., in, i1 = j, pn = i such that ii + 1 is directly density
reachable from ii.

Density connected:

A point i refers to density connected to a point j with respect to Eps, MinPts if there is a point
o such that both i and j are considered as density reachable from o with respect to Eps and
MinPts.
Working of Density-Based Clustering
Suppose a set of objects is denoted by D', we can say that an object I is directly density
reachable form the object j only if it is located within the ε neighborhood of j, and j is a core
object.

An object i is density reachable form the object j with respect to ε and MinPts in a given set
of objects, D' only if there is a sequence of object chains point i1,…., in, i1 = j, pn = i such
that ii + 1 is directly density reachable from ii with respect to ε and MinPts.

An object i is density connected object j with respect to ε and MinPts in a given set of
objects, D' only if there is an object o belongs to D such that both point i and j are density
reachable from o with respect to ε and MinPts.

Major Features of Density-Based Clustering


The primary features of Density-based clustering are given below.

o It is a scan method.
o It requires density parameters as a termination condition.
o It is used to manage noise in data clusters.
o Density-based clustering is used to identify clusters of arbitrary size.

Density-Based Clustering Methods


DBSCAN

You might also like