Distributed Pareto Optimization for Large-Scale Noisy Subset Selection

Subset selection, aiming to select the best subset from a ground set with respect to some objective function, is a fundamental problem with applications in many areas, such as combinatorial optimization, machine learning, data mining, computer vision, information retrieval, etc. Along with the devel...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on evolutionary computation Ročník 24; číslo 4; s. 694 - 707
Hlavní autor:	Qian, Chao
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.08.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Additive noise Approximation Approximation algorithms Combinatorial analysis Computer vision Data collection Data mining Distributed algorithms Evolutionary algorithms experimental studies Greedy algorithms Information retrieval large-scale Linear programming Machine learning Mathematical analysis multiobjective evolutionary algorithms (MOEAs) Multiple objective analysis Noise Noise measurement Optimization Pareto optimization Performance degradation subset selection theoretical analyses
ISSN:	1089-778X, 1941-0026
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!