Abstract
Computing the minimum spanning tree (MST) is a common task in the pattern recognition and the computer vision fields. However, little work has been done on efficient general methods for solving the problem on large datasets where graphs are complete and edge weights are given implicitly by a distance between vertex attributes. In this work we propose a generic algorithm that extends the classical Boruvka’s algorithm by using nearest neighbors search structures to significantly reduce time and memory consumption. The algorithm can also compute in a straightforward way approximate MSTs thus further improving speed. Experiments show that the proposed method outperforms classical algorithms on large low-dimensional datasets by several orders of magnitude.
Supported by FREEDOM (ANR07-JCJC-0048-01), CNES (R&T Echantillonnage Irregulier DCT/SI/MO - 2010.001.4673), Callisto (ANR-09-CORD-003), ECOS Sud U06E01, ARFITEC (07 MATRH), STIC Amsud (11STIC-01 - MMVPSCV), and the Uruguayan ANII (PR-POS-2008-003).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Graham, R., Hell, P.: On the history of the minimum spanning tree problem. Annals of the History of Computing 7(1), 43–57 (1985)
Jain, A.K., Dubes, R.C.: Algorithms for clustering data. Prentice-Hall, Inc., Upper Saddle River (1988)
Zahn, C.T.: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters. Transactions on Computers C-20(1), 68–86 (1971)
Carreira-Perpiñán, M., Zemel, R.: Proximity graphs for clustering and manifold learning. In: NIPS (2005)
Felzenszwalb, P., Huttenlocher, D.: Efficient Graph-Based Image Segmentation. International Journal of Computer Vision 59(2), 167–181 (2004)
Lai, C., Rafa, T., Nelson, D.: Approximate minimum spanning tree clustering in high-dimensional space. Intelligent Data Analysis 13(4), 575–597 (2009)
Eddy, W., Mockus, A., Oue, S.: Approximate single linkage cluster analysis of large data sets in high-dimensional spaces. Computational Statistics & Data Analysis 23(1), 29–43 (1996)
Bentley, J., Friedman, J.: Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces. Transactions on Computers 27(2), 97–105 (1978)
Leibe, B., Mikolajczyk, K., Schiele, B.: Efficient Clustering and Matching for Object Class Recognition. In: BMVC (2006)
Frank, A., Asuncion, A.: UCI machine learning repository (2010)
Tepper, M., Musé, P., Almansa, A., Mejail, M.: Boruvka Meets Nearest Neighbors. Technical report, HAL: hal-00583120 (2011)
Toyama, J., Kudo, M., Imai, H.: Probably correct k-nearest neighbor search in high dimensions. Pattern Recognition 43(4), 1361–1372 (2010)
Chavez, E., Navarro, G.: An Effective Clustering Algorithm to Index High Dimensional Metric Spaces. In: SPIRE (2000)
Chávez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recognition Letters 26(9), 1363–1376 (2005)
Samet, H.: Depth-First K-Nearest Neighbor Finding Using the MaxNearestDist Estimator. In: ICIAP (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tepper, M., Musé, P., Almansa, A., Mejail, M. (2013). Boruvka Meets Nearest Neighbors. In: Ruiz-Shulcloper, J., Sanniti di Baja, G. (eds) Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. CIARP 2013. Lecture Notes in Computer Science, vol 8259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41827-3_70
Download citation
DOI: https://doi.org/10.1007/978-3-642-41827-3_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41826-6
Online ISBN: 978-3-642-41827-3
eBook Packages: Computer ScienceComputer Science (R0)