Difference between STING and OPTICS
The method of identifying similar groups of data in a data set is called clustering. Entities in each group are comparatively more similar to entities of that group than those of the other groups.
STING (Statistical Information Grid Clustering Algorithm) and OPTICS (Ordering Point To Identify Clustering Structure Clustering Algorithm) are clustering algorithms used in Unsupervised Learning. They are machine learning techniques which are used to club the given input data points into clusters or groups on the basis of their attributes. STING is grid-based clustering algorithm while OPTICS is a density-based clustering algorithm. Clustering
These are some differences between STING and OPTICS.
|1.||STING is abbreviation for Statistical Information Grid||OPTICS is abbreviation for Ordering Point To Identify Clustering Structure|
|2.||It is grib based clustering algorithm||It is density based clustering algorithm|
|3.||It concerns not with data points but with the value space that surrounds the data points.||It searches the data space for areas of varied density data points in the data space.|
|4.||It uses multi-dimensional grid data structure that quantizes space into a finite number of cells.||It is an extension to Density Based spatial clustering of applications with noise.|
The following are the properties of STING clustering algorithm:
The following are the properties of OPTICS clustering algorithm:
|6.||It has relatively less computational complexity.||It has relatively more computational complexity.|
- Determine a layer, to begin with.
- For each cell of this layer, we calculate the confidence interval (or estimated range) of probability that this cell is relevant to the query.
- From the interval calculate above, we label the cell as relevant or not relevant.
- If this is the bottom layer, then end the process.
- We go down the hierarchy structure by one level. Go to Step 2 for those levels that form the relevant cells of the higher-level layer.
STING Hierarchy Diagram :
Core distance of a point P is the smallest distance such that the neighborhood of P has atleast minPts points.
Reachability distance of p from q1 is the core distance ( ε’ ).
Reachability distance of p from q2 is the euclidean distance between p and q2.
Please Login to comment...