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

Qianwen Meng

dblp:283/3506 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
5since 2021 · last 2024
0009-0008-8284-3242ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
contrastive learning
0.712023
MHCCL: Masked Hierarchical Cluster-Wise Contrastive Learning for Multivariate Time Series · AAAI 2023
Machine learning › Representation and self-supervised learning › representation learning › sequence representation learning
time series representation learning
0.712023
MHCCL: Masked Hierarchical Cluster-Wise Contrastive Learning for Multivariate Time Series · AAAI 2023
Data mining
clustering
0.712023
MHCCL: Masked Hierarchical Cluster-Wise Contrastive Learning for Multivariate Time Series · AAAI 2023
Data mining › clustering
hierarchical clustering
0.712023
MHCCL: Masked Hierarchical Cluster-Wise Contrastive Learning for Multivariate Time Series · AAAI 2023
Data mining
anomaly detection
0.212023
MHCCL: Masked Hierarchical Cluster-Wise Contrastive Learning for Multivariate Time Series · AAAI 2023
Data mining › anomaly detection
outlier removal
0.212023
MHCCL: Masked Hierarchical Cluster-Wise Contrastive Learning for Multivariate Time Series · AAAI 2023

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

masking strategy · 1.3hierarchical clustering · 1.3contrastive learning · 1.3
YearPublicationVenuePosition
2024 SP-Aug: Towards Efficient Semantic-Preserving Augmentations in Contrastive Learning via Hierarchical Outlier Factor
Qianwen Meng, Hangwei Qian, Li-Zhen Cui 0001
DASFAA (2)1
2024 Multi-modal Food Recommendation Using Clustering and Self-supervised Learning
Xin Zhou 0008, Qianwen Meng, Fanglin Zhu, Zhiqi Shen 0001, Li-Zhen Cui 0001
PRICAI (1)3
2024 Augmentation blending with clustering-aware outlier factor: An outlier-driven perspective for enhanced contrastive learning
Qianwen Meng, Hangwei Qian, Li-Zhen Cui 0001
Knowl. Based Syst.1
2023 MHCCL: Masked Hierarchical Cluster-Wise Contrastive Learning for Multivariate Time Series
abstract
Learning semantic-rich representations from raw unlabeled time series data is critical for downstream tasks such as classification and forecasting. Contrastive learning has recently shown its promising representation learning capability in the absence of expert annotations. However, existing contrastive approaches generally treat each instance independently, which leads to false negative pairs that share the same semantics. To tackle this problem, we propose MHCCL, a Masked Hierarchical Cluster-wise Contrastive Learning model, which exploits semantic information obtained from the hierarchical structure consisting of multiple latent partitions for multivariate time series. Motivated by the observation that fine-grained clustering preserves higher purity while coarse-grained one reflects higher-level semantics, we propose a novel downward masking strategy to filter out fake negatives and supplement positives by incorporating the multi-granularity information from the clustering hierarchy. In addition, a novel upward masking strategy is designed in MHCCL to remove outliers of clusters at each partition to refine prototypes, which helps speed up the hierarchical clustering process and improves the clustering quality. We conduct experimental evaluations on seven widely-used multivariate time series datasets. The results demonstrate the superiority of MHCCL over the state-of-the-art approaches for unsupervised time series representation learning.
Qianwen Meng, Hangwei Qian, Yong Liu 0020, Li-Zhen Cui 0001, Zhiqi Shen 0001
AAAI1
2023 Advancing Precision Medicine: Treatment Regimen Recommendations via Siamese Neural Networks
abstract
The rapidly increasing adoption of Electronic Health Records (EHRs) has provided us with a comprehensive and reliable data repository, enabling the robust support for clinical decision making and the efficacious management of cardiovascular diseases. Patients may receive various treatment regimens due to the idiosyncratic dissimilarities in physical conditions. Hence, assigning specific category labels to treatment regimens for individual patients poses a challenge owing to the intricate nature of diverse medications and patient profiles. In this paper, we address this challenge by developing a novel model for Treatment Regimen Recommendations based on Siamese Neural Networks (TRRSNN). TRRSNN is harnessed to learn a global similarity metric from EHRs, facilitating the comparison and matching of target patients from unknown categories. The objective is to proffer recommendations of pre-existing treatments of patients that exhibit the highest semblance to those of target patients. Our proposed TRRSNN obviates the necessity for categorically labeling treatment regimens, and instead focuses on discerning the similarity among treatment regimens for pairwise patients. We conduct empirical evaluations on two real-world datasets, and the results demonstrate the superiority of our proposed TRRSNN over the baselines for treatment regimen recommendations.
Qianwen Meng, Fanglin Zhu, Li-Zhen Cui 0001
BIBM1
2020 CLUE: Personalized Hospital Readmission Prediction Against Data Insufficiency under Imbalanced-Data Environment
abstract
Hospital readmission prediction employs reliable predictive models to evaluate the readmission risk of patients upon discharge. Identifying patients with high readmission risk and paying additional attention to them can ease the burden on both patients and society. Recently, considerable attention has been paid to personalized readmission predictions, i.e., building an independent model for each target patient. However, existing personalized predictive models can be easily affected by data insufficiency and provide poor generalization capabilities. To address these challenges, in this paper, we propose the CLusterbased mUlti-task lEarning model (CLUE) to achieve personalized hospital readmission prediction. CLUE groups patients into different clusters based on a multi-angle similarity metric to preserve the interrelated information of patients with highly similar clinical behaviors. Due to different group characteristics of patients, the clusters of patients are imbalanced. Given that, CLUE treats the hospital readmission prediction for each cluster of patients as one task and learns multiple tasks jointly by parameter sharing mechanisms. In this way, not only can the data insufficiency problem be alleviated by supplementing individual models with the shared information from other clusters, but also the specific information of each cluster can be preserved for personalization. We conduct extensive experiments on a real-world dataset of electronic health records, and show that CLUE significantly outperforms competitive comparative methods.
Qianwen Meng, Li-Zhen Cui 0001, Guoxian Yu, Han Yu 0001, Wei Guo 0017, Hui Li 0048
BIBM1