科研进展：修订间差异
跳转到导航
跳转到搜索
无编辑摘要 |
无编辑摘要 |
||
| 第7行： | 第7行： | ||
<p style="text-align:center"><span style="font-family:Times New Roman,Times,serif"><span style="font-size:larger">2022</span></span></p> | <p style="text-align:center"><span style="font-family:Times New Roman,Times,serif"><span style="font-size:larger">2022</span></span></p> | ||
#<span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">吴骏等.一种基于算法机制设计的社会法则合成方法.'''''软件学报'''''，录用</span></span> | #<span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">吴骏等.一种基于算法机制设计的社会法则合成方法.'''''软件学报'''''，录用</span></span> | ||
#<span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">MA C., etc. Unsupervised Point Cloud Completion and Segmentation by Generative Adversarial Autoencoding Network[C]. '''''NIPS 2022''''', Accepted </span></span> | #<span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">MA C., etc. Unsupervised Point Cloud Completion and Segmentation by Generative Adversarial Autoencoding Network[C].</span></span><span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;"> </span></span><span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">In '''''Proceedings of ''''' '''''NIPS 2022''''', Accepted </span></span> | ||
#<span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">Liu Z., etc. FIXC: A Method for Data Distribution Shifts Calibration via Feature Importance[C]. '''''ICTAI 2022''' | #<span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">Liu Z., etc. FIXC: A Method for Data Distribution Shifts Calibration via Feature Importance[C]. </span></span><span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;"> </span></span><span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">In '''''Proceedings of '''''<i>'''ICTAI 2022'''</i>, Accepted</span></span> | ||
#<span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">Ge Y., etc. MRM: Site Selection via Mutil-round Meanshift for Global Fairness[C].</span></span> <span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">'''''ICTAI 2022''''', Accepted</span></span> | #<span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">Ge Y., etc. MRM: Site Selection via Mutil-round Meanshift for Global Fairness[C].</span></span> <span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;"> </span></span><span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">In '''''Proceedings of ICTAI 2022''''', Accepted</span></span> | ||
#<span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">Yu H., etc. ''Not All Edges are Peers: Accurate Structure-Aware Graph Pooling Networks''</span></span><span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">[J]</span></span><span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">. '''''Neural Networks''''', Accepted</span></span> | #<span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">Yu H., etc. ''Not All Edges are Peers: Accurate Structure-Aware Graph Pooling Networks''</span></span><span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">[J]</span></span><span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">. '''''Neural Networks''''', Accepted</span></span> | ||
#<span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">Xu M., Zhang B., Cao M., Yu H., Wang C. LSEGNN: Encode Local Topology Structure in Graph Neural Networks | #<span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">Xu M., Zhang B., Cao M., Yu H., Wang C. LSEGNN: Encode Local Topology Structure in Graph Neural Networks[C].</span></span><span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;"> </span></span><span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">In '''''Proceedings of '''''<i>'''IPCCC 2022'''</i>, Accepted</span></span> | ||
#<span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">Zhang Y., Shen J., Yu C., Wang C. Views Meet Labels: Personalized Relation Refinement Network for Multiview Multilabel Learning</span></span><span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">[J]</span></span><span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">.</span></span><span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">'''''IEEE Multim'''''. 2022, 29(2): 104-113</span></span> | #<span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">Zhang Y., Shen J., Yu C., Wang C. Views Meet Labels: Personalized Relation Refinement Network for Multiview Multilabel Learning</span></span><span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">[J]</span></span><span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">.</span></span><span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">'''''IEEE Multim'''''. 2022, 29(2): 104-113</span></span> | ||
#<span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">Wu J., Cao J., Sun H., and Wang C. A Bayesian Optimal Social Law Synthesizing Mechanism for Strategic Agents[J]. '''''JAAMAS'''''</span></span><span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">, 2022, 36(2)</span></span> | #<span style="font-size:medium;"><span style="font-family:Times New Roman,Times,serif;">Wu J., Cao J., Sun H., and Wang C. A Bayesian Optimal Social Law Synthesizing Mechanism for Strategic Agents[J]. '''''JAAMAS'''''</span></span><span style="font-family:Times New Roman,Times,serif;"><span style="font-size:medium;">, 2022, 36(2)</span></span> | ||