Ziyi Kou

Ziyi Kou

Auto-generated profile, based on publicly available information

Ziyi Kou

University of Notre Dame, Notre Dame, IN, USA

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
5 November 2020
Verified
Book Chapter
Closed access
PDF file
LCLele Chen
Lele Chen
GCGuofeng Cui
Guofeng Cui
CLCelong Liu
Celong Liu
ZLZhong Li
Zhong Li
ZKZiyi Kou
Ziyi Kou
CXChenliang Xu
Chenliang Xu

17 October 2022
Verified
Conference Paper
Open access
ZYZhenrui Yue
Zhenrui Yue
HZHuimin Zeng
Huimin Zeng
ZKZiyi Kou
Ziyi Kou
LSLanyu Shang
Lanyu Shang
DWDong Wang
Dong Wang
Despite recent progress in improving the performance of misinformation detection systems, classifying misinformation in an unseen domain remains an elusive challenge. To address this issue, a common approach is to introduce a domain critic and encourage domain-invariant input features. However, early misinformation often demonstrates both conditional and label shifts against existing misinformation data (e.g., class imbalance in COVID-19 datasets), rendering such methods less effective for detecting early misinformation. In this paper, we propose contrastive adaptation network for early misinformation detection (CANMD). Specifically, we leverage pseudo labeling to generate high-confidence target examples for joint training with source data. We additionally design a label correction component to estimate and correct the label shifts (i.e., class priors) between the source and target domains. Moreover, a contrastive adaptation loss is integrated in the objective function to reduce the intra-class discrepancy and enlarge the inter-class discrepancy. As such, the adapted model learns corrected class priors and an invariant conditional distribution across both domains for improved estimation of the target data distribution. To demonstrate the effectiveness of the proposed CANMD, we study the case of COVID-19 early misinformation detection and perform extensive experiments using multiple real-world datasets. The results suggest that CANMD can effectively adapt misinformation detection systems to the unseen COVID-19 target domain with significant improvements compared to the state-of-the-art baselines.

4 August 2023
Verified
Conference Paper
Open access
SPShichao Pei
Shichao Pei
ZKZiyi Kou
Ziyi Kou
QZQiannan Zhang
Qiannan Zhang
XZXiangliang Zhang
Xiangliang Zhang
Despite their capacity to convey knowledge, most existing knowledge graphs (KGs) are created for specific domains using low-resource data sources, especially those in non-global languages, and thus unavoidably suffer from the incompleteness problem. The automatic discovery of missing triples for KG completion is thus hindered by the challenging long-tail relations problem in low-resource KGs. Few-shot learning models trained on rich-resource KGs are unable to tackle this challenge due to a lack of generalization. To alleviate the impact of the intractable long-tail problem on low-resource KG completion, in this paper, we propose a novel few-shot learning framework empowered by multi-view task representation generation. The framework consists of four components, i.e., few-shot learner, perturbed few-shot learner, relation knowledge distiller, and pairwise contrastive distiller. The key idea is to utilize the different views of each few-shot task to improve and regulate the training of the few-shot learner. For each few-shot task, instead of augmenting it by complicated task designs, we generate its representation of different views using the relation knowledge distiller and perturbed few-shot learner, which are obtained by distilling knowledge from a KG encoder and perturbing the few-shot learner. Then, the generated representation of different views is utilized by the pairwise contrastive distiller based on a teacher-student framework to distill the knowledge of how to represent relations from different views into the few-shot learner and facilitate few-shot learning. Extensive experiments conducted on several real-world low-resource KGs validate the effectiveness of our proposed method.

21 October 2024
Verified
Conference Paper
Open access
ZLZhuofeng Li
Zhuofeng Li
HZHaoxiang Zhang
Haoxiang Zhang
QZQiannan Zhang
Qiannan Zhang
ZKZiyi Kou
Ziyi Kou
SPShichao Pei
Shichao Pei
Knowledge graph (KG) completion has been increasingly recognized as a vital approach for uncovering missing knowledge and addressing the incompleteness issue in KGs. To enhance inference on rare relations and mitigate the impact of the long-tail distribution, the dominant strategy designs few-shot models following the meta-learning paradigm. However, these approaches typically operate under the assumption that KGs are available instantly, disregarding the newly emerging relations during KG enrichment. Thus, the emergence of these novel relations presents a need for few-shot models to continually learn from emerging knowledge. Although promising, two significant obstacles, i.e., catastrophic forgetting and the scarcity of novel relations, prevent effective learning from newly emerging relations. In this paper, we propose a novel framework designed to equip the few-shot model with the ability to learn sequentially from novel relations. Specifically, we introduce innovative strategies at both data and model levels: data-level rehearsal and model-level modulation to address catastrophic forgetting, alongside multi-view relation augmentation aimed at resolving the issue of insufficient novel relations. Extensive experiments conducted on real-world KGs validate the effectiveness of our proposed method.

21 October 2023
Verified
Conference Paper
Open access
ZKZiyi Kou
Ziyi Kou
SMSaurav Manchanda
Saurav Manchanda
SLShih-Ting Lin
Shih-Ting Lin
MXMin Xie
Min Xie
HWHaixun Wang
Haixun Wang
XZXiangliang Zhang
Xiangliang Zhang
Next Basket Recommendation (NBR) aims to recommend a set of products as a basket to users based on their historical shopping behavior. In this paper, we investigate the problem of NBR in online marketplaces (e.g., Instacart, Uber Eats) that connect users with multiple sellers. In such scenarios, effective NBR can significantly enhance the shopping experience of users by recommending diversified and completed products based on specific sellers, especially when a user purchases from a seller they have not visited before. However, conventional NBR approaches assume that all considered products are from the same sellers, which overlooks the complex relationships between users, sellers, and products. To address such limitations, we develop SecGT, a sequential collaborative graph transformer framework that recommends users with baskets from specific sellers based on seller-aware user preference representations that are generated by collaboratively modeling the joint user-seller-product interactions and sequentially exploring the user-agnostic basket transitions in an interactive way. We evaluate the performance of SecGT on users from a leading online marketplace at multiple cities with various involved sellers. The results show that SecGT outperforms existing NBR and also traditional product recommendation approaches on recommending baskets from cold sellers for different types of users across all cities.

25 June 2021
Verified
Conference Paper
Closed access
YZYang Zhang
Yang Zhang
RZRuohan Zong
Ruohan Zong
ZKZiyi Kou
Ziyi Kou
LSLanyu Shang
Lanyu Shang
DWDong Wang
Dong Wang
Streaming disaster damage assessment (DDA) aims to automatically assess the damage severity of affected areas in a disaster event on the fly by leveraging the streaming imagery data about the disaster on social media. In this paper, we focus on a dynamic optimal neural architecture searching (NAS) problem in streaming DDA applications. Our goal is to dynamically determine the optimal neural network architecture that accurately estimates the damage severity for each newly-arrived image in the stream by leveraging human intelligence from the crowdsourcing systems. Our work is motivated by the observations that the neural network architectures in current DDA solutions are mainly designed by AI experts, which often leads to non-negligible costs and errors given the dynamic nature of the streaming DDA applications and the lack of real-time annotations of the massive social media data inputs. In this paper, we develop CD-NAS, a crowd-driven dynamic NAS framework that is inspired by novel techniques from AI, crowdsourcing, and estimation theory to address the dynamic optimal NAS problem. The evaluation results from a real-world streaming DDA application show that CD-NAS consistently outperforms the state-of-the-art AI and NAS baselines by achieving the highest disaster damage assessment accuracy.