Tianyi Han

Tianyi Han

Auto-generated profile, based on publicly available information

Tianyi Han

College of Computer Science, Nankai University, Tianjin, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 January 2022 in Cognitive Computation
Verified
Journal Article
Closed access
PDF file
JZJin Zhang
Jin Zhang
FFFan Feng
Fan Feng
THTianyi Han
Tianyi Han
XGXiaoli Gong
Xiaoli Gong
FDFeng DUAN
Feng DUAN

20 May 2022 in IEEE Journal of Biomedical and Health Informatics
Verified
Journal Article
Closed access
THTianyi Han
Tianyi Han
XGXiaoli Gong
Xiaoli Gong
FFFan Feng
Fan Feng
JZJin Zhang
Jin Zhang
Zhe SunZhe Sun
Zhe Sun
YZYu Zhang
Yu Zhang
Great progress has been made in diagnosing medical diseases based on deep learning. Large-scale medical data are expected to improve deep learning performance further. It is almost impossible for a single institution to collect so much data due to the time-consuming and costly collection and labeling of medical data. Many studies have turned attention to data sharing among multiple medical institutions. However, due to different data acquiring and processing procedures, multiple institutions' medical data is characterized by distribution heterogeneity. Besides, the protection of patient privacy in medical data sharing has also been a common concern. To simultaneously address the problems of heterogeneous data distribution and privacy protection, we propose a novel multi-source source free domain adaptation. When aligning distributed heterogeneous data, our method only requires the pre-trained source models rather than direct access to the source domain data, thus protecting patients' privacy. In addition, it has the advantages of being efficient and less costly in network resources. The proposed method is evaluated on the multi-site fMRI database Autism Brain Imaging Data Exchange (ABIDE) and yields an average accuracy of 69.54%. We also analyzed its effectiveness on network resource-saving and conducted additional experiments on Camelyon17 to validate the generalization.

1 December 2021 in Solar Energy
Verified
Journal Article
Closed access
ZWZhi-Sheng Wu
Zhi-Sheng Wu
WGWang-Jun Guo
Wang-Jun Guo
XSXin-Chao Song
Xin-Chao Song
JLJian-Qun Liu
Jian-Qun Liu
HWHu-Sheng Wang
Hu-Sheng Wang
ZCZhengjian Chen
Zhengjian Chen

11 September 2022 in arXiv
Verified
Preprint
Open access
PDF file
THTianyi Han
Tianyi Han
LJLiguo Jiao
Liguo Jiao
JLJae-Hyoung Lee
Jae-Hyoung Lee
JYJunping Yin
Junping Yin
In this paper, we focus on a class of robust vector polynomial optimization problems (RVPOP in short) without any convex assumptions. By combining/improving the utopia point method (a nonlinear scalarization) for vector optimization and "joint+marginal" relaxation method for polynomial optimization, we solve the RVPOP successfully. Both theoratical and computational aspects are considered.