Yucheng Jin

Yucheng Jin

Auto-generated profile, based on publicly available information

Yucheng Jin

Shanghai Key Laboratory of Data Science, School of Computer Science, Fudan University Shanghai, Fudan University, Shanghai, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
30 April 2023
Verified
Conference Paper
Open access
YZYao Zhang
Yao Zhang
YXYun Xiong
Yun Xiong
YLYongxiang Liao
Yongxiang Liao
YSYiheng Sun
Yiheng Sun
YJYucheng Jin
Yucheng Jin
YZYangyong Zhu
Yangyong Zhu
Temporal interaction graphs (TIGs), consisting of sequences of timestamped interaction events, are prevalent in fields like e-commerce and social networks. To better learn dynamic node embeddings that vary over time, researchers have proposed a series of temporal graph neural networks for TIGs. However, due to the entangled temporal and structural dependencies, existing methods have to process the sequence of events chronologically and consecutively to ensure node representations are up-to-date. This prevents existing models from parallelization and reduces their flexibility in industrial applications. To tackle the above challenge, in this paper, we propose TIGER, a TIG embedding model that can restart at any timestamp. We introduce a restarter module that generates surrogate representations acting as the warm initialization of node representations. By restarting from multiple timestamps simultaneously, we divide the sequence into multiple chunks and naturally enable the parallelization of the model. Moreover, in contrast to previous models that utilize a single memory unit, we introduce a dual memory module to better exploit neighborhood information and alleviate the staleness problem. Extensive experiments on four public datasets and one industrial dataset are conducted, and the results verify both the effectiveness and the efficiency of our work.

7 December 2022 in Journal of the American Medical Informatics Association
Verified
Journal Article
Closed access
PDF file
YJYucheng Jin
Yucheng Jin
YXYun Xiong
Yun Xiong
DSDan Shi
Dan Shi
YLYifei Lin
Yifei Lin
LHLifang He
Lifang He
CTChunlei Tang
Chunlei Tang
Objectives: To develop an unbiased objective for learning automatic coding algorithms from clinical records annotated with only partial relevant International Classification of Diseases codes, as annotation noise in undercoded clinical records used as training data can mislead the learning process of deep neural networks.Materials and Methods: We use Medical Information Mart for Intensive Care III as our dataset. We employ positive-unlabeled learning to achieve unbiased loss estimation, which is free of misleading training signal. We then utilize reweighting mechanism to compensate for the imbalance between positive and negative samples. To further close the performance gap caused by poor quality annotation, we integrate the supervision provided by the automatic annotation tool Medical Concept Annotation Toolkit which can ease the heavy burden of manual validation.Results: Our benchmarking results show that positive-unlabeled learning with reweighting outperforms competitive baseline methods over a range of missing label ratios. Integrating supervision provided by annotation tool further boosted the performance.Discussion: Considering the annotation noise and severe imbalance, unbiased loss estimation and reweighting mechanism are both important for learning from undercoded clinical records. Unbiased loss requires the estimation of false negative ratios and estimation through trained models is practical and competitive.Conclusions: The combination of positive-unlabeled learning with reweighting and supervision provided by the annotation tool is a promising solution to learn from undercoded clinical records.

21 October 2024
Verified
Conference Paper
Open access
KXKaiyu Xiong
Kaiyu Xiong
YJYucheng Jin
Yucheng Jin
YXYun Xiong
Yun Xiong
JZJiawei Zhang
Jiawei Zhang
Community detection plays a pivotal role in network analysis, with applications in recommendation systems, anomaly detection, and biochemistry. However, traditional methods, while computationally efficient, often fall short in managing the complexities of real-world network structures. In contrast, deep learning approaches enhance accuracy but require substantial computational resources and task-specific architectures. This paper introduce GetCom, a novel three-phase "pre-train, generate, prompt" framework that integrates traditional methods and deep learning techniques. In the pre-training phase, GetCom acquires comprehensive understanding of community structures, which provides a solid foundation for the subsequent phases. During the generation phase, traditional community detection methods are employed to efficiently identify potential communities, which are subsequently refined in the prompt learning phase. This integration offers an efficient, accurate, and generalizable solution for community detection. Experiments on five real-world network datasets demonstrate that GetCom achieves state-of-the-art performance, with strong efficiency and generalization capabilities across diverse datasets and tasks.