A3S: A General Active Clustering Method with Pairwise Constraints

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Deng, Xun, Liu, Junlong, Zhong, Han, Feng, Fuli, Shen, Chen, He, Xiangnan, Ye, Jieping, Wang, Zheng
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911955137069056
author Deng, Xun
Liu, Junlong
Zhong, Han
Feng, Fuli
Shen, Chen
He, Xiangnan
Ye, Jieping
Wang, Zheng
author_facet Deng, Xun
Liu, Junlong
Zhong, Han
Feng, Fuli
Shen, Chen
He, Xiangnan
Ye, Jieping
Wang, Zheng
contents Active clustering aims to boost the clustering performance by integrating human-annotated pairwise constraints through strategic querying. Conventional approaches with semi-supervised clustering schemes encounter high query costs when applied to large datasets with numerous classes. To address these limitations, we propose a novel Adaptive Active Aggregation and Splitting (A3S) framework, falling within the cluster-adjustment scheme in active clustering. A3S features strategic active clustering adjustment on the initial cluster result, which is obtained by an adaptive clustering algorithm. In particular, our cluster adjustment is inspired by the quantitative analysis of Normalized mutual information gain under the information theory framework and can provably improve the clustering quality. The proposed A3S framework significantly elevates the performance and scalability of active clustering. In extensive experiments across diverse real-world datasets, A3S achieves desired results with significantly fewer human queries compared with existing methods.
format Preprint
id arxiv_https___arxiv_org_abs_2407_10196
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A3S: A General Active Clustering Method with Pairwise Constraints
Deng, Xun
Liu, Junlong
Zhong, Han
Feng, Fuli
Shen, Chen
He, Xiangnan
Ye, Jieping
Wang, Zheng
Machine Learning
Artificial Intelligence
Active clustering aims to boost the clustering performance by integrating human-annotated pairwise constraints through strategic querying. Conventional approaches with semi-supervised clustering schemes encounter high query costs when applied to large datasets with numerous classes. To address these limitations, we propose a novel Adaptive Active Aggregation and Splitting (A3S) framework, falling within the cluster-adjustment scheme in active clustering. A3S features strategic active clustering adjustment on the initial cluster result, which is obtained by an adaptive clustering algorithm. In particular, our cluster adjustment is inspired by the quantitative analysis of Normalized mutual information gain under the information theory framework and can provably improve the clustering quality. The proposed A3S framework significantly elevates the performance and scalability of active clustering. In extensive experiments across diverse real-world datasets, A3S achieves desired results with significantly fewer human queries compared with existing methods.
title A3S: A General Active Clustering Method with Pairwise Constraints
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2407.10196