更改

Chenghao

添加506字节, 2021年1月13日 (三) 09:27
无编辑摘要
|-
|
<span style="font-family:Times New Roman,Times,serif;"><span style="font-size:larger;">'''Cheng Hao'''</span></span>
<span style="font-family:Times New Roman,Times,serif;"><span style="font-size:larger;">Ph.D. Candidate @ IIP&nbsp;Group<br/> Department of Computer Science and Technology<br/> National Key Laboratory for Novel Software Technology<br/> Nanjing University</span></span>
|-
&nbsp;
<span style="font-family:Times New Roman,Times,serif;"><span style="font-size:larger;">'''Email: '''chengh@smail.nju.edu.cn</span></span>
| &nbsp;
|}
 
&nbsp;
<span style="color:#3498db;"><span style="font-size:larger;">'''Supervisor'''</span></span>
I am interested in Machine Learning and Mechanism design. Currently I am focusing on the subfields:
*path '''Path auctions in crowdsourcing ''' *data '''Data valuation ''' *'''Out-of-distribution detection'''
<font color="#3498db"><span style="caret-color: rgb(52, 152, 219); font-size: 15.600000381469727px;">'''Award or honor'''</span></font>
*'''Cheng h''', Zhang l, Zhang y, Wu J, Wang C. Optimal Constraint Collection for Core-selecting Path Mechanism[C]. In&nbsp;''Proceedings of AAMAS.''&nbsp;Stockholm, Sweden,&nbsp;2018. [[https://dl.acm.org/citation.cfm?id=3237383.3237397 链接]].
*'''Cheng, H'''., Zhang, W.,&nbsp;Zhang, Y'''.''', Zhang, L., Wu, J., & Wang, C. (2020). Fast core pricing algorithms for path auction. Autonomous Agents and Multi-Agent Systems, 34(1), 18.[pdf]
*Zhang, Y'''.''', Zeng, C., '''Cheng, H'''., Wang, C., & Zhang, L. (2019, July). Many could be better than all: A novel instance-oriented algorithm for Multi-modal Multi-label problem. In 2019 IEEE International Conference on Multimedia and Expo (ICME) (pp. 838-843). IEEE <span style="font-size:larger;"><span style="color:#3498db;">'''Contact'''&nbsp;</span></span> ---- '''Mail''': chengh@smail.nju.edu.cn&nbsp; '''Laboratory''':&nbsp;325, Building of Computer Science and Technology, Xianlin Campus of Nanjing University
434
个编辑