Interrelate Training and Searching: A Unified Online Clustering Framework for Speaker Diarization
For online speaker diarization, samples arrive incrementally, and the overall distribution of the samples is invisible. Moreover, in most existing clustering-based methods, the training objective of the embedding extractor is not designed specially for clustering. To improve online speaker diarization performance, we propose a unified online clustering framework, which provides an interactive manner between embedding extractors and clustering algorithms. Specifically, the framework consists of two highly coupled parts: clustering-guided recurrent training (CGRT) and truncated beam searching clustering (TBSC). The CGRT introduces the clustering algorithm into the training process of embedding extractors, which could provide not only cluster-aware information for the embedding extractor, but also crucial parameters for the clustering process afterward. And with these parameters, which contain preliminary information of the metric space, the TBSC penalizes the probability score of each cluster, in order to output more accurate clustering results in online fashion with low latency. With the above innovations, our proposed online clustering system achieves 14.48\% DER with collar 0.25 at 2.5s latency on the AISHELL-4, while the DER of the offline agglomerative hierarchical clustering is 14.57\%.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringOnline Clusteringspeaker-diarizationSpeaker DiarizationSimilar Papers 제목 키워드 기반
Atlas: Automate Online Service Configuration in Network Slicing
Network slicing achieves cost-efficient slice customization to support heterogeneous applications and services. Configuring cross-domain resources to end-to-end slices based on service-level agreements, however, is chall…
Bayesian OptimizationSafe ExplorationThompson SamplingA Unified Framework for Online Trip Destination Prediction
Trip destination prediction is an area of increasing importance in many applications such as trip planning, autonomous driving and electric vehicles. Even though this problem could be naturally addressed in an online lea…
Autonomous DrivingClusteringPredictionFurther Connections Between Contract-Scheduling and Ray-Searching Problems
This paper addresses two classes of different, yet interrelated optimization problems. The first class of problems involves a robot that must locate a hidden target in an environment that consists of a set of concurrent …
SchedulingTowards a Unified Taxonomy of Biclustering Methods
Being an unsupervised machine learning and data mining technique, biclustering and its multimodal extensions are becoming popular tools for analysing object-attribute data in different domains. Apart from conventional cl…
AttributeClusteringSurveyA Unified Framework for Clustering Constrained Data without Locality Property
In this paper, we consider a class of constrained clustering problems of points in $\mathbb{R}^{d}$, where $d$ could be rather high. A common feature of these problems is that their optimal clusterings no longer have the…
ClusteringConstrained ClusteringLEMMA