Dergiler / İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi / 2017 / Cilt: 16 - Sayı: 32
The new algorithm involving Minimum Spanning Tree for computer networks in a growing company
- Sayfa
- 1–14
- DOI
- —
Özet
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.
Abstract
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.