2019
DOI: 10.3390/electronics8101094
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Algorithm for Identifying Density-Based Clustering Structures Using a Constraint Graph

Abstract: OPTICS is a state-of-the-art algorithm for visualizing density-based clustering structures of multi-dimensional datasets. However, OPTICS requires iterative distance computations for all objects and is thus computed in O ( n 2 ) time, making it unsuitable for massive datasets. In this paper, we propose constrained OPTICS (C-OPTICS) to quickly create density-based clustering structures that are identical to those by OPTICS. C-OPTICS uses a bi-directional graph structure, which we refer to as the c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…, b i represents the minimum average distance of the sample µ i within a cluster from all other clusters. For the evaluation of the performance of the proposed method (IDBSCAN), the results have been compared to those of the DBSCAN, OPTICS and PAPC-DBSCAN [36][37][38]. Among them, in DBSCAN, set ε = 0.5, MinPts = 4; in OPTICS, set ε = 0.5, MinPts = 4, ξ = 0.02; in PAPC-DBSCAN, set kpick = 0.15, kdrop = 0.15, α = 4, γ = 0.3, MinPts = 5; in IDBSCAN, set the number of wolves as 30 and the number of iterations as 300.…”
Section: Analysis Of Clustering Results For Painting Objectsmentioning
confidence: 99%
“…, b i represents the minimum average distance of the sample µ i within a cluster from all other clusters. For the evaluation of the performance of the proposed method (IDBSCAN), the results have been compared to those of the DBSCAN, OPTICS and PAPC-DBSCAN [36][37][38]. Among them, in DBSCAN, set ε = 0.5, MinPts = 4; in OPTICS, set ε = 0.5, MinPts = 4, ξ = 0.02; in PAPC-DBSCAN, set kpick = 0.15, kdrop = 0.15, α = 4, γ = 0.3, MinPts = 5; in IDBSCAN, set the number of wolves as 30 and the number of iterations as 300.…”
Section: Analysis Of Clustering Results For Painting Objectsmentioning
confidence: 99%
“…4) Density models, which search the data space for areas of varying density of data points in the data space. Examples of these models are DBSCAN and OPTIC (Kim et al, 2019).…”
Section: The Choice Of Clustersmentioning
confidence: 99%