Geodesic
Algorithms With Greedy Heuristic Procedures for Mixture Probability Distribution Separation
Yugoslav journal of operations research, Tome 29 (2019) no. 1, p. 51 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

For clustering problems based on the model of mixture probability distribution separation, we propose new Variable Neighborhood Search algorithms (VNS) and evolutionary genetic algorithms (GA) with greedy agglomerative heuristic procedures and compare them with known algorithms. New genetic algorithms implement a global search strategy with the use of a special crossover operator based on greedy agglomerative heuristic procedures in combination with the EM algorithm (Expectation Maximization). In our new VNS algorithms, this combination is used for forming randomized neighborhoods to search for better solutions. The results of computational experiments made on classical data sets and the testings of production batches of semiconductor devices shipped for the space industry demonstrate that new algorithms allow us to obtain better results, higher values of the log likelihood objective function, in comparison with the EM algorithm and its modifications.
Classification : 65K05, 90C59
Keywords: Clustering, Variable Neighborhood Search, Genetic Algorithm, Greedy Heuristic, Agglomerative Heuristic, Expectation Maximization 
@article{YJOR_2019_29_1_a3,
     author = {Lev Kazakovtsev and Dmitry Stashkov and Mikhail Gudyma and Vladimir Kazakovtsev},
     title = {Algorithms {With} {Greedy} {Heuristic} {Procedures} for {Mixture} {Probability} {Distribution} {Separation}},
     journal = {Yugoslav journal of operations research},
     pages = {51 },
     year = {2019},
     volume = {29},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2019_29_1_a3/}
}
TY  - JOUR
AU  - Lev Kazakovtsev
AU  - Dmitry Stashkov
AU  - Mikhail Gudyma
AU  - Vladimir Kazakovtsev
TI  - Algorithms With Greedy Heuristic Procedures for Mixture Probability Distribution Separation
JO  - Yugoslav journal of operations research
PY  - 2019
SP  - 51 
VL  - 29
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/YJOR_2019_29_1_a3/
LA  - en
ID  - YJOR_2019_29_1_a3
ER  - 
%0 Journal Article
%A Lev Kazakovtsev
%A Dmitry Stashkov
%A Mikhail Gudyma
%A Vladimir Kazakovtsev
%T Algorithms With Greedy Heuristic Procedures for Mixture Probability Distribution Separation
%J Yugoslav journal of operations research
%D 2019
%P 51 
%V 29
%N 1
%U http://geodesic.mathdoc.fr/item/YJOR_2019_29_1_a3/
%G en
%F YJOR_2019_29_1_a3
Lev Kazakovtsev; Dmitry Stashkov; Mikhail Gudyma; Vladimir Kazakovtsev. Algorithms With Greedy Heuristic Procedures for Mixture Probability Distribution Separation. Yugoslav journal of operations research, Tome 29 (2019) no. 1, p. 51 . http://geodesic.mathdoc.fr/item/YJOR_2019_29_1_a3/