2022
DOI: 10.1016/j.is.2021.101871
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchical clustering that takes advantage of both density-peak and density-connectivity

Abstract: This paper focuses on density-based clustering, particularly the Density Peak (DP) algorithm and the one based on density-connectivity DBSCAN; and proposes a new method which takes advantage of the individual strengths of these two methods to yield a density-based hierarchical clustering algorithm. We first formally define the types of clusters DP and DBSCAN are designed to detect; and then identify the kinds of distributions that DP and DBSCAN individually fail to detect all clusters in a dataset. These ident… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 15 publications
(5 citation statements)
references
References 30 publications
0
5
0
Order By: Relevance
“…Players were considered to be within congestion if identified as core points, while players were deemed outside congestion if recorded as noise. Clusters of congestion were originally assigned output labels of 0- n , while -1 was assigned to all points clustered as noise (see Fig 1 ) [ 20 , 21 ]. These labels where converted to provide a practical description of congestion and to differentiate between separate clusters of congestion if more than one cluster was identified for a unique time interval (see Fig 1 ).…”
Section: Methodsmentioning
confidence: 99%
“…Players were considered to be within congestion if identified as core points, while players were deemed outside congestion if recorded as noise. Clusters of congestion were originally assigned output labels of 0- n , while -1 was assigned to all points clustered as noise (see Fig 1 ) [ 20 , 21 ]. These labels where converted to provide a practical description of congestion and to differentiate between separate clusters of congestion if more than one cluster was identified for a unique time interval (see Fig 1 ).…”
Section: Methodsmentioning
confidence: 99%
“…Since the introduction of the DPC, there have been many hierarchical clustering algorithms that incorporate DPC. For example, DC-HDP [25] combines the strengths of DPC and DBSCAN to achieve the goal of identifying clusters with complex structures and density variations. HCFS [26] aims to address the distribution issue of data points within clusters.…”
Section: Hierarchical Clusteringmentioning
confidence: 99%
“…Hierarchical clustering methods are the simplest and most fundamental methods and famously play an important role in statistical data analysis (Johnson, 1967). They are relatively fast and easy to understand and implement (Zhu et al, 2022). The autoencoder has the ability to reduce the dimension of the input in a hierarchical way, leading to high-quality reconstructions of data (Tewari et al, 2017;Zhao et al, 2017).…”
Section: The Pollution Area Using Machine Learningmentioning
confidence: 99%