Wenjie Xu

Mr. Wenjie Xu


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 March 2024 in Algorithms
Verified
Journal Article
Open access
PDF file
MRMohammadHossein REshadi
MohammadHossein REshadi
WLWen Li
Wen Li
WXWenjie Xu
Wenjie Xu
POPrecious Omashor
Precious Omashor
ADAlbert Dinh
Albert Dinh
MLMichael Lipsett
Michael Lipsett
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.

31 May 2022
Verified
Book Chapter
Closed access
PDF file
YZYujia Zhang
Yujia Zhang
MPMarcin Pietrasik
Marcin Pietrasik
WXWenjie Xu
Wenjie Xu
Marek Z. ReformatMarek Z. Reformat
Marek Z. Reformat

15 April 2025 in Axioms
Verified
Journal Article
Open access
PDF file
YZYujia Zhang
Yujia Zhang
WXWenjie Xu
Wenjie Xu
ZYZheng Yu
Zheng Yu
Marek Z. ReformatMarek Z. Reformat
Marek Z. Reformat
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.

5 September 2024 in Algorithms
Verified
Journal Article
Open access
PDF file
MRMohammadHossein REshadi
MohammadHossein REshadi
WLWen Li
Wen Li
WXWenjie Xu
Wenjie Xu
POPrecious Omashor
Precious Omashor
ADAlbert Dinh
Albert Dinh
MLMichael Lipsett
Michael Lipsett
The authors wish to make the following correction to their paper