# OPTICS algorithm

## Algorithm for finding density based clusters in spatial data / From Wikipedia, the free encyclopedia

#### Dear Wikiwand AI, let's keep it short by simply answering these key questions:

Can you list the top facts and stats about OPTICS algorithm?

Summarize this article for a 10 year old

**Ordering points to identify the clustering structure** (**OPTICS**) is an algorithm for finding density-based[1] clusters in spatial data. It was presented by Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel and Jörg Sander.[2]
Its basic idea is similar to DBSCAN,[3] but it addresses one of DBSCAN's major weaknesses: the problem of detecting meaningful clusters in data of varying density. To do so, the points of the database are (linearly) ordered such that spatially closest points become neighbors in the ordering. Additionally, a special distance is stored for each point that represents the density that must be accepted for a cluster so that both points belong to the same cluster. This is represented as a dendrogram.

Part of a series on |

Machine learning and data mining |
---|

Problems |

Learning with humans |

Model diagnostics |

Oops something went wrong: