Page History: Publication List

Compare Page Revisions

203 202 201 200 199 198 197 196 195 194 193 192 191 190 189 188 187 186 185 184 183 182 181 180 179 178 177 176 175 174 173 172 171 170 169 168 167 166 165 164 163 162 161 160 159 158 157 156 155 154 153 152 151 150 149 148 147 146 145 144 143 142 141 140 139 138 137 136 135 134 133 132 131 130 129 128 127 126 125 124 123 122 121 120 119 118 117 116 115 114 113 112 111 110 109 108 107 106 105 104 103 102 101 100 99 98 97 96 95 94 93 92 91 90 89 88 87 86 85 84 83 82 81 80 79 78 77 76 75 74 73 72 71 70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 Current 203 202 201 200 199 198 197 196 195 194 193 192 191 190 189 188 187 186 185 184 183 182 181 180 179 178 177 176 175 174 173 172 171 170 169 168 167 166 165 164 163 162 161 160 159 158 157 156 155 154 153 152 151 150 149 148 147 146 145 144 143 142 141 140 139 138 137 136 135 134 133 132 131 130 129 128 127 126 125 124 123 122 121 120 119 118 117 116 115 114 113 112 111 110 109 108 107 106 105 104 103 102 101 100 99 98 97 96 95 94 93 92 91 90 89 88 87 86 85 84 83 82 81 80 79 78 77 76 75 74 73 72 71 70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0

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

Page Revision: 2013/09/05 12:20

[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

• Chao Qian, Yang Yu, and Zhi-Hua Zhou. An Analysis on Recombination in Multi-Objective Evolutionary Optimization, Artificial Intelligence, in press.

• 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

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

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