Yu-Neng Chuang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yu-Neng Chuang has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Chia-Yuan Chang
Texas A&M University, College Station, TX, USA
3 shared publications - Kwei-Herng Lai
Rice University, Houston, TX, USA
3 shared publications - Xia Hu
Rice University, Houston, TX, USA
3 shared publications - Na Zou
Department of Industrial Engineering, University of Houston, Houston, TX, USA
2 shared publications - Ruixiang Tang
Department of Computer Science, Rice University, Houston, TX, USA
2 shared publications - Xiaoqian Jiang
McWilliams School of Biomedical Informatics, University of Texas Health Science Center at Houston , Houston, TX 77030
2 shared publications
Latest Publications
- Open Access
- 8 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20 (1) , 1-23
Privacy-Preserving Representation Learning with Gradient Obfuscation against Attribute Inference for Recommendation
Modern and effective recommender systems leverage not only user-item interactions but also private attributes of users to bring promising performance. Protecting private attributes from being inferred by the adversary has become a vital issue in recommender systems. In this work, we formulate the problem of privacy-preserving representation learning for recommendation (PrP-Rec). The design of PrP-Rec is to generate embeddings of users and items so that two inference attacks can be effectively defended. One is item-based attribute inference attack (IAI-Attack), and the other is embedding-based attribute retrieval attack (EAR-Attack). To tackle the PrP-Rec problem, we present a novel framework, privacy-preserving Bayesian personalized ranking (PBPR). The key is to create a learnable gradient obfuscation vector and have it injected into the embedding learning of users and items. The objective of gradient obfuscation is devised to optimize with recommendation and privacy protection. Extensive experiments conducted on three benchmark datasets exhibit that PBPR can outperform competing methods of privacy-preserving recommendation in the top-K recommendation and effectively defending IAI-Attack and EAR-Attack.
- 8 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20 (1) , 1-23
Open AccessPrivacy-Preserving Representation Learning with Gradient Obfuscation against Attribute Inference for Recommendation
Modern and effective recommender systems leverage not only user-item interactions but also private attributes of users to bring promising performance. Protecting private attributes from being inferred by the adversary has become a vital issue in recommender systems. In this work, we formulate the problem of privacy-preserving representation learning for recommendation (PrP-Rec). The design of PrP-Rec is to generate embeddings of users and items so that two inference attacks can be effectively defended. One is item-based attribute inference attack (IAI-Attack), and the other is embedding-based attribute retrieval attack (EAR-Attack). To tackle the PrP-Rec problem, we present a novel framework, privacy-preserving Bayesian personalized ranking (PBPR). The key is to create a learnable gradient obfuscation vector and have it injected into the embedding learning of users and items. The objective of gradient obfuscation is devised to optimize with recommendation and privacy protection. Extensive experiments conducted on three benchmark datasets exhibit that PBPR can outperform competing methods of privacy-preserving recommendation in the top-K recommendation and effectively defending IAI-Attack and EAR-Attack.
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 131-142
CODA: Temporal Domain Generalization via Concept Drift Simulator
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 131-142
Open AccessCODA: Temporal Domain Generalization via Concept Drift Simulator
- Open Access
- 14 February 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 19 (2) , 1-18
Fair-RGNN: Mitigating Relational Bias on Knowledge Graphs
Knowledge graph data are prevalent in real-world applications, and knowledge graph neural networks (KGNNs) are essential techniques for knowledge graph representation learning. Although KGNN effectively models the structural information from knowledge graphs, these frameworks amplify the underlying data bias that leads to discrimination towards certain groups or individuals in resulting applications. Additionally, as existing debiasing approaches mainly focus on entity-wise bias, eliminating the multi-hop relational bias that pervasively exists in knowledge graphs remains an open question. However, it is very challenging to eliminate relational bias due to the sparsity of the paths that generate the bias and the non-linear proximity structure of knowledge graphs. To tackle the challenges, we propose Fair-KGNN, a KGNN framework that simultaneously alleviates multi-hop bias and preserves the proximity information of entity-to-relation in knowledge graphs. The proposed framework is generalizable to mitigate relational bias for all types of KGNN. Fair-KGNN is applicable to incorporate two state-of-the-art KGNN models, RGCN and CompGCN, to mitigate gender-occupation and nationality-salary bias. The experiments carried out on three benchmark knowledge graph datasets demonstrate that Fair-KGNN can effectively mitigate unfair situations during representation learning while preserving the predictive performance of KGNN models. The source code of the proposed method is available at: https://github.com/ynchuang/Mitigating-Relational-Bias-on-Knowledge-Graphs .
- 14 February 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 19 (2) , 1-18
Open AccessFair-RGNN: Mitigating Relational Bias on Knowledge Graphs
Knowledge graph data are prevalent in real-world applications, and knowledge graph neural networks (KGNNs) are essential techniques for knowledge graph representation learning. Although KGNN effectively models the structural information from knowledge graphs, these frameworks amplify the underlying data bias that leads to discrimination towards certain groups or individuals in resulting applications. Additionally, as existing debiasing approaches mainly focus on entity-wise bias, eliminating the multi-hop relational bias that pervasively exists in knowledge graphs remains an open question. However, it is very challenging to eliminate relational bias due to the sparsity of the paths that generate the bias and the non-linear proximity structure of knowledge graphs. To tackle the challenges, we propose Fair-KGNN, a KGNN framework that simultaneously alleviates multi-hop bias and preserves the proximity information of entity-to-relation in knowledge graphs. The proposed framework is generalizable to mitigate relational bias for all types of KGNN. Fair-KGNN is applicable to incorporate two state-of-the-art KGNN models, RGCN and CompGCN, to mitigate gender-occupation and nationality-salary bias. The experiments carried out on three benchmark knowledge graph datasets demonstrate that Fair-KGNN can effectively mitigate unfair situations during representation learning while preserving the predictive performance of KGNN models. The source code of the proposed method is available at: https://github.com/ynchuang/Mitigating-Relational-Bias-on-Knowledge-Graphs .
- 6 February 2024
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 151, 104606
SPeC: A Soft Prompt-Based Calibration on Performance Variability of Large Language Model in Clinical Notes Summarization
- 6 February 2024
- Published by Elsevier in Journal of Biomedical Informatics
- Vol. 151, 104606
SPeC: A Soft Prompt-Based Calibration on Performance Variability of Large Language Model in Clinical Notes Summarization
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM) in CIKM: Conference on Information and Knowledge Management
- Vol. 2023, 5021-5025
DiscoverPath: A Knowledge Refinement and Retrieval System for Interdisciplinarity on Biomedical Research
The exponential growth in scholarly publications necessitates advanced tools for efficient article retrieval, especially in interdisciplinary fields where diverse terminologies are used to describe similar research. Traditional keyword-based search engines often fall short in assisting users who may not be familiar with specific terminologies. To address this, we present a knowledge graph based paper search engine for biomedical research to enhance the user experience in discovering relevant queries and articles. The system, dubbed DiscoverPath, employs Named Entity Recognition (NER) and part-of-speech (POS) tagging to extract terminologies and relationships from article abstracts to create a KG. To reduce information overload, DiscoverPath presents users with a focused subgraph containing the queried entity and its neighboring nodes and incorporates a query recommendation system enabling users to iteratively refine their queries. The system is equipped with an accessible Graphical User Interface that provides an intuitive visualization of the KG, query recommendations, and detailed article information, enabling efficient article retrieval, thus fostering interdisciplinary knowledge exploration.
- 21 October 2023
- Published by Association for Computing Machinery (ACM) in CIKM: Conference on Information and Knowledge Management
- Vol. 2023, 5021-5025
Open AccessDiscoverPath: A Knowledge Refinement and Retrieval System for Interdisciplinarity on Biomedical Research
The exponential growth in scholarly publications necessitates advanced tools for efficient article retrieval, especially in interdisciplinary fields where diverse terminologies are used to describe similar research. Traditional keyword-based search engines often fall short in assisting users who may not be familiar with specific terminologies. To address this, we present a knowledge graph based paper search engine for biomedical research to enhance the user experience in discovering relevant queries and articles. The system, dubbed DiscoverPath, employs Named Entity Recognition (NER) and part-of-speech (POS) tagging to extract terminologies and relationships from article abstracts to create a KG. To reduce information overload, DiscoverPath presents users with a focused subgraph containing the queried entity and its neighboring nodes and incorporates a query recommendation system enabling users to iteratively refine their queries. The system is equipped with an accessible Graphical User Interface that provides an intuitive visualization of the KG, query recommendations, and detailed article information, enabling efficient article retrieval, thus fostering interdisciplinary knowledge exploration.