Progressive Sub-graph Clustering Algorithm For Semi-supervised Domain Adaptation Speaker Verification

Abstract

Utilizing the large-scale unlabeled data from the target domain via pseudo-label clustering algorithms is an important approach for addressing domain adaptation problems in speaker verification tasks. In this paper, we propose a novel progressive subgraph clustering algorithm based on multi-model voting and double-Gaussian based assessment (PGMVG clustering). To fully exploit the relationships among utterances and the complementarity among multiple models, our method constructs multiple k-nearest neighbors graphs based on diverse models and generates high-confidence edges using a voting mechanism. Further, to maximize the intra-class diversity, the connected subgraph is utilized to obtain the initial pseudo-labels. Finally, to prevent disastrous clustering results, we adopt an iterative approach that progressively increases k and employs a double-Gaussian based assessment algorithm to decide whether merging sub-classes.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyli2023progressive

Related papers

• Multi-objective Progressive Clustering For Semi-supervised Domain Adaptation In Speaker Verification (2023)5.24
• Multi-domain Adaptation By Self-supervised Learning For Speaker Verification (2023)0.00
• Channel Adaptation For Speaker Verification Using Optimal Transport With Pseudo Label (2024)0.00
• Self-supervised Learning Based Domain Adaptation For Robust Speaker Verification (2021)11.49
• Prototype And Instance Contrastive Learning For Unsupervised Domain Adaptation In Speaker Verification (2024)0.00
• Source -free Domain Adaptation For Speaker Verification In Data-scarce Languages And Noisy Channels (2024)0.00
• Graph Convolutional Network Based Semi-supervised Learning On Multi-speaker Meeting Data (2022)7.50
• Speaker Verification Using End-to-end Adversarial Language Adaptation (2018)11.19