Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

OPTICS Algorithm

Machine Learning Algorithm

Ordering points to identify the clustering structure, or OPTICS, is an algorithm for finding density-based clusters in spatial data, presented in 1999 by Mihael Ankerst, Markus Breunig, Hans-Peter Kriegel and Jorg Sander. Its basic idea is similar to DBSCAN, but it addresses one of that algorithm's major weaknesses, the difficulty of detecting meaningful clusters in data of varying density, by linearly ordering the points of the database so that spatially closest points become neighbors in the ordering and by storing, for each point, a special distance representing the density that must be accepted for a cluster so that both points belong to it, a structure that can be represented as a dendrogram.

Facts
Time Complexity
Time Complexity (category)
Quadratic Time -- O(n^2) 1
Connections

Credited To

Source OPTICS algorithm (Wikipedia)

In Field

Source OPTICS algorithm (Wikipedia)

Invented By

Source OPTICS algorithm (Wikipedia)

Preceded By

DBSCAN Algorithm, Algorithms

Verified en.wikipedia.org/wiki/OPTICS_algorithm: "Its basic idea is similar to DBSCAN, but it addresses one of DBSCAN's major weaknesses." OPTICS is the later, same-authors extension of DBSCAN.

Sources
1. OPTICS algorithm (Wikipedia)
  • Lead section
    Ordering points to identify the clustering structure (OPTICS) is an algorithm for finding density-based clusters in spatial data.
  • Credited To: Hans-Peter Kriegel, Lead
    It was presented in 1999 by Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel and Jörg Sander.
  • Invented By: Hans-Peter Kriegel, Lead
    It was presented in 1999 by Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel and Jörg Sander.
  • In Field: Machine Learning, Lead sentence
    Ordering points to identify the clustering structure (OPTICS) is an algorithm for finding density-based clusters in spatial data.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.