Title :
Improved algorithm for the construction of minimal spanning trees
Author :
Pynn, C. ; Warren, J.H.
Author_Institution :
Plessey Telecommunications Group, Maidenhead, UK
Abstract :
An improved algorithm for the construction of minimal spanning trees is proposed which is particularly suitable for use with data sets containing repeated elements. The algorithm may be applied to cluster-detection and pattern-segmentation problems, such as arise in automatic speech recognition.
Keywords :
minimisation; speech recognition; trees (mathematics); algorithm; automatic speech recognition; cluster detection; construction; data sets; minimal spanning trees; pattern segmentation; repeated elements;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19720104
