Hierarchical Correlation Clustering and Tree Preserving Embedding
Paper i proceeding, 2024

We propose a hierarchical correlation clustering method that extends the well-known correlation clustering to produce hierarchical clusters applicable to both positive and negative pairwise dissimilarities. Then, in the following, we study unsupervised representation learning with such hier-archical correlation clustering. For this purpose, we first investigate embedding the respective hierarchy to be used for tree preserving embedding and feature extraction. Thereafter, we study the extension of minimax distance measures to correlation clustering, as another representation learning paradigm. Finally, we demonstrate the performance of our methods on several datasets.

Representation learning

Minimax distances

Unsupervised learning

Hierarchical clustering

Correlation clustering

Författare

Morteza Haghir Chehreghani

Chalmers, Data- och informationsteknik, Data Science och AI

Mostafa Haghir Chehreghani

Amirkabir University of Technology

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

10636919 (ISSN)

23083-23093

2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2024
Seattle, USA,

ADMOL: Ett generellt ramverk för aktivt beslutsfattande i online-lärande

Vetenskapsrådet (VR) (2023-04809), 2024-01-01 -- 2027-12-31.

Ämneskategorier (SSIF 2025)

Datorgrafik och datorseende

Datavetenskap (datalogi)

DOI

10.1109/CVPR52733.2024.02178

Mer information

Senast uppdaterat

2025-02-27