Scribd
Upload
16K views10 pages

OPTICS: Ordering Points To Identify The Clustering Structure

OPTICS is an algorithm that extends DBSCAN to identify variable density clusters. It requires only one input parameter, MinPts, while Eps can be considered infinite. OPTICS creates an ordering of database objects based on their core and reachability distances to represent the clustering structure. This ordering allows clusters with higher densities to be contained within clusters of lower densities. The algorithm calculates core and reachability distances for each object to determine cluster membership. The reachability plot generated by OPTICS is insensitive to input parameters, with smaller Eps/larger MinPts producing a more jagged plot.

Uploaded by

Rohit Paul
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
16K views10 pages

OPTICS: Ordering Points To Identify The Clustering Structure

OPTICS is an algorithm that extends DBSCAN to identify variable density clusters. It requires only one input parameter, MinPts, while Eps can be considered infinite. OPTICS creates an ordering of database objects based on their core and reachability distances to represent the clustering structure. This ordering allows clusters with higher densities to be contained within clusters of lower densities. The algorithm calculates core and reachability distances for each object to determine cluster membership. The reachability plot generated by OPTICS is insensitive to input parameters, with smaller Eps/larger MinPts producing a more jagged plot.

Uploaded by

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

OPTICS: Ordering Points To

Identify the Clustering Structure


Presented By:
Rohit Paul
 Disadvantages of DBSCAN
 Requires two user inputs(Eps and MinPts)
 Unable to determine variable density cluster

 OPTICS:
 Able to get variable density cluster
 Mainly requires one inputs (i.e, MinPts)
 Eps can be considered as ‘infinite’
Idea
 Creates an augmented ordering of the database representing its
density-based clustering structure
 Help us gain a high level understanding of the way data is
structured
Observation
 For a constant MinPts value, density-based clusters
with higher density are completely contained in
density-connected sets with respect to a lower density.

 Extend the DBSCAN algorithm such that several


distance parameters are processed at the same time
OPTICS
 An infinite number of distance parameters eps’ which
are smaller than a “generating distance” eps (i.e.
0 <= eps’ <= eps).
 Order is stored in which the objects are processed and
the information which would be used by an extended
DBSCAN algorithm to assign cluster memberships
 This information consists of only two values for each
object: the core-distance and a reachability-distance
Terminology
 Core distance of an object p:
 The core-distance of an object p is simply the smallest distance
eps’ between p and an object in its e-neighborhood such that p
would be a core object with respect to eps’ if this neighbor is
contained in Ne(p).
 Reachability-distance object p w.r.t. object o:
 Reachability-distance of an object p with respect to another
object o is the smallest
distance such that p is directly
density-reachable from o if o is
a core object
Algorithm
 FOR i FROM 1 TO SetOfObjects.size DO
 IF NOT Object.Processed THEN
1. neighbors := SetOfObjects.neighbors(Object, e);
2. Object.Processed := TRUE;
3. Object.reachability_distance := UNDEFINED;
4. Object.setCoreDistance(neighbors, e, MinPts);
5. OrderedFile.write(Object);
6. IF Object.core_distance <> UNDEFINED THEN
 OrderSeeds.update(neighbors, Object);
 WHILE NOT orderSeeds.empty() DO
 Repeat Step 1, 2, 4, 5 and 6
 If reachability-distance of the current object Object is
larger than the clustering-distance eps’
 Object is not density-reachable from any of the objects
which are located before the current object in the cluster-
ordering.
 We look at the core-distance of Object and start a new cluster
if Object is a core object with respect to eps’ and MinPts;
otherwise, Object is assigned to NOISE
 If reachability-distance of the current object is smaller
than eps’
 Can simply assign this object to the current cluster because
then it is density-reachable from a preceding core object in
the cluster-ordering.
Reachability plot insensitive to input
parameter

• The smaller the Eps


value, the more objects
have an UNDEFINED
reachability-distance
• Lower values MinPts
reachability-plot looks
more jagged and higher
value smoothen the
curve.
Thank You

You might also like