2022 21st IEEE International Conference on Machine Learning and Applications (ICMLA) 2022
DOI: 10.1109/icmla55696.2022.00036
|View full text |Cite
|
Sign up to set email alerts
|

Fair Algorithms for Hierarchical Agglomerative Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…Furthermore, these algorithms exhibit two notable benefits compared to non-hierarchical or flat clustering techniques: 1) they do not require an initial specification of the number of clusters; and 2) they generate a hierarchy of all samples in the dataset. [41]. Unsupervised Classification (ISO) We are applying the Maximum Likelihood Classification and ISO Cluster tools on a sequence of input raster bands in order to perform unsupervised Classification.…”
Section: Unsupervised Classification Techniquesmentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, these algorithms exhibit two notable benefits compared to non-hierarchical or flat clustering techniques: 1) they do not require an initial specification of the number of clusters; and 2) they generate a hierarchy of all samples in the dataset. [41]. Unsupervised Classification (ISO) We are applying the Maximum Likelihood Classification and ISO Cluster tools on a sequence of input raster bands in order to perform unsupervised Classification.…”
Section: Unsupervised Classification Techniquesmentioning
confidence: 99%
“…Riyad Ghafel Abdul Hussein Al Khafaji., Wasit Journal of Computer and Mathematics Science Vol. 3 No.1 (2024) p [40][41][42][43][44][45][46][47][48][49][50]…”
mentioning
confidence: 99%
“…, where h denotes the cost in the minimum cost flow they employed. Additionally, fair hierarchical agglomerative clustering, introduced by Chhabra et al [39], has a computational complexity of O(mn 3 ).…”
Section: Computational Complexitymentioning
confidence: 99%