Algorithms with greedy heuristic procedures for mixture probability distribution separation

Algorithms with greedy heuristic procedures for mixture probability distribution separation

For clustering problems based on the model of mixture probability distribution separation, we propose new Variable Neighbourhood Search algorithms (VNS) and evolutionary genetic algorithms (GA) with greedy agglomerative heuristic procedures and compare them with known algorithms. New genetic algorit...

Description complète

Détails bibliographiques
Auteurs principaux: Kazakovtsev Lev, Stashkov Dmitry, Gudyma Mikhail, Kazakovtsev Vladimir
Format: Article
Langue:English
Publié: University of Belgrade 2019-01-01
Collection:Yugoslav Journal of Operations Research
Sujets:
clustering
variable neighbourhood search
genetic algorithm
greedy heuristic
agglomerative heuristic
expectation maximization.
Accès en ligne:http://www.doiserbia.nb.rs/img/doi/0354-0243/2019/0354-02431800030K.pdf

Internet

http://www.doiserbia.nb.rs/img/doi/0354-0243/2019/0354-02431800030K.pdf

Documents similaires