Incremental On-Line Clustering of Speakers' Short Segments

Ruth Aloni-Lavi, Irit Opher, Itshak Lapidot


This paper deals with clustering of speakers’ short segments, in a scenario where additional segments continue to arrive and should be constantly clustered together with previous segments that were already clustered. In realistic applications, it is not possible to cluster all segments every time a new segment arrives. Hence, incremental clustering is applied in an on-line mode. New segments can either belong to existing speakers, therefore, have to be assigned to one of the existing clusters, or they could belong to new speakers and thus new clusters should be formed. In this work we show that if there are enough segments per speaker in the off-line initial clustering process, it constitutes a good starting point for the incremental on-line clustering. In this case, incremental on-line clustering can be successfully applied based on the previously proposed mean-shift clustering algorithm with PLDA score as a similarity measure and with k-nearest neighbors (kNN) neighborhood selection.


 DOI: 10.21437/Odyssey.2018-17

Cite as: Aloni-Lavi, R., Opher, I., Lapidot, I. (2018) Incremental On-Line Clustering of Speakers' Short Segments . Proc. Odyssey 2018 The Speaker and Language Recognition Workshop, 120-127, DOI: 10.21437/Odyssey.2018-17.


@inproceedings{Aloni-Lavi2018,
  author={Ruth Aloni-Lavi and Irit Opher and Itshak Lapidot},
  title={Incremental On-Line Clustering of Speakers' Short Segments	},
  year=2018,
  booktitle={Proc. Odyssey 2018 The Speaker and Language Recognition Workshop},
  pages={120--127},
  doi={10.21437/Odyssey.2018-17},
  url={http://dx.doi.org/10.21437/Odyssey.2018-17}
}