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.
Subjects | Engineering |
---|---|
Journal Section | Research Articles |
Authors | |
Publication Date | December 31, 2017 |
Submission Date | September 14, 2017 |
Published in Issue | Year 2017 Volume: 16 Issue: 32 |
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.