The aim of this article is to present a new algorithm based on minimum spanning trees. Minimum spanning trees have long been used in data mining, pattern recognition and machine learning. However, it is difficult to apply traditional minimum spanning tree algorithms to a large dataset since the time complexity of the algorithms is quadratic. The given algorithm is designed to reduce this difficulty. This application has reduced the cost.
The aim of this article is to
present a new algorithm based on minimum spanning trees. Minimum spanning trees
have long been used in data mining, pattern recognition and machine learning.
However, it is difficult to apply traditional minimum spanning tree algorithms
to a large dataset since the time complexity of the algorithms is quadratic.
The given algorithm is designed to reduce this difficulty. This application has
reduced the cost.
Konular | Mühendislik |
---|---|
Bölüm | Araştırma Makaleleri |
Yazarlar | |
Yayımlanma Tarihi | 31 Aralık 2017 |
Gönderilme Tarihi | 14 Eylül 2017 |
Yayımlandığı Sayı | Yıl 2017 Cilt: 16 Sayı: 32 |
Bu eser Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.