A fast minimum spanning tree algorithm based on \(K\)-means (Q527132): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 6 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6715806 / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum spanning tree
Property / zbMATH Keywords: minimum spanning tree / rank
 
Normal rank
Property / zbMATH Keywords
 
clustering
Property / zbMATH Keywords: clustering / rank
 
Normal rank
Property / zbMATH Keywords
 
manifold learning
Property / zbMATH Keywords: manifold learning / rank
 
Normal rank
Property / zbMATH Keywords
 
\(K\)-means
Property / zbMATH Keywords: \(K\)-means / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2014.10.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084642062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust path-based spectral clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum spanning tree algorithm with inverse-Ackermann type complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-criteria minimum spanning tree problem based genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centroidal Voronoi Tessellations: Applications and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la liaison et la division des points d'un ensemble fini / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast distributed approximation algorithm for minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ectropy of diversity measures for populations in Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new cluster validity index for the fuzzy c-mean / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Spanning Trees in <i>k</i>-Dimensional Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-theoretical clustering method based on two rounds of minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resonance, stability and chaotic vibration of a quarter-car vehicle model with time-delay feedback / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:18, 13 July 2024

scientific article
Language Label Description Also known as
English
A fast minimum spanning tree algorithm based on \(K\)-means
scientific article

    Statements

    A fast minimum spanning tree algorithm based on \(K\)-means (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 May 2017
    0 references
    minimum spanning tree
    0 references
    clustering
    0 references
    manifold learning
    0 references
    \(K\)-means
    0 references
    0 references
    0 references
    0 references

    Identifiers