Reliable Agglomerative Clustering
Paper i proceeding, 2021

Standard agglomerative clustering suggests establishing a new reliable linkage at every step. However, in order to provide adaptive, density-consistent and flexible solutions, we study extracting all the reliable linkages at each step, instead of the smallest one. Such a strategy can be applied with all common criteria for agglomerative hierarchical clustering. We also study that this strategy with the single linkage criterion yields a minimum spanning tree algorithm. We perform experiments on several real-world datasets to demonstrate the performance of this strategy compared to the standard alternative.

Författare

Morteza Haghir Chehreghani

Data Science och AI

Proceedings of the International Joint Conference on Neural Networks

Vol. 2021-July

2021 International Joint Conference on Neural Networks, IJCNN 2021
Virtual, Shenzhen, China,

Ämneskategorier

Datorteknik

Telekommunikation

Datorseende och robotik (autonoma system)

Styrkeområden

Informations- och kommunikationsteknik

DOI

10.1109/IJCNN52387.2021.9534228

ISBN

9780738133669

Mer information

Senast uppdaterat

2021-10-21