born in 1995. PhD candidate. Student member of CCF. His main research interests include big data computing, data mining, and complex network analysis
born in 1987. PhD, associate professor. Senior member of CCF. Her main research interests include big data computing, data mining, and data security & privacy computing
born in 1999. Master. His main research interest includes rule mining
born in 1990. PhD candidate. Her main research interests include big data computing, data mining, and rule learning and its applications in big data
born in 1970. PhD, professor, PhD supervisor. Member of CCF. His main research interests include big data mining, complex network analysis, and computational social science
Knowledge graph reasoning has attracted extensive attention because of its ability to alleviate the inherent incompleteness of knowledge graphs. However, existing approaches mainly rely on embedding models or chain-based rules, but they still suffer from limitations in interpretability and expressiveness. Existing rule learning methods are often limited to linear dependency modeling and struggle to capture multi-path interactions and hierarchical semantic relations, while traditional rule-mining methods usually follow the “enumeration–verification” paradigm, resulting in high computational costs and insufficient modeling of deep semantic correlations among rules. To address these challenges, we propose CGRL (contrastive graph rule learning), a novel method for learning graph-structured rules through contrastive learning. CGRL enhances rule learning through a threefold mechanism. First, it applies an adaptive clustering strategy to generate soft type labels for entities, introducing semantic priors that improve rule generalization. Second, it designs a multi-hop neighborhood sampling method to construct semantic subgraphs and to generate high-quality positive and negative rule instances. Third, it employs a Transformer-based encoder and a contrastive learning objective to map rule pairs into a unified embedding space, thereby jointly capturing structural dependencies and semantic consistency. Extensive experiments on six public knowledge graph completion benchmarks demonstrate that CGRL achieves substantial improvements over state-of-the-art baselines. On datasets with relatively complex relational structures, such as FB15k-237 and WN18RR, CGRL yields average gains of 6.04% in MRR and 16.26% in Hits@1, confirming its effectiveness in discovering high-quality graph-structured rules and significantly enhancing reasoning performance.
| 科 Family | 属数 Number of genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) | 属 Genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) |
|---|---|---|---|---|---|---|
| 鹅膏菌科Amanitaceae | 2 | 11 | 5.26 | 鹅膏菌属 Amanita | 10 | 4.78 |
| 小菇科 Mycenaceae | 2 | 12 | 5.74 | 丝盖伞属 Inocybe | 5 | 2.39 |
| 多孔菌科 Polyporaceae | 8 | 14 | 6.70 | 蜡蘑属 Laccaria | 5 | 2.39 |
| 红菇科 Russulaceae | 3 | 23 | 11.00 | 小皮伞属 Marasmius | 6 | 2.87 |
| 小菇属 Mycena | 11 | 5.26 | ||||
| 光柄菇属 Pluteus | 5 | 2.39 | ||||
| 红菇属 Russula | 17 | 8.13 | ||||
| 栓菌属 Trametes | 5 | 2.39 |