2021
DOI: 10.11591/ijeecs.v23.i3.pp1602-1610
|View full text |Cite
|
Sign up to set email alerts
|

Develop a dynamic DBSCAN algorithm for solving initial parameter selection problem of the DBSCAN algorithm

Abstract: <p>The amount of data has been increasing exponentially in every sector such as banking securities, healthcare, education, manufacturing, consumer-trade, transportation, and energy. Most of these data are noise, different in shapes, and outliers. In such cases, it is challenging to find the desired data clusters using conventional clustering algorithms. DBSCAN is a popular clustering algorithm which is widely used for noisy, arbitrary shape, and outlier data. However, its performance highly depends on th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 24 publications
0
4
0
Order By: Relevance
“…The Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm is a widely used clustering method known for its ability to handle noisy data, arbitrary shapes, and outlier detection (Hossain et al, 2021). DBSCAN operates based on the concept of density clustering in unsupervised learning, forming clusters by grouping closely packed data points separated by areas of low density (Lai et al, 2019).…”
Section: Results Of Machine Learning Clusteringmentioning
confidence: 99%
“…The Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm is a widely used clustering method known for its ability to handle noisy data, arbitrary shapes, and outlier detection (Hossain et al, 2021). DBSCAN operates based on the concept of density clustering in unsupervised learning, forming clusters by grouping closely packed data points separated by areas of low density (Lai et al, 2019).…”
Section: Results Of Machine Learning Clusteringmentioning
confidence: 99%
“…Points that are within a chain of distance ε are considered density-reachable and density-connected; notably, point Z can be density-reachable from point X. Thus, this method creates clusters by connecting core points and their neighbors in dense regions within a distance of ε [ 66 ].…”
Section: Methodsmentioning
confidence: 99%
“…The fitness function is applied to determine the best values of both parameters. Another interesting work in determining the two DBSCAN parameters is done by Hossain et al [15] in which the mean value of the distance for a data point to all other points is calculated and this is repeated for all data points. The data point with the smallest minimum value is considered as having the highest density.…”
Section: Related Workmentioning
confidence: 99%