Wenjie Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wenjie Xu has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Albert Dinh
Department of Electrical & Computer Engineering, University of Alberta, Edmonton, AB T6G 1H9, Canada
2 shared publications - Jun Xiao
Department of Electrical & Computer Engineering, University of Alberta, Edmonton, AB T6G 1H9, Canada
2 shared publications - Marek Reformat
Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB T6G 1H9, Canada
2 shared publications - Michael Lipsett
Department of Mechanical Engineering, University of Alberta Edmonton, Edmonton, AB T6G 1H9, Canada
2 shared publications - MohammadHossein Reshadi
Department of Electrical & Computer Engineering, University of Alberta, Edmonton, AB T6G 1H9, Canada
2 shared publications - Precious Omashor
Department of Electrical & Computer Engineering, University of Alberta, Edmonton, AB T6G 1H9, Canada
2 shared publications
Latest Publications
- Open Access
Construction of Topic Hierarchy with Subtree Representation for Knowledge Graphs
Hierarchy analysis of the knowledge graphs aims to discover the latent structure inherent in knowledge base data. Drawing inspiration from topic modeling, which identifies latent themes and content patterns in text corpora, our research seeks to adapt these analytical frameworks to the hierarchical exploration of knowledge graphs. Specifically, we adopt a non-parametric probabilistic model, the nested hierarchical Dirichlet process, to the field of knowledge graphs. This model discovers latent subject-specific distributions along paths within the tree. Consequently, the global tree can be viewed as a collection of local subtrees for each subject, allowing us to represent subtrees for each subject and reveal cross-thematic topics. We assess the efficacy of this model in analyzing the topics and word distributions that form the hierarchical structure of complex knowledge graphs. We quantitatively evaluate our model using four common datasets: Freebase, Wikidata, DBpedia, and WebRED, demonstrating that it outperforms the latest neural hierarchical clustering techniques such as TraCo, SawETM, and HyperMiner. Additionally, we provide a qualitative assessment of the induced subtree for a single subject.
Open AccessConstruction of Topic Hierarchy with Subtree Representation for Knowledge Graphs
Hierarchy analysis of the knowledge graphs aims to discover the latent structure inherent in knowledge base data. Drawing inspiration from topic modeling, which identifies latent themes and content patterns in text corpora, our research seeks to adapt these analytical frameworks to the hierarchical exploration of knowledge graphs. Specifically, we adopt a non-parametric probabilistic model, the nested hierarchical Dirichlet process, to the field of knowledge graphs. This model discovers latent subject-specific distributions along paths within the tree. Consequently, the global tree can be viewed as a collection of local subtrees for each subject, allowing us to represent subtrees for each subject and reveal cross-thematic topics. We assess the efficacy of this model in analyzing the topics and word distributions that form the hierarchical structure of complex knowledge graphs. We quantitatively evaluate our model using four common datasets: Freebase, Wikidata, DBpedia, and WebRED, demonstrating that it outperforms the latest neural hierarchical clustering techniques such as TraCo, SawETM, and HyperMiner. Additionally, we provide a qualitative assessment of the induced subtree for a single subject.
- Open Access
- 5 September 2024
- Published by MDPI AG in Algorithms
- Vol. 17 (9) , 392
Correction: Reshadi et al. Deep-Shallow Metaclassifier with Synthetic Minority Oversampling for Anomaly Detection in a Time Series. Algorithms 2024, 17, 114
The authors wish to make the following correction to their paper
- 5 September 2024
- Published by MDPI AG in Algorithms
- Vol. 17 (9) , 392
Open AccessCorrection: Reshadi et al. Deep-Shallow Metaclassifier with Synthetic Minority Oversampling for Anomaly Detection in a Time Series. Algorithms 2024, 17, 114
The authors wish to make the following correction to their paper
- Open Access
- 10 March 2024
- Published by MDPI AG in Algorithms
- Vol. 17 (3) , 114
Deep-Shallow Metaclassifier with Synthetic Minority Oversampling for Anomaly Detection in a Time Series
Anomaly detection in data streams (and particularly time series) is today a vitally important task. Machine learning algorithms are a common design for achieving this goal. In particular, deep learning has, in the last decade, proven to be substantially more accurate than shallow learning in a wide variety of machine learning problems, and deep anomaly detection is very effective for point anomalies. However, deep semi-supervised contextual anomaly detection (in which anomalies within a time series are rare and none at all occur in the algorithm’s training data) is a more difficult problem. Hybrid anomaly detectors (a “normal model” followed by a comparator) are one approach to these problems, but the separate loss functions for the two components can lead to inferior performance. We investigate a novel synthetic-example oversampling technique to harmonize the two components of a hybrid system, thus improving the anomaly detector’s performance. We evaluate our algorithm on two distinct problems: identifying pipeline leaks and patient-ventilator asynchrony.
- 10 March 2024
- Published by MDPI AG in Algorithms
- Vol. 17 (3) , 114
Open AccessDeep-Shallow Metaclassifier with Synthetic Minority Oversampling for Anomaly Detection in a Time Series
Anomaly detection in data streams (and particularly time series) is today a vitally important task. Machine learning algorithms are a common design for achieving this goal. In particular, deep learning has, in the last decade, proven to be substantially more accurate than shallow learning in a wide variety of machine learning problems, and deep anomaly detection is very effective for point anomalies. However, deep semi-supervised contextual anomaly detection (in which anomalies within a time series are rare and none at all occur in the algorithm’s training data) is a more difficult problem. Hybrid anomaly detectors (a “normal model” followed by a comparator) are one approach to these problems, but the separate loss functions for the two components can lead to inferior performance. We investigate a novel synthetic-example oversampling technique to harmonize the two components of a hybrid system, thus improving the anomaly detector’s performance. We evaluate our algorithm on two distinct problems: identifying pipeline leaks and patient-ventilator asynchrony.