Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xiaomei Bai

dblp:170/1802 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0001-9826-4802ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 77% Deep learning architectures and training · 23%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
fairness
0.412020
Graduate Employment Prediction with Bias · AAAI 2020
Machine learning › Trustworthy machine learning › fairness › model bias
predictive bias
0.412020
Graduate Employment Prediction with Bias · AAAI 2020
Computing education
educational data mining
0.412020
Graduate Employment Prediction with Bias · AAAI 2020
Machine learning › Deep learning architectures and training › recurrent neural network
LSTM
0.112020
Graduate Employment Prediction with Bias · AAAI 2020
Machine learning › Deep learning architectures and training
recurrent neural network
0.112020
Graduate Employment Prediction with Bias · AAAI 2020

Methods — techniques the papers use, named apart from their topics

regularization · 0.9generative adversarial network · 0.9embedding · 0.9LSTM · 0.9
YearPublicationVenuePosition
2024 Physics-Informed Explainable Continual Learning on Graphs
abstract
Temporal graph learning has attracted great attention with its ability to deal with dynamic graphs. Although current methods are reasonably accurate, most of them are unexplainable due to their black-box nature. It remains a challenge to explain how temporal graph learning models adapt to information evolution. Furthermore, with the increasing application of artificial intelligence in various scientific domains, such as chemistry and biomedicine, the importance of delivering not only precise outcomes but also offering explanations regarding the learning models becomes paramount. This transparency aids users in comprehending the decision-making procedures and instills greater confidence in the generated models. To address this issue, this article proposes a novel physics-informed explainable continual learning (PiECL), focusing on temporal graphs. Our proposed method utilizes physical and mathematical algorithms to quantify the disturbance of new data to previous knowledge for obtaining changed information over time. As the proposed model is based on theories in physics, it can provide a transparent underlying mechanism for information evolution detection, thus enhancing explainability. The experimental results on three real-world datasets demonstrate that PiECL can explain the learning process, and the generated model outperforms other state-of-the-art methods. PiECL shows tremendous potential for explaining temporal graph learning in various scientific contexts.
Ciyuan Peng, Tao Tang 0007, Qiuyang Yin, Xiaomei Bai, Suryani Lim, Charu C. Aggarwal
IEEE Trans. Neural Networks Learn. Syst.4
2023 Lost at starting line: Predicting maladaptation of university freshmen based on educational big data
abstract
Abstract The transition from secondary education to higher education could be challenging for most freshmen. For students who fail to adjust to university life smoothly, their status may worsen if the university cannot offer timely and proper guidance. Helping students adapt to university life is a long‐term goal for any academic institution. Therefore, understanding the nature of the maladaptation phenomenon and the early prediction of “at‐risk” students are crucial tasks that urgently need to be tackled effectively. This article aims to analyze the relevant factors that affect the maladaptation phenomenon and predict this phenomenon in advance. We develop a prediction framework (MAladaptive STudEnt pRediction, MASTER) for the early prediction of students with maladaptation. First, our framework uses the SMOTE (Synthetic Minority Oversampling Technique) algorithm to solve the data label imbalance issue. Moreover, a novel ensemble algorithm, priority forest, is proposed for outputting ranks instead of binary results, which enables us to perform proactive interventions in a prioritized manner where limited education resources are available. Experimental results on real‐world education datasets demonstrate that the MASTER framework outperforms other state‐of‐art methods.
Teng Guo 0002, Xiaomei Bai, Shihao Zhen, Shagufta Abid, Feng Xia 0001
J. Assoc. Inf. Sci. Technol.2
2020 Graduate Employment Prediction with Bias
abstract
The failure of landing a job for college students could cause serious social consequences such as drunkenness and suicide. In addition to academic performance, unconscious biases can become one key obstacle for hunting jobs for graduating students. Thus, it is necessary to understand these unconscious biases so that we can help these students at an early stage with more personalized intervention. In this paper, we develop a framework, i.e., MAYA (Multi-mAjor emploYment stAtus) to predict students' employment status while considering biases. The framework consists of four major components. Firstly, we solve the heterogeneity of student courses by embedding academic performance into a unified space. Then, we apply a generative adversarial network (GAN) to overcome the class imbalance problem. Thirdly, we adopt Long Short-Term Memory (LSTM) with a novel dropout mechanism to comprehensively capture sequential information among semesters. Finally, we design a bias-based regularization to capture the job market biases. We conduct extensive experiments on a large-scale educational dataset and the results demonstrate the effectiveness of our prediction framework.
Teng Guo 0002, Feng Xia 0001, Shihao Zhen, Xiaomei Bai, Dongyu Zhang 0001, Zitao Liu 0001, Jiliang Tang
AAAI4