K-DGHC: A hierarchical clustering method based on K-dominance granularity
B Yu, Z Zheng, J Dai - Information Sciences, 2023 - Elsevier
Existing hierarchical clustering (HC) algorithms generally depend on the Euclidean
characteristic metric (Euclidean distance, Manhattan distance, Chebyshev distance, etc.) on …
characteristic metric (Euclidean distance, Manhattan distance, Chebyshev distance, etc.) on …
K-DGHC: : A hierarchical clustering method based on K-dominance granularity
B Yu, Z Zheng, J Dai - 2023 - dl.acm.org
Existing hierarchical clustering (HC) algorithms generally depend on the Euclidean
characteristic metric (Euclidean distance, Manhattan distance, Chebyshev distance, etc.) on …
characteristic metric (Euclidean distance, Manhattan distance, Chebyshev distance, etc.) on …