Supervised graph embedding for classification using discriminating frequent patterns

doi:10.1007/s41060-025-00717-y

Supervised graph embedding for classification using discriminating frequent patterns

2025-01-20

0

PRE

AI

M

Md. Tanvir Alam

C

Chowdhury Farhan Ahmed *

DOI：10.1007/s41060-025-00717-y

Original

Original request for help

Save

Abstract

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.

Keywords:

Pattern mining

Graph mining

Frequent pattern mining

Discriminating pattern mining

Graph Classification

Supervised graph embedding for classification using discriminating frequent patterns

Abstract

Journal

Organization