J-MEANS: A new local search heuristic for minimum sum of squares clustering (Q5957595): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4181272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another interpretation of the EM algorithm for mixture distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification EM algorithm for clustering and two stochastic versions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Clustering Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of a Branch and Bound Algorithm for Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in projection and clustering by simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-Allocation 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: A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the p-median / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new adaptive multi-start technique for combinatorial global optimizations / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127740626 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0031-3203(99)00216-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091292848 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:57, 30 July 2024

scientific article; zbMATH DE number 1717750
Language Label Description Also known as
English
J-MEANS: A new local search heuristic for minimum sum of squares clustering
scientific article; zbMATH DE number 1717750

    Statements

    J-MEANS: A new local search heuristic for minimum sum of squares clustering (English)
    0 references
    0 references
    0 references
    3 June 2003
    0 references
    local search heuristic
    0 references
    J-means
    0 references

    Identifiers