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

A novel graph-based clustering method using noise cutting

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 15 publications
0
7
0
Order By: Relevance
“…The CutPC algorithm contains only one free parameter, the tuning coefficient α. While the authors (Li et al 2020) note that α = 1 should be suitable for most data sets, they observed that sometimes a better clustering is obtained when α is different. Therefore, for the considered GRB samples, the range α ∈ [0, 2] was swept with a step ∆α = 0.01.…”
Section: Cutpcmentioning
confidence: 97%
See 2 more Smart Citations
“…The CutPC algorithm contains only one free parameter, the tuning coefficient α. While the authors (Li et al 2020) note that α = 1 should be suitable for most data sets, they observed that sometimes a better clustering is obtained when α is different. Therefore, for the considered GRB samples, the range α ∈ [0, 2] was swept with a step ∆α = 0.01.…”
Section: Cutpcmentioning
confidence: 97%
“…The CutPC algorithm (Li et al 2020) starts by constructing a variant of the kNN graph, that is, the natural neighbour (NaN) graph (NNG; Huang et al 2016). Two vertices u and v are considered to be NaNs if u is a neighbour of v and vice versa.…”
Section: Cutpcmentioning
confidence: 99%
See 1 more Smart Citation
“…The CutPC algorithm (Li et al 2020) starts by constructing a variant of the kNN graph, that is, the natural neighbour (NaN) graph (NNG; Huang et al 2016). Two vertices u and v are considered to be NaNs if u is a neighbour of v and vice versa.…”
Section: Cutpcmentioning
confidence: 99%
“…Outlier detection has an extensive range of applications in many fields: bank fraud [2]- [4], video surveillance [5]- [8], network anomalies [9]- [11], finding new celestial objects [12], [13], etc. The available outlier detection algorithms can be broadly classified into: distance-based algorithms [14]- [17], density-based algorithms [18]- [20], clustering-based algorithms [21], [22], statistical methods [23], integration-based methods [24], numerous neural network-based algorithms [25] and graph-based algorithms [26] etc. Most graph algorithms only work on graph-structured data, and the same goes for GCN [27].…”
Section: Introductionmentioning
confidence: 99%