activity
20112023
most citedHigh-dimensional Black-box Optimization via Divide and Approximate Conquer

97 citations · 287 across the 26 of their papers we have counts for

collaborators
Showing 2017Show all

5 papers · 1 filter

cs.NE2017

Maximizing Submodular or Monotone Approximately Submodular Functions by Multi-objective Evolutionary Algorithms

Chao Qian, Yang Yu, Ke Tang +2

Evolutionary algorithms (EAs) are a kind of nature-inspired general-purpose optimization algorithm, and have shown empirically good performance in solving various real-word optimiz…

cs.NE2017★ 20 cited

What Weights Work for You? Adapting Weights for Any Pareto Front Shape in Decomposition-based Evolutionary Multi-Objective Optimisation

Miqing Li, Xin Yao

The quality of solution sets generated by decomposition-based evolutionary multiobjective optimisation (EMO) algorithms depends heavily on the consistency between a given problem's…

cs.CV2017★ 1 cited

Kernel Truncated Regression Representation for Robust Subspace Clustering

Liangli Zhen, Dezhong Peng, Wei Wang +1

Subspace clustering aims to group data points into multiple clusters of which each corresponds to one subspace. Most existing subspace clustering approaches assume that input data…

cs.NE2017★ 6 cited

Experience-based Optimization: A Coevolutionary Approach

Shengcai Liu, Ke Tang, Xin Yao

This paper studies improving solvers based on their past solving experiences, and focuses on improving solvers by offline training. Specifically, the key issues of offline training…

cs.NE2017★ 5 cited

Dominance Move: A Measure of Comparing Solution Sets in Multiobjective Optimization

Miqing Li, Xin Yao

One of the most common approaches for multiobjective optimization is to generate a solution set that well approximates the whole Pareto-optimal frontier to facilitate the later dec…