J-means and I-means for minimum sum-of-squares clustering on networks (Q526420): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-015-0974-4 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: J-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.1007/s11590-015-0974-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2290204980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved column generation algorithm for minimum sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on solving large p-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degeneracy in the multi-source Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-of-squares clustering on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for minimum sum-of-squares clustering on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristic for harmonic means clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: J-MEANS: A new local search heuristic for minimum sum of squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of global \(k\)-means, an incremental heuristic for minimum sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Dominating Sets for Network Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-015-0974-4 / rank
 
Normal rank

Latest revision as of 20:29, 9 December 2024

scientific article
Language Label Description Also known as
English
J-means and I-means for minimum sum-of-squares clustering on networks
scientific article

    Statements

    J-means and I-means for minimum sum-of-squares clustering on networks (English)
    0 references
    0 references
    0 references
    0 references
    12 May 2017
    0 references
    minimum sum-of-squares clustering
    0 references
    K-means
    0 references
    J-means
    0 references
    heuristic
    0 references
    variable neighborhood search
    0 references

    Identifiers