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

Emily Zhao

dblp:232/1898 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2023
0000-0002-4055-0774ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 3 · 3 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

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
Representation and self-supervised learning · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
embedding learning
0.512021
eTREE: Learning Tree-structured Embeddings · AAAI 2021
Machine learning › Representation and self-supervised learning
matrix factorization
0.512021
eTREE: Learning Tree-structured Embeddings · AAAI 2021
Machine learning › Representation and self-supervised learning › matrix factorization
nonnegative matrix factorization
0.512021
eTREE: Learning Tree-structured Embeddings · AAAI 2021
Data mining › clustering
hierarchical clustering
0.512021
eTREE: Learning Tree-structured Embeddings · AAAI 2021

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

parallel computing · 1.0non-negative matrix factorization · 1.0
YearPublicationVenuePosition
2023 Predicting line of therapy transition via similar patient augmentation
Suhan Cui, Guanhao Wei, Emily Zhao, Ting Wang 0006, Fenglong Ma
J. Biomed. Informatics4
2021 eTREE: Learning Tree-structured Embeddings
abstract
Matrix factorization (MF) plays an important role in a wide range of machine learning and data mining models. MF is commonly used to obtain item embeddings and feature representations due to its ability to capture correlations and higher-order statistical dependencies across dimensions. In many applications, the categories of items exhibit a hierarchical tree structure. For instance, human diseases can be divided into coarse categories, e.g., bacterial, and viral. These categories can be further divided into finer categories, e.g., viral infections can be respiratory, gastrointestinal, and exanthematous viral diseases. In e-commerce, products, movies, books, etc., are grouped into hierarchical categories, e.g., clothing items are divided by gender, then by type (formal, casual, etc.). While the tree structure and the categories of the different items may be known in some applications, they have to be learned together with the embeddings in many others. In this work, we propose eTREE, a model that incorporates the (usually ignored) tree structure to enhance the quality of the embeddings. We leverage the special uniqueness properties of Nonnegative MF (NMF) to prove identifiability of eTREE. The proposed model not only exploits the tree structure prior, but also learns the hierarchical clustering in an unsupervised data-driven fashion. We derive an efficient algorithmic solution and a scalable implementation of eTREE that exploits parallel computing, computation caching, and warm start strategies. We showcase the effectiveness of eTREE on real data from various application domains: healthcare, recommender systems, and education. We also demonstrate the meaningfulness of the tree obtained from eTREE by means of domain experts interpretation.
Faisal M. Almutairi, Yunlong Wang 0001, Emily Zhao, Nicholas D. Sidiropoulos
AAAI4
2021 OA-MedSQL: Order-Aware Medical Sequence Learning for Clinical Outcome Prediction
abstract
Leveraging large amounts of longitudinal electronic health records (EHR) data has shown great potentials for predicting progression of various diseases. In this work, we proposed a deep learning algorithm based on a customized Long Short-Term Memory (LSTM) model with built-in temporal sequence learning mechanism, named as Order-Aware Medical SeQuence Learning (OA-MedSQL). The model can predict various clinical outcomes from EHR sequences with competitive accuracies, meanwhile automatically distills patient medical journeys into clinically meaningful and relevant temporal sequences. The extraction of milestone temporal sequences is mainly facilitated by enforcing an order to the neurons of the LSTM model when updating their cell states at each time step. We have evaluated the proposed approach on a real-world EHR dataset that focuses on the task of predicting first-line treatment initiation for Waldenström Macroglobulinemia (WM) patients. OA-MedSQL can achieve comparable or better performance than several competitive baseline methods. Furthermore, OA-MedSQL offers a native way to extract milestone temporal sequences that are both explanatory of patient journeys and predictive of clinical outcomes.
Tong Wu 0001, Yunlong Wang 0001, Emily Zhao
BIBM4
2021 Treatment initiation prediction by EHR mapped PPD tensor based convolutional neural networks boosting algorithm
Xueli Xiao, Guanhao Wei, Yi Pan 0001, Huan Jing, Emily Zhao, Yilian Yuan
J. Biomed. Informatics6