Page History: Publication List

Compare Page Revisions



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


Page Revision: 2012/08/17 13:27


[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)

Technical Reports

  • Yang Yu, Chao Qian, and Zhi-Hua Zhou. Towards Analyzing Crossover Operators in Evolutionary Search via General Markov Chain Switching Theorem. CORR abs/1111.0907, 2011.

Journal Articles

  • 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. (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) (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) (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. (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 (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. (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. (PDF) (detailed result)

Conference Papers

  • Nan Li, Yang Yu, and Z.-H. Zhou. Diversity Regularized Ensemble Pruning. In: Proceedings of the 23rd European Conference on Machine Learning (ECML'12), Bristol, U.K., 2012. (PDF)

  • 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. (PDF)

  • Sheng-Jun Huang, Yang Yu, and Z.-H. Zhou. Multi-label hypothesis reuse. In: Proceedings of the 18th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'12), Beijing, China, 2012. (Best poster award) (PDF) (code)

  • 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)

  • 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)

Thesis

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