Author: Ke Zhou

Publication Overview

Publication period start: 2012
Number of co-authors: 14

Co-Authors

Number of publications with favourite co-authors

Productive Colleagues

Most productive colleagues in number of publications

Publications

Li, Liangda, Zhou, Ke, Xue, Gui-Rong, Zha, Hongyuan, Yu, Yong (2009): Enhancing diversity, coverage and balance for summarization through structure learning. In: Proceedings of the 2009 International Conference on the World Wide Web , 2009, . pp. 71-80. https://doi.acm.org/10.1145/1526709.1526720
Ji, Shihao, Zhou, Ke, Liao, Ciya, Zheng, Zhaohui, Xue, Gui-Rong, Chapelle, Olivier, Sun, Gordon, Zha, Hongyuan (2009): Global ranking by exploiting user clicks. In: Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval , 2009, . pp. 35-42. https://doi.acm.org/10.1145/1571941.1571950
Li, Liangda, Zhou, Ke, Xue, Gui-Rong, Zha, Hongyuan, Yu, Yong (2011): Video summarization via transferrable structured learning. In: Proceedings of the 2011 International Conference on the World Wide Web , 2011, . pp. 287-296. https://dx.doi.org/10.1145/1963405.1963448
Zhou, Ke, Yang, Shuang-Hong, Zha, Hongyuan (2011): Functional matrix factorizations for cold-start recommendation. In: Proceedings of the 34th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval , 2011, . pp. 315-324. https://dx.doi.org/10.1145/2009916.2009961
Zhou, Ke, Cummins, Ronan, Halvey, Martin, Lalmas, Mounia, Jose, Joemon M. (2012): Assessing and predicting vertical intent for web queries. In: Proceedings of the 2012 BCS-IRSG European Conference on Information Retrieval , 2012, . pp. 499-502. https://dx.doi.org/10.1007/978-3-642-28997-2_50
Privacy Settings
By using this site, you accept our Cookie Policy and Terms of Use.
Customize
Accept all

Feel Stuck? Want Freedom?

Join 326,491+ designers who get one powerful email each week. Learn to design a life you love.

Next email in
7
days
10
hrs
52
mins
36
secs

Free forever. No spam. Unsubscribe anytime.