Carl Yang

Carl Yang

Auto-generated profile, based on publicly available information

Carl Yang

Emory University

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
21 December 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
CYCarl Yang
Carl Yang
YXYuxin Xiao
Yuxin Xiao
YZYu Zhang
Yu Zhang
YSYizhou Sun
Yizhou Sun
JHJiawei Han
Jiawei Han
Since real-world objects and their interactions are often multi-modal and multi-typed, heterogeneous networks have been widely used as a more powerful, realistic, and generic superclass of traditional homogeneous networks (graphs). Meanwhile, representation learning ( a.k.a. embedding) has recently been intensively studied and shown effective for various network mining and analytical tasks. In this work, we aim to provide a unified framework to deeply summarize and evaluate existing research on heterogeneous network embedding (HNE), which includes but goes beyond a normal survey. Since there has already been a broad body of HNE algorithms, as the first contribution of this article, we provide a generic paradigm for the systematic categorization and analysis over the merits of various existing HNE algorithms. Moreover, existing HNE algorithms, though mostly claimed generic, are often evaluated on different datasets. Understandable due to the application favor of HNE, such indirect comparisons largely hinder the proper attribution of improved task performance towards effective data preprocessing and novel technical design, especially considering the various ways possible to construct a heterogeneous network from real-world application data. Therefore, as the second contribution, we create four benchmark datasets with various properties regarding scale, structure, attribute/label availability, and etc . from different sources, towards handy and fair evaluations of HNE algorithms. As the third contribution, we carefully refactor and amend the implementations and create friendly interfaces for 13 popular HNE algorithms, and provide all-around comparisons among them over multiple tasks and experimental settings. By putting all existing HNE algorithms under a unified framework, we aim to provide a universal reference and guideline for the understanding and development of HNE algorithms. Meanwhile, by open-sourcing all data and code, we envision to serve the community with an ready-to-use benchmark platform to test and compare the performance of existing and future HNE algorithms ( https://github.com/yangji9181/HNE ).

1 November 2022 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Closed access
HCHejie Cui
Hejie Cui
WDWei Dai
Wei Dai
YZYanqiao Zhu
Yanqiao Zhu
XKXuan Kan
Xuan Kan
AGAntonio Aodong Chen Gu
Antonio Aodong Chen Gu
CYCarl Yang
Carl Yang
Mapping the connectome of the human brain using structural or functional connectivity has become one of the most pervasive paradigms for neuroimaging analysis. Recently, Graph Neural Networks (GNNs) motivated from geometric deep learning have attracted broad interest due to their established power for modeling complex networked data. Despite their superior performance in many fields, there has not yet been a systematic study of how to design effective GNNs for brain network analysis. To bridge this gap, we present BrainGB, a benchmark for brain network analysis with GNNs. BrainGB standardizes the process by (1) summarizing brain network construction pipelines for both functional and structural neuroimaging modalities and (2) modularizing the implementation of GNN designs. We conduct extensive experiments on datasets across cohorts and modalities and recommend a set of general recipes for effective GNN designs on brain networks. To support open and reproducible research on GNN-based brain network analysis, we host the BrainGB website at https://braingb.us with models, tutorials, examples, as well as an out-of-box Python package. We hope that this work will provide useful empirical evidence and offer insights for future research in this novel and promising direction.

6 October 2025 in ACM Computing Surveys
Verified
Journal Article
Open access
LCLing Chen
Ling Chen
XZXujiang Zhao
Xujiang Zhao
JLJiaying Lu
Jiaying Lu
CDChengyuan Deng
Chengyuan Deng
CZCan Zheng
Can Zheng
LZLiang Zhao
Liang Zhao
Large language models (LLMs) have significantly advanced the field of natural language processing (NLP), providing a highly useful, task-agnostic foundation for a wide range of applications. However, directly applying LLMs to solve sophisticated problems in specific domains meets many hurdles, caused by the heterogeneity of domain data, the sophistication of domain knowledge, the uniqueness of domain objectives, and the diversity of the constraints (e.g., various social norms, cultural conformity, religious beliefs, and ethical standards in the domain applications). Domain specification techniques are key to making large language models disruptive in many applications. Specifically, to solve these hurdles, there has been a notable increase in research and practices conducted in recent years on the domain specialization of LLMs. This emerging field of study, with its substantial potential for impact, necessitates a comprehensive and systematic review to summarize better and guide ongoing work in this area. In this article, we present a comprehensive survey on domain specification techniques for large language models, an emerging direction critical for large language model applications. First, we propose a systematic taxonomy that categorizes the LLM domain-specialization techniques based on the accessibility to LLMs and summarizes the framework for all the subcategories as well as their relations and differences to each other. Second, we present an extensive taxonomy of critical application domains that can benefit dramatically from specialized LLMs, discussing their practical significance and open challenges. Last, we offer our insights into the current research status and future trends in this area.

16 September 2022
Verified
Book Chapter
Closed access
PDF file
HCHejie Cui
Hejie Cui
WDWei Dai
Wei Dai
YZYanqiao Zhu
Yanqiao Zhu
XLXiaoxiao Li
Xiaoxiao Li
LHLifang He
Lifang He
CYCarl Yang
Carl Yang

1 January 2024
Verified
Conference Paper
Open access
PDF file
WSWenqi Shi
Wenqi Shi
RXRan Xu
Ran Xu
YZYuchen Zhuang
Yuchen Zhuang
YYYue Yu
Yue Yu
JZJieyu Zhang
Jieyu Zhang
MWMay Dongmei Wang
May Dongmei Wang
Wenqi Shi, Ran Xu, Yuchen Zhuang, Yue Yu, Jieyu Zhang, Hang Wu, Yuanda Zhu, Joyce C. Ho, Carl Yang, May Dongmei Wang. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 2024.

4 March 2024
Verified
Conference Paper
Open access
ARAmit Roy
Amit Roy
JSJuan Shu
Juan Shu
JLJia Li
Jia Li
CYCarl Yang
Carl Yang
OEOlivier Elshocht
Olivier Elshocht
PLPan Li
Pan Li
Graph Anomaly Detection (GAD) is a technique used to identify abnormal nodes within graphs, finding applications in network security, fraud detection, social media spam detection, and various other domains. A common method for GAD is Graph Auto-Encoders (GAEs), which encode graph data into node representations and identify anomalies by assessing the reconstruction quality of the graphs based on these representations. However, existing GAE models are primarily optimized for direct link reconstruction, resulting in nodes connected in the graph being clustered in the latent space. As a result, they excel at detecting cluster-type structural anomalies but struggle with more complex structural anomalies that do not conform to clusters. To address this limitation, we propose a novel solution called \proj, a new variant of GAE that incorporates neighborhood reconstruction for graph anomaly detection. \proj aims to reconstruct the entire neighborhood of a node, encompassing the local structure, self-attributes, and neighbor attributes, based on the corresponding node representation. By comparing the neighborhood reconstruction loss between anomalous nodes and normal nodes, \proj can effectively detect any anomalies. Extensive experimentation conducted on six real-world datasets validates the effectiveness of \proj, showcasing significant improvements (by up to 30%\uparrow in AUC) over state-of-the-art competitors. The \hrefhttps://github.com/anonymoususer437/GAD-NR \textcolorcyan source code for \proj is openly available. Importantly, the comparative analysis reveals that the existing methods perform well only in detecting one or two types of anomalies out of the three types studied. In contrast, GAD-NR excels at detecting all three types of anomalies across the datasets, demonstrating its comprehensive anomaly detection capabilities.