2020
DOI: 10.1109/tim.2019.2919375
|View full text |Cite
|
Sign up to set email alerts
|

Damage Localization of Stacker’s Track Based on EEMD-EMD and DBSCAN Cluster Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2020
2020
2025
2025

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 37 publications
(7 citation statements)
references
References 39 publications
0
7
0
Order By: Relevance
“…An improved DBSCAN algorithm is implemented at visible light communication systems to improve the signal-to-noise ratio and weaken the damage of noise to the communication quality [24]. A few more studies utilizing the DBSCAN algorithm in different fields of research can be found in very recent works [25][26][27][28]. On the other hand, importantly, the recent article [29] searches a way to determine the correct values of the DBSCAN parameters, by detecting the sharp increase in distance.…”
Section: Methodsmentioning
confidence: 99%
“…An improved DBSCAN algorithm is implemented at visible light communication systems to improve the signal-to-noise ratio and weaken the damage of noise to the communication quality [24]. A few more studies utilizing the DBSCAN algorithm in different fields of research can be found in very recent works [25][26][27][28]. On the other hand, importantly, the recent article [29] searches a way to determine the correct values of the DBSCAN parameters, by detecting the sharp increase in distance.…”
Section: Methodsmentioning
confidence: 99%
“…The classical DBSCAN algorithm defines clusters as dense regions, separated by regions of lower density (Li et al , 2020; Sabo and Scitovski, 2020b). The DBSCAN algorithm has two global parameters: the maximum radius range ( Eps ) and the minimum number of neighbors ( MinPts ).…”
Section: Related Work On Dbscan Ap and Rough Set Theorymentioning
confidence: 99%
“…For instance, algorithms such as K-means (Hartigan and Wong, 1979) and Clustering Large Applications based on Randomized Search (CLARANS) (Ng and Han, 2002) were designed based on a partitioning approach; Gaussian mixture models (Fraley and Raftery, 2002) and COBWEB (Fisher, 1987) belong to a model-based approach; Divisive Analysis (DIANA) (Kaufman and Rousseeuw, 1990) and Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH) (Zhang et al , 1996) were developed based on a hierarchical approach; Statistical Information Grid (STING) (Wang et al , 1997) and Clustering in Quest (CLIQUE) (Agrawal et al , 1998) were introduced as a grid-based approach; and Density-Based Spatial Clustering of Applications with Noise (DBSCAN) (Ester et al , 1996) and its variant Ordering Points to Identify the Clustering Structure (OPTICS) (Ankerst et al , 1999) are examples of a density-based approaches. Due to the fact that density-based clustering returns clusters of an arbitrary shape, is robust to noise and does not require prior knowledge on the number of clusters, DBSCAN has been widely applied in numerous fields (Li et al , 2020; Sabo and Scitovski, 2020a; Gan and Tao, 2018).…”
Section: Introductionmentioning
confidence: 99%
“…EEMD represents an extension of EMD. During EEMD decomposition, the noise added into the original signals cannot be eliminated, which may cause reconstruction errors [ 32 ]. On the basis of EEMD, CEEMDAN was proposed by Colominas et al for further elimination of the mode mixing phenomenon.…”
Section: Review Of Ceemdanmentioning
confidence: 99%