OPTICS algorithm
Algorithm for finding density based clusters in spatial data
Ordering points to identify the clustering structure (OPTICS) is an algorithm for finding density-based clusters in spatial data. It was presented in 1999 by Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel and Jörg Sander.
Nº Q2007847 ★
Common · Knowledge
OPTICS algorithm
Algorithm for finding density based clusters in spatial data
Ordering points to identify the clustering structure (OPTICS) is an algorithm for finding density-based clusters in spatial data. It was presented in 1999 by Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel and Jörg Sander.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
Ordering points to identify the clustering structure (OPTICS) is an algorithm for finding density-based clusters in spatial data. It was presented in 1999 by Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel and Jörg Sander. Its basic idea is similar to DBSCAN, 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.
Text: Wikipédia, CC BY-SA 4.0. · Image: Chire (Public domain) ·
Related cards
-
Atmospheric optics
Academic discipline
Nº Q1367365 ★★
Not listed
-
Fourier optics
Study of classical optics using Fourier transforms
Nº Q1003236 ★
Not listed
-
Particle swarm optimization
Optimization method using a set of candidate solutions moving around in the search-space
Nº Q2072794 ★★
Not listed
-
Geometrical optics
Model of optics describing light as geometric rays
Nº Q467980 ★★
Not listed
-
Dynamic programming
Problem optimization method that simplifies a complicated problem by decomposing it into simpler subproblems recursively
Nº Q380679 ★★★
Not listed
-
P
Partition problem
NP-complete problem in computer science
Nº Q1065968 ★
Not listed
-
B
Broyden–Fletcher–Goldfarb–Shanno algorithm
Optimization method
Nº Q2877013 ★
Not listed
-
Optical path
Path taken by light in traversing a system
Nº Q1417028 ★
Not listed
-
K
Kabsch algorithm
Type of algorithm
Nº Q6344361 ★
Not listed
-
Ordinary least squares
Method for estimating the unknown parameters in a linear regression model
Nº Q2912993 ★★★
Not listed
-
Lloyd's algorithm
Method for creating geometric centroidal tessellations from points
Nº Q2835805 ★
Not listed
-
Otsu's method
Automatic image thresholding method
Nº Q2444417 ★★
Not listed
-
L
Lattice problem
Optimization problem in computer science
Nº Q6497128 ★
Not listed
-
B
BIRCH
Clustering algorithm
Nº Q4835721 ★★
Not listed
-
D
Dynamic dispatch
Process of selecting which implementation of a polymorphic operation (method or function) to call at run time
Nº Q1268939 ★
Not listed
-
I
IOPS
Input/output performance measurement used to characterize computer storage devices
Nº Q539454 ★
Not listed
-
O
Okapi BM25
Ranking function used by search engines
Nº Q2068750 ★★★
Not listed
-
Opponent process
Theory
Nº Q303997 ★
Not listed