A fast minimum spanning tree algorithm based on \(K\)-means
From MaRDI portal
Publication:527132
DOI10.1016/j.ins.2014.10.012zbMath1360.68730OpenAlexW2084642062MaRDI QIDQ527132
Duoqian Miao, Pasi Fränti, Caiming Zhong, Mikko Malinen
Publication date: 16 May 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.10.012
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
A clustering ensemble: two-level-refined co-association matrix with path-based transformation ⋮ Learning representations from dendrograms ⋮ A Family of Unsupervised Sampling Algorithms ⋮ An efficient \(k\)-means clustering filtering algorithm using density based initial cluster centers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Ectropy of diversity measures for populations in Euclidean space
- Resonance, stability and chaotic vibration of a quarter-car vehicle model with time-delay feedback
- Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- A fast distributed approximation algorithm for minimum spanning trees
- Robust path-based spectral clustering
- The multi-criteria minimum spanning tree problem based genetic algorithm
- A graph-theoretical clustering method based on two rounds of minimum spanning trees
- A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
- Minimum Spanning Trees in k-Dimensional Space
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Finding Minimum Spanning Trees
- A new cluster validity index for the fuzzy c-mean
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- Centroidal Voronoi Tessellations: Applications and Algorithms
- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
- Fibonacci heaps and their uses in improved network optimization algorithms
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Sur la liaison et la division des points d'un ensemble fini
This page was built for publication: A fast minimum spanning tree algorithm based on \(K\)-means
