TAILIEUCHUNG - 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 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). | Yugoslav Journal of Operations Research xx (), Number nn, zzz–zzz DOI: ALGORITHMS WITH GREEDY HEURISTIC PROCEDURES FOR MIXTURE PROBABILITY DISTRIBUTION SEPARATION Lev KAZAKOVTSEV Department of Systems Analysis and Operations Research, Reshetnev University, Rabochii 31, Krasnoyarsk, 660037, Russian Federation levklevk@ Dmitry STASHKOV Department of Systems Analysis and Operations Research, Reshetnev University, Rabochii 31, Krasnoyarsk, 660037, Russian Federation stashkov@ Mikhail GUDYMA Department of Systems Analysis and Operations Research, Reshetnev University, Rabochii 31, Krasnoyarsk, 660037, Russian Federation darfai04@ Vladimir KAZAKOVTSEV Department of Computer Educational Technologies, ITMO University, Kronverksky Pr. 49, St. Petersburg, 197101, Russian Federation vokz@ Received: November 2017 / Accepted: November 2018 Abstract: 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 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 neighbourhoods 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 2 L. Kazakovtsev, et al. / Algorithms with Greedy Heuristic Procedures results, higher values of the log likelihood objective function, in comparison with the EM algorithm

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.