Effective graph classification based on topological and label attributes

DOI10.1002/SAM.11153OpenAlexW2101940264MaRDI QIDQ4969844FDOQ4969844

Bülent Yener, Geng Li, Murat Semerci, Mohammed J. Zaki

Publication date: 14 October 2020

Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sam.11153

zbMATH Keywords

graph kernelsgraph mininggraph classificationtopological attributes

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites Work

• Templates for the Solution of Algebraic Eigenvalue Problems
• Gene selection for cancer classification using support vector machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph kernels
• Graph kernels based on tree patterns for molecules
• On graph kernels: hardness results and efficient alternatives.
• STACS 2005
• Discriminative frequent subgraph mining with optimality guarantees

Cited In (4)

• Same stats, different graphs (graph statistics and why we need graph drawings)
• Depth-based hypergraph complexity traces from directed line graphs
• Fast depth-based subgraph kernels for unattributed graphs
• A quantum Jensen-Shannon graph kernel for unattributed graphs

Uses Software

• NetworkX
• JDQR
• LIBSVM
• SciPy
• AFGen
• JDQZ
• gSpan

This page was built for publication: Effective graph classification based on topological and label attributes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969844)