Auto-Tuning Spectral Clustering for Speaker Diarization Using Normalized Maximum Eigengap

• URL: http://arxiv.org/abs/2003.02405v1
• Date: Thu, 5 Mar 2020 02:50:37 GMT
• Title: Auto-Tuning Spectral Clustering for Speaker Diarization Using Normalized Maximum Eigengap
• Authors: Tae Jin Park, Kyu J. Han, Manoj Kumar, Shrikanth Narayanan
• Abstract summary: We propose a new spectral clustering framework that can auto-tune the parameters of the clustering algorithm in the context of speaker diarization. A relative improvement of 17% in the speaker error rate on the well-known CALLHOME evaluation set shows the effectiveness of our proposed spectral clustering with auto-tuning.
• Score: 43.82618103722998
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this study, we propose a new spectral clustering framework that can auto-tune the parameters of the clustering algorithm in the context of speaker diarization. The proposed framework uses normalized maximum eigengap (NME) values to estimate the number of clusters and the parameters for the threshold of the elements of each row in an affinity matrix during spectral clustering, without the use of parameter tuning on the development set. Even through this hands-off approach, we achieve a comparable or better performance across various evaluation sets than the results found using traditional clustering methods that apply careful parameter tuning and development data. A relative improvement of 17% in the speaker error rate on the well-known CALLHOME evaluation set shows the effectiveness of our proposed spectral clustering with auto-tuning.

Related papers

• Self-Tuning Spectral Clustering for Speaker Diarization [19.487611671681968]
  We present a novel pruning algorithm to create a sparse affinity matrix called emphspectral clustering on p-neighborhood retained affinity matrix (SC-pNA) Our method improves on node-specific fixed neighbor selection by allowing a variable number of neighbors, eliminating the need for external tuning data. Experimental results on the challenging DIHARD-III dataset highlight the superiority of SC-pNA.
  arXiv  Detail & Related papers  (2024-09-16T05:07:47Z)
• A Parameter-free Adaptive Resonance Theory-based Topological Clustering Algorithm Capable of Continual Learning [20.995946115633963]
  We propose a new parameter-free ART-based topological clustering algorithm capable of continual learning by introducing parameter estimation methods. Experimental results with synthetic and real-world datasets show that the proposed algorithm has superior clustering performance to the state-of-the-art clustering algorithms without any parameter pre-specifications.
  arXiv  Detail & Related papers  (2023-05-01T01:04:07Z)
• Tight integration of neural- and clustering-based diarization through deep unfolding of infinite Gaussian mixture model [84.57667267657382]
  This paper introduces a it trainable clustering algorithm into the integration framework. Speaker embeddings are optimized during training such that it better fits iGMM clustering. Experimental results show that the proposed approach outperforms the conventional approach in terms of diarization error rate.
  arXiv  Detail & Related papers  (2022-02-14T07:45:21Z)
• Personalized Federated Learning via Convex Clustering [72.15857783681658]
  We propose a family of algorithms for personalized federated learning with locally convex user costs. The proposed framework is based on a generalization of convex clustering in which the differences between different users' models are penalized.
  arXiv  Detail & Related papers  (2022-02-01T19:25:31Z)
• Cluster-and-Conquer: A Framework For Time-Series Forecasting [94.63501563413725]
  We propose a three-stage framework for forecasting high-dimensional time-series data. Our framework is highly general, allowing for any time-series forecasting and clustering method to be used in each step. When instantiated with simple linear autoregressive models, we are able to achieve state-of-the-art results on several benchmark datasets.
  arXiv  Detail & Related papers  (2021-10-26T20:41:19Z)
• Applying Semi-Automated Hyperparameter Tuning for Clustering Algorithms [0.0]
  This study proposes a framework for semi-automated hyperparameter tuning of clustering problems. It uses a grid search to develop a series of graphs and easy to interpret metrics that can then be used for more efficient domain-specific evaluation. Preliminary results show that internal metrics are unable to capture the semantic quality of the clusters developed.
  arXiv  Detail & Related papers  (2021-08-25T05:48:06Z)
• Correlation Clustering Reconstruction in Semi-Adversarial Models [70.11015369368272]
  Correlation Clustering is an important clustering problem with many applications. We study the reconstruction version of this problem in which one is seeking to reconstruct a latent clustering corrupted by random noise and adversarial modifications.
  arXiv  Detail & Related papers  (2021-08-10T14:46:17Z)
• Scalable Hierarchical Agglomerative Clustering [65.66407726145619]
  Existing scalable hierarchical clustering methods sacrifice quality for speed. We present a scalable, agglomerative method for hierarchical clustering that does not sacrifice quality and scales to billions of data points.
  arXiv  Detail & Related papers  (2020-10-22T15:58:35Z)
• A Robust Speaker Clustering Method Based on Discrete Tied Variational Autoencoder [27.211505187332385]
  Traditional speaker clustering method based on aggregation hierarchy cluster (AHC) has the shortcomings of long-time running and remains sensitive to environment noise. We propose a novel speaker clustering method based on Mutual Information (MI) and a non-linear model with discrete variable, which under the enlightenment of Tied Variational Autoencoder (TVAE) to enhance the robustness against noise.
  arXiv  Detail & Related papers  (2020-03-04T08:54:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.