« Algorithme OPTICS » : différence entre les versions
(Page créée avec « ==en construction== == Définition == XXXXXXXXX == Français == ''' XXXXXXXXX ''' == Anglais == ''' OPTICS algorithm''' Ordering points to identify the clustering stru... ») |
m (Imeziani a déplacé la page OPTICS algorithm vers Algorithme OPTICS) |
(Aucune différence)
| |
Version du 29 novembre 2021 à 11:36
en construction
Définition
XXXXXXXXX
Français
XXXXXXXXX
Anglais
OPTICS algorithm
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.
Contributeurs: Imane Meziani, wiki
