.png){kind=icon}
返回
Supervised graph embedding for classification using discriminating frequent patterns
.png){kind=icon}
PRE
AI
DOI：10.1007/s41060-025-00717-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Graph has the ability to encode various types of data entities and complex relationships among them. Graph classification is an emerging and important problem that has immense impacts on various real-life applications. Graph embedding is one of the popular techniques introduced for graph classification. In this article, we propose an algorithm for graph classification by learning vector representation of the graphs using discriminating frequent patterns mined from the graphs. Our proposed supervised graph embedding method utilizes the knowledge from the labeled examples available to produce high-quality discriminating entire graph embedding for graph classification. We present extensive analyses of experiments, conducted on various real-life benchmark datasets. Comparative analyses show that the proposed approach is significantly better in terms of classification accuracy in comparison to the state-of-the-art methods.
Keyword:
Pattern mining
Graph mining
Frequent pattern mining
Discriminating pattern mining
Graph Classification
期刊
I
IF:
2.8
论文数:
1.1K
被引数:
1.3K
机构
引用论文
分享收藏分享收藏Environmental Factors and Seasonality Affect the Concentration of Rotundone in Vitis vinifera L. cv. Shiraz Wine.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏分享收藏
分享收藏Cylindrically polarized vortex beams generated by subwavelength concentric Al metallic gratings
PREAI
分享收藏
查看更多内容