Page History: Publication List

Compare Page Revisions



« Older Revision - Back to Page History - Newer Revision »


Page Revision: 2015/12/02 20:51


[Back to main page ]

Book Chapter

  • Zhi-Hua Zhou and Yang Yu. The AdaBoost algorithm. In: X. Wu and V. Kumar eds. The Top Ten Algorithms in Data Mining, Boca Raton, FL: Chapman & Hall, 2009. (PDF)

Conference Papers

  • Yang Yu, Hong Qian, and Yi-Qi Hu. Derivative-free optimization via classification. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI'16), Phoenix, AZ, 2016. (PDF) (Appendix) (Code)

  • Hong Qian, Yang Yu. Scaling simultaneous optimistic optimization for high-dimensional non-convex functions with low effective dimensions. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI'16), Phoenix, AZ, 2016. (PDF)

  • Chao Qian, Yang Yu and Zhi-Hua Zhou. Subset selection by Pareto optimization. In: Advances in Neural Information Processing Systems 28 (NIPS'15) , Montreal, Canada, 2015. (PDF) (code)

  • Chao Qian, Yang Yu and Zhi-Hua Zhou. On constrained Boolean Pareto optimization. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI'15), Buenos Aires, Argentina, 2015, pp.389-395. (PDF)

  • Yang Yu, Chao Qian. Running time analysis: Convergence-based analysis reduces to switch analysis. In: Proceedings of the 2015 IEEE Congress on Evolutionary Computation (CEC'15), Sendai, Japan, 2015, pp.2603-2610. (PDF)

  • Chao Qian, Yang Yu and Zhi-Hua Zhou. Pareto ensemble pruning. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI'15), Austin, TX, 2015, pp.2935-2941.(PDF)

  • Chao Qian, Yang Yu, Yaochu Jin and Zhi-Hua Zhou. On the effectiveness of sampling for evolutionary optimization in noisy environments. In: Proceedings of the 13th International Conference on Parallel Problem Solving from Nature (PPSN’14), Ljubljana, Slovenia, 2014, pp.302-311. (PDF)

  • Yang Yu and Qing Da, PolicyBoost: Functional policy gradient with ranking-based reward objective. In: Proceedings of AAAI Workshop on AI and Robotics (AIRob'14), Quebec City, Canada, 2014, pp.57-62. (PDF)

  • Yang Yu, and Hong Qian. The sampling-and-learning framework: A statistical view of evolutionary algorithms. In: Proceedings of the 2014 IEEE Congress on Evolutionary Computation (CEC'14), Beijing, China, 2014, pp.149-158. (PDF)

  • Qing Da, Yang Yu, and Zhi-Hua Zhou. Learning with augmented class by exploiting unlabeled data. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI'14), Québec city, Canada, 2014, pp.1760-1766. (PDF)

  • Qing Da, Yang Yu, and Zhi-Hua Zhou. Napping for functional representation of policy. In: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'14), Paris, France, 2014, pp.189-196. (PDF) (Code)

  • Qing Da, Yang Yu, and Zhi-Hua Zhou. Self-practice imitation learning from weak policy. In: Proceedings of the 2nd IAPR International Workshop on Partially Supervised Learning (PSL'13), Nanjing, China, 2013, pp.9-20.

  • Yang Yu, Xin Yao, and Zhi-Hua Zhou. On the approximation ability of evolutionary optimization with application to minimum set cover: Extended abstract. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI'13) (Journal Paper Track), Beijing, China, 2013.

  • Nan Li, Yang Yu, and Zhi-Hua Zhou. Diversity regularized ensemble pruning. In: Proceedings of the 23rd European Conference on Machine Learning (ECML'12), Bristol, U.K., 2012, pp.330-345. (PDF) (code)

  • Chao Qian, Yang Yu, and Zhi-Hua Zhou. On algorithm-dependent boundary case identification for problem classes. In: Proceedings of the 12th International Conference on Parallel Problem Solving from Nature (PPSN'12) Taormina, Italy, 2012, pp.62-71. (PDF)

  • Sheng-Jun Huang, Yang Yu, and Zhi-Hua Zhou. Multi-label hypothesis reuse. In: Proceedings of the 18th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'12), Beijing, China, 2012, pp.525-533. (PDF) (code) (The poster presentation won the Best Poster Award at KDD'12)

  • Sheng-Jun Huang, Yang Yu and Zhi-Hua Zhou, Multi-label boosting via hypothesis reuse. In: Proceedings of NIPS Workshop on Chanllenges in Learning Hierarchical Models: Transfer Learning and Optimization, Granada, Spain 2011.

  • Wang-Zhou Dai, Yang Yu, and Zhi-Hua Zhou. Lifted-rollout for approximate policy iteration of Markov decision process. In: Proceedings of the International Workshop on Learning and Data Mining for Robotics (LEMIR'11), in conjunction with ICDM'11, Vancouver, Canada, 2011.

  • Yang Yu, Yu-Feng Li, and Zhi-Hua Zhou. Diversity Regularized Machine In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI'11), Barcelona, Spain, 2011, pp. 1603-1608. (PDF) (code)

  • Chao Qian, Yang Yu, and Zhi-Hua Zhou. An analysis on recombination in multi-objective evolutionary optimization. In: Proceedings of the 13th ACM Conference on Genetic and Evolutionary Computation (GECCO'11), Dublin, Ireland, 2011, pp. 2051-2058. (PDF) (This paper won the Best Paper Award of the Theory Track at GECCO'11)

  • Chao Qian, Yang Yu, and Zhi-Hua Zhou. Collisions are helpful for computing unique input-output sequences. In: Proceedings of the 13th ACM Conference on Genetic and Evolutionary Computation (GECCO'11) (Companion Material/Poster), Dublin, Ireland, 2011, pp. 265-266. (PDF)

  • Yang Yu, Chao Qian, and Zhi-Hua Zhou. Towards analyzing recombination operators in evolutionary search. In: Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN'10) Part I, Krakow, Poland, 2010, pp.144-153. (PDF)

  • Nan Li, Yang Yu, and Zhi-Hua Zhou. Semi-naive exploitation of one-dependence estimators. In: Proceedings of the 9th IEEE International Conference on Data Mining (ICDM'09), Miami, FL, 2009, pp.278-287. (PDF)

  • Yang Yu and Zhi-Hua Zhou. A framework for modeling positive class expansion with single snapshot. In: Proceedings of the 12th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'08), Osaka, Japan, LNAI 5012, 2008, pp.429-440. (PDF) (slides) (This paper won the Best Paper Award at PAKDD'08)

  • Yang Yu and Zhi-Hua Zhou. On the usefulness of infeasible solutions in evolutionary search: A theoretical study. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC'08), Hong Kong, China, 2008, pp.835-840. (PDF)

  • Li-Ping Liu, Yang Yu, Yuan Jiang, and Zhi-Hua Zhou. TEFE: A time-efficient approach to feature extraction. In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM'08), Pisa, Italy, 2008, pp.423-432. (PDF)

  • Yang Yu, Zhi-Hua Zhou, and Kai Ming Ting. Cocktail ensemble for regression. In: Proceedings of the 7th IEEE International Conference on Data Mining (ICDM'07), Omaha, NE, 2007, pp.721-726. (PDF)

  • Yang Yu and Zhi-Hua Zhou. A new approach to estimating the expected first hitting time of evolutionary algorithms. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI'06), Boston, MA, 2006, pp.555-560. (PDF)

Journal Articles

  • Chao Qian, Yang Yu, and Zhi-Hua Zhou. Analyzing evolutionary optimization in noisy environments. Evolutionary Computation, 2016, in press. (Preprint PDF)

  • Yang Yu, Chao Qian, and Zhi-Hua Zhou. Switch analysis for running time analysis of evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 2015, 19(6):777-7992. (Preprint PDF)

  • Chao Qian, Yang Yu, and Zhi-Hua Zhou. Variable solution structure can be helpful in evolutionary optimization. Science China: Information Sciences, 2015, 58(11): 1-17. (Preprint PDF)


  • Chao Qian, Yang Yu, and Zhi-Hua Zhou. An analysis on recombination in multi-objective evolutionary optimization. Artificial Intelligence, 2013, 204:99-119. (Extended from GECCO'11) (Preprint PDF)

  • Yang Yu, Xin Yao, and Zhi-Hua Zhou. On the approximation ability of evolutionary optimization with application to minimum set cover. Artificial Intelligence, 2012, 180-181:20-33. (Preprint PDF) (CORR abs/1011.4028)

  • Yang Yu and Zhi-Hua Zhou. A framework for modeling positive class expansion with single snapshot. Knowledge and Information Systems, 2010, 25(2):211-227. (Extended from PAKDD'08) (Preprint PDF) (slides) (code&data)

  • Yang Yu and Zhi-Hua Zhou. A new approach to estimating the expected first hitting time of evolutionary algorithms. Artificial Intelligence, 2008, 172(15): 1809-1832. (Extended from AAAI'06) (Preprint PDF)

  • Fei Tony Liu, Kai Ming Ting, Yang Yu, and Zhi-Hua Zhou . Spectrum of variable-random trees. Journal of Artificial Intelligence Research, 2008, 32:355-384. (Preprint PDF)

  • Yang Yu, De-Chuan. Zhan, Xu-Ying Liu, Ming Li, and Zhi-Hua Zhou. Predicting future customers via ensembling gradually expanded trees. International Journal of Data Warehousing and Mining, 2007 3(2): 12-21. (Invited paper for the PAKDD'06 Data Mining Competition (Open Category) Grand Champion Team) (Preprint PDF)

  • Zhi-Hua Zhou and Yang Yu. Ensembling local learners through multi-modal perturbation. IEEE Transactions on System, Man, And Cybernetics - Part B: Cybernetics, 2005, 35(4): 725-735. (Preprint PDF) (code)

  • Zhi-Hua Zhou and Yang Yu. Adapt bagging to nearest neighbor classifiers. Journal of Computer Science and Technology, 2005, vol.20, no.1 pp.48-54. (Preprint PDF) (detailed result)

Thesis

  • Yang Yu. Evolutionary Computation: Theoretical Analysis and Learning Algorithms. Ph.D. Dissertation, 2011.

  • Yang Yu. Local Validity Based Selective Ensemble of Decision Trees. B.Sc. Thesis, 2004. (in Chinese with English abstract) (PDF)

The end