Meixia Wang

Meixia Wang

Auto-generated profile, based on publicly available information

Meixia Wang

Northeastern University, Shenyang, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
7 June 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
MWMeixia Wang
Meixia Wang
YZYuhai Zhao
Yuhai Zhao
YWYejiang Wang
Yejiang Wang
TXTongze Xu
Tongze Xu
YSYiming Sun
Yiming Sun

15 March 2025 in Knowledge-Based Systems
Verified
Journal Article
Closed access
MWMeixia Wang
Meixia Wang
YZYuhai Zhao
Yuhai Zhao
YWYejiang Wang
Yejiang Wang
MHMiaomiao Huang
Miaomiao Huang
XLXuze Liu
Xuze Liu
XWXingwei Wang
Xingwei Wang

14 May 2025 in Expert Systems with Applications
Verified
Journal Article
Closed access
MHMiaomiao Huang
Miaomiao Huang
YZYuhai Zhao
Yuhai Zhao
YWYejiang Wang
Yejiang Wang
MWMeixia Wang
Meixia Wang
XWXingwei Wang
Xingwei Wang

12 April 2026
Verified
Conference Paper
Open access
YWYejiang Wang
Yejiang Wang
YZYuhai Zhao
Yuhai Zhao
FLFangting Li
Fangting Li
JWJiapu Wang
Jiapu Wang
MWMeixia Wang
Meixia Wang
SPShirui Pan
Shirui Pan
Every graph hides a tree: through tree decomposition—a foundational tool in modern graph theory with broad applications such as in computational power networks, any network can be unfolded into a hierarchy of overlapping vertex bags whose backbone is a tree. Leveraging this powerful lens, we propose Topological Decomposition for Self-supervised Learning (TopDSL), a framework that injects multi-scale signals into graph representation learning. Concretely, we: 1) decompose the input graph into tree structures with bags representing local structural contexts; 2) compute bag-level roles via closeness centrality for nodes and local edge betweenness for edges, and aggregate these scores across bags to capture context-dependent importance (e.g., local structural bridges); 3) convert the resulting importance and attribute-stability scores into a context-aware augmentation policy that adaptively perturbs nodes, edges, and features—preserving local bridges, honoring multi-community vertices, and attenuating noisy global hubs; 4) construct a new structural similarity loss for contrastive learning, which fuses traditional graph-based proximity with a novel tree-based similarity derived from node co-occurrence in decomposition bags; 5) demonstrate that our framework achieves superior performance over state-of-the-art baselines on various graph learning benchmarks.

28 August 2023
Verified
Conference Paper
Closed access
KWKesong Wang
Kesong Wang
XXXiaoming Xi
Xiaoming Xi
MWMeixia Wang
Meixia Wang
CYChuanqi Yuan
Chuanqi Yuan
LXLongsheng Xu
Longsheng Xu
XLXinfeng Liu
Xinfeng Liu
Prediction of the axillary lymph node (ALN) metastasis is an essential factor to guide breast cancer therapy. MRI is the useful imaging tool for prediction of ALN metastasis. The fusion of multiple modalities of MRI images can improve the prediction accuracy of ALN metastasis in breast cancer. However, existing fusion methods often neglect the specific information across different modalities and do not fully exploit the specificity of medical data with respect to patients’ physiological conditions, result in the limitation of performance improvement. To address these issues, we propose a multi-level granularity adversarial contrast learning network (MACMH-net) for ALN metastasis prediction. First, a multi-modal adversarial contrastive learning module is developed with incorporation of adversarial contrast loss and orthogonal contrast loss. It has the ability to learn the shared information and modality-specific information, and combine more relevant information and complementary information in the fusion features. Second, a multi-level granularity contrast learning module is developed with incorporation of the multi-level granularity supervised contrast loss to make full use of specific physiological information of each patient, further improve the discriminative ability of features. Experimental results demonstrate the effectiveness of the proposed method.

12 April 2026
Verified
Conference Paper
Open access
MWMeixia Wang
Meixia Wang
YZYuhai Zhao
Yuhai Zhao
ZWZhengkui Wang
Zhengkui Wang
FMFenglong Ma
Fenglong Ma
YWYejiang Wang
Yejiang Wang
XWXingwei Wang
Xingwei Wang
Multi-Graph Learning (MGL) is a fundamental machine learning paradigm that represents objects as bags-of-graphs, each encoding a distinct structural property, and has broad applications in bioinformatics, chemistry, computing power networks, and software defect detection. However, the inherent scarcity of labeled data poses a significant bottleneck for supervised MGL approaches. While self-supervised contrastive learning offers a compelling solution, its direct application to MGL faces three key challenges: (1) existing graph neural networks, primarily for single-graph modeling, struggle to yield discriminative bag-level representations from bags-of-graphs; (2) conventional contrastive objectives are limited to single-level settings, failing to capture cross-hierarchical dependencies; and (3) standard data augmentation often disrupts intrinsic graph and bag structures, undermining semantic consistency. To address these issues, we propose the Hierarchical Graph-Bag-Network (HGBN), a self-supervised MGL framework that constructs hierarchical representations in the form of a graph-bag-network. HGBN employs an asymmetric hierarchical graph neural network to learn discriminative graph-level and bag-level representations, introduces cross-hierarchical contrastive objectives to align graph-level and bag-level semantics, and leverages the asymmetric network outputs to form positive and negative pairs, preserving intrinsic structural and semantic consistency. Experiments on eight benchmark multi-graph datasets demonstrate that HGBN consistently outperforms both supervised and self-supervised state-of-the-art baselines, achieving average improvements of 4.82% in accuracy and F1 score.