USING THE MINIMUM SPANNING TREE PROBLEM FOR DATA MINING

Abstract

The article is devoted to an attempt to determine clusters using the optimization problem of a minimum spanning tree. The problem of the clustering problem is to group similar objects into many clusters in such a way that objects within one cluster are similar to each other, and objects between different clusters are different. One approach to solving this problem is to use the minimum spanning tree problem. The idea of using the minimum spanning tree problem for clustering is to build a tree connecting all the objects, where the weights of the edges correspond to the distances between the objects. Then, using some pruning technique, a certain number of edges can be removed to divide the tree into clusters. To do this, it is necessary to remove the longest edges in order to divide the tree into individual components corresponding to clusters. This approach can be especially effective in cases where it is necessary to minimize overlaps: a minimum spanning tree combines vertices with the smallest distances, that is, the vertices that are most similar to each other will be located next to each other. This helps reduce the number of matches in clusters and improve the quality of clustering. A minimum spanning tree can be easily interpreted because it shows the closest connections between vertices, which allows us to understand which groups of data tend to cluster together. It can also be useful in cases where we are dealing with large amounts of data, since minimum spanning tree algorithms have low computational complexity. Minimum Spanning Tree allows you to ignore noise in the data because it builds a connection between nearby points and noisy data will usually be far away from other points, and also allows you to naturally determine the number of clusters. The number of clusters corresponds to the number of edges in the minimum spanning tree after removing the longest edges. However, be aware that this approach may not always be the best for all types of data and requires careful analysis and customization of parameters for each specific case.