暂无分享,去创建一个
Hisao Ishibuchi | Yang Nan | Tianye Shu | Ke Shang | Lie Meng Pang | H. Ishibuchi | Ke Shang | Tianye Shu | Yang Nan
[1] Hisao Ishibuchi,et al. Fast Greedy Subset Selection From Large Candidate Solution Sets in Evolutionary Multiobjective Optimization , 2021, IEEE Transactions on Evolutionary Computation.
[2] Ye Tian,et al. PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective Optimization [Educational Forum] , 2017, IEEE Computational Intelligence Magazine.
[3] Brendan J. Frey,et al. Non-metric affinity propagation for unsupervised image categorization , 2007, 2007 IEEE 11th International Conference on Computer Vision.
[4] U. Feige. A threshold of ln n for approximating set cover , 1998, JACM.
[5] Junyu Dong,et al. Enhancing MOEA/D with information feedback models for large-scale many-objective optimization , 2020, Inf. Sci..
[6] Kalyanmoy Deb,et al. An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach , 2014, IEEE Transactions on Evolutionary Computation.
[7] Michael T. M. Emmerich,et al. Maximum Volume Subset Selection for Anchored Boxes , 2018, SoCG.
[8] E. Goodman,et al. A New Many-Objective Evolutionary Algorithm Based on Generalized Pareto Dominance , 2021, IEEE Transactions on Cybernetics.
[9] A. Atkinson. Subset Selection in Regression , 1992 .
[10] Marco Laumanns,et al. Scalable Test Problems for Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.
[11] Serpil Sayin,et al. Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming , 2000, Math. Program..
[12] Carlos A. Coello Coello,et al. A Study of the Parallelization of a Coevolutionary Multi-objective Evolutionary Algorithm , 2004, MICAI.
[13] Hisao Ishibuchi,et al. R2-Based Hypervolume Contribution Approximation , 2018, IEEE Transactions on Evolutionary Computation.
[14] R. Lyndon While,et al. A review of multiobjective test problems and a scalable test problem toolkit , 2006, IEEE Transactions on Evolutionary Computation.
[15] Chao Qian,et al. Distributed Pareto Optimization for Large-Scale Noisy Subset Selection , 2020, IEEE Transactions on Evolutionary Computation.
[16] Shengxiang Yang,et al. Shift-Based Density Estimation for Pareto-Based Algorithms in Many-Objective Optimization , 2014, IEEE Transactions on Evolutionary Computation.
[17] Mario Köppen,et al. Substitute Distance Assignments in NSGA-II for Handling Many-objective Optimization Problems , 2007, EMO.
[18] Hisao Ishibuchi,et al. Reference Point Specification in Inverted Generational Distance for Triangular Linear Pareto Front , 2018, IEEE Transactions on Evolutionary Computation.
[19] Amir Ahmadi-Javid,et al. Uniform distributions and random variate generation over generalizedlpballs and spheres , 2019, Journal of Statistical Planning and Inference.
[20] Frank Neumann,et al. Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms , 2014, PPSN.
[21] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..
[22] Hisao Ishibuchi,et al. A New Framework of Evolutionary Multi-Objective Algorithms with an Unbounded External Archive , 2020 .
[23] Karl Bringmann,et al. Two-dimensional subset selection for hypervolume and epsilon-indicator , 2014, GECCO.
[24] Guohua Wu,et al. Evolutionary many-Objective algorithm based on fractional dominance relation and improved objective space decomposition strategy , 2021, Swarm Evol. Comput..
[25] H. Ishibuchi,et al. Distance-based subset selection revisited , 2021, GECCO.
[26] Kalyanmoy Deb,et al. An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.
[27] Ka-Chun Wong,et al. A Self-Guided Reference Vector Strategy for Many-Objective Optimization , 2020, IEEE Transactions on Cybernetics.
[28] Carlos M. Fonseca,et al. Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms , 2016, Evolutionary Computation.
[29] Nicola Beume,et al. SMS-EMOA: Multiobjective selection based on dominated hypervolume , 2007, Eur. J. Oper. Res..
[30] Eckart Zitzler,et al. Indicator-Based Selection in Multiobjective Search , 2004, PPSN.
[31] Ye Tian,et al. A Decision Variable Clustering-Based Evolutionary Algorithm for Large-Scale Many-Objective Optimization , 2018, IEEE Transactions on Evolutionary Computation.
[32] Carlos M. Fonseca,et al. Greedy Hypervolume Subset Selection in Low Dimensions , 2016, Evolutionary Computation.
[33] Gebräuchliche Fertigarzneimittel,et al. V , 1893, Therapielexikon Neurologie.
[34] Hisao Ishibuchi,et al. Clustering-Based Subset Selection in Evolutionary Multiobjective Optimization , 2021, 2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC).
[35] Marco Laumanns,et al. SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .
[36] Hisao Ishibuchi,et al. Modified Distance Calculation in Generational Distance and Inverted Generational Distance , 2015, EMO.
[37] Hisao Ishibuchi,et al. A Survey on the Hypervolume Indicator in Evolutionary Multiobjective Optimization , 2021, IEEE Transactions on Evolutionary Computation.
[38] Qingfu Zhang,et al. MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.
[39] Éva Tardos,et al. Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..
[40] Hisao Ishibuchi,et al. Performance of Decomposition-Based Many-Objective Algorithms Strongly Depends on Pareto Front Shapes , 2017, IEEE Transactions on Evolutionary Computation.
[41] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[42] Hisao Ishibuchi,et al. Selecting a small number of representative non-dominated solutions by a hypervolume-based solution selection approach , 2009, 2009 IEEE International Conference on Fuzzy Systems.
[43] John E. Dennis,et al. Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..
[44] Xin Yao,et al. An Empirical Investigation of the Optimality and Monotonicity Properties of Multiobjective Archiving Methods , 2019, EMO.
[45] Mohamed S. Kamel,et al. An Efficient Greedy Method for Unsupervised Feature Selection , 2011, 2011 IEEE 11th International Conference on Data Mining.
[46] Hisao Ishibuchi,et al. Greedy approximated hypervolume subset selection for many-objective optimization , 2021, GECCO.
[47] Lothar Thiele,et al. Bounding the Effectiveness of Hypervolume-Based (μ + λ)-Archiving Algorithms , 2012, LION.
[48] Hisao Ishibuchi,et al. Comparison of Hypervolume, IGD and IGD+ from the Viewpoint of Optimal Distributions of Solutions , 2019, EMO.
[49] Lucas Bradstreet,et al. A Fast Way of Calculating Exact Hypervolumes , 2012, IEEE Transactions on Evolutionary Computation.
[50] Xin Yao,et al. Two-Archive Evolutionary Algorithm for Constrained Multiobjective Optimization , 2017, IEEE Transactions on Evolutionary Computation.
[51] Andreas Krause,et al. Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..
[52] Jie Zhang,et al. A Simple and Fast Hypervolume Indicator-Based Multiobjective Evolutionary Algorithm , 2015, IEEE Transactions on Cybernetics.
[53] Lucas Bradstreet,et al. Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms , 2007, 2007 IEEE Congress on Evolutionary Computation.
[54] Marco Laumanns,et al. Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..
[55] Desire L. Massart,et al. Representative subset selection , 2002 .
[56] Tapabrata Ray,et al. Distance-Based Subset Selection for Benchmarking in Evolutionary Multi/Many-Objective Optimization , 2019, IEEE Transactions on Evolutionary Computation.