2018
DOI: 10.1016/j.bdr.2017.09.002
|View full text |Cite
|
Sign up to set email alerts
|

Variations on the Clustering Algorithm BIRCH

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
29
0
2

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 99 publications
(31 citation statements)
references
References 5 publications
0
29
0
2
Order By: Relevance
“…The challenge when applying the hierarchical clustering methods is determining the proper distance measure. In our work, we have tested different distance measures, but there are alternative methods like A-BIRCH [35]. All of the used methods gave very similar results, so we chose the k-means method.…”
Section: Resultsmentioning
confidence: 99%
“…The challenge when applying the hierarchical clustering methods is determining the proper distance measure. In our work, we have tested different distance measures, but there are alternative methods like A-BIRCH [35]. All of the used methods gave very similar results, so we chose the k-means method.…”
Section: Resultsmentioning
confidence: 99%
“…BIRCH allowed us to determine the number of clusters based on the data (rather than specifying a fixed number of clusters) and the size of each cluster for each temporal cross-section. We ran BIRCH without specifying a number of clusters, thus using the subclusters returned by BIRCH before the final, global clustering step when the user-specified threshold value is reached (i.e., the so-called tree-BIRCH method 71 ). We adjusted this threshold empirically for each category of variables.…”
Section: Methodsmentioning
confidence: 99%
“…The models of these algorithms are not trained on previously classified data, such that the algorithms are bound to find patterns within the processed data. Wellknown algorithms in the context of clustering are for example K-Means (Shahrivari and Jalili 2016), DBScan (Junior and da Silva 2017), Self-Organizing Maps (SOM) (Valle et al 2017), BIRCH (Lorbeer et al 2018) and Topic model (Gong et al 2018). Another subfield that is often regarded as part of unsupervised learning is dimensionality reduction.…”
Section: Principal Component Analysismentioning
confidence: 99%