.png){kind=icon}
.png){kind=icon}
Return
MRAG: multi-relation attributed graph contrastive learning for few-shot machining feature recognition
.png){kind=icon}
PRE
AI
Z
M
R
Y
DOI：10.1007/s10845-026-02918-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To address the issues where existing machining feature recognition methods overlook engineering geometric constraints and rely heavily on large-scale labeled data, this paper proposes a geometry-knowledge enhanced multi-relation graph contrastive learning framework tailored for data-scarce scenarios. First, we construct a Multi-Relation Attributed Graph (MRAG). Beyond traditional topological adjacency, this graph explicitly introduces three geometric relations: normal parallelism with area similarity, axis-plane parallelism, and orthogonality, to encode engineering constraints in a heterogeneous graph structure. Second, we design a Semantic Fusion Heterogeneous Graph Neural Network (SF-HGNN), which integrates local topological information with global geometric semantics through relation-differentiated message passing. Finally, the model undergoes pre-training on open-source unlabeled datasets to learn robust geometric representations from unlabeled data, followed by training on labeled datasets. Experimental results demonstrate that the proposed method outperforms existing models in machining feature recognition tasks on small-sample datasets, exhibiting significant robustness under few-shot conditions and reducing dependence on data annotation.
Keywords:
Machining feature recognition
Multi-relation attributed graph
Graph neural network
Few-shot conditions
Journal
IF:
7.4
Papers:
3.4K
Citations:
1.1W
Organization
Cited Papers