|
|||||
|
|
Improved algorithm for the construction of minimal spanning trees |
|
| Authors: | Pynn C. Warren J.H. |
| Affiliation: | 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: | |