# Unsupervised Cross-Domain Prerequisite Chain Learning using Variational Graph Autoencoders Source: [Unsupervised Cross-Domain Prerequisite Chain Learning using Variational Graph Autoencoders]() Collection index: [llms.txt]() Data updated: 2026-01-04T05:02:24.299Z Authors: Irene Li, Vanessa Yan, Tianxiao Li, Rihao Qu, Dragomir Radev Published: 2021-05-07T21:02:41.000Z ## Abstract Learning prerequisite chains is an essential task for efficiently acquiring knowledge in both known and unknown domains. For example, one may be an expert in the natural language processing (NLP) domain but want to determine the best order to learn new concepts in an unfamiliar Computer Vision domain (CV). Both domains share some common concepts, such as machine learning basics and deep learning models. In this paper, we propose unsupervised cross-domain concept prerequisite chain learning using an optimized variational graph autoencoder. Our model learns to transfer concept prerequisite relations from an information-rich domain (source domain) to an information-poor domain (target domain), substantially surpassing other baseline models. Also, we expand an existing dataset by introducing two new domains: CV and Bioinformatics (BIO). The annotated data and resources, as well as the code, will be made publicly available. ## Recorded benchmark results A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage. - [Prerequisite Chain Learning on NLP to CV domain](): Prerequisite Chain Learning; NLP to CV domain; F1 Score: 0.6754. - [Prerequisite Chain Learning on NLP to BIO domain](): Prerequisite Chain Learning; NLP to BIO domain; F1 Score: 65.12. ## Original sources and implementation [Original paper]() [PDF]() [Implementation]()