ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns

DOI10.1002/sam.10004OpenAlexW4250255282MaRDI QIDQ4969622

Saeed Salem, Jérémy Besson, Vineet Chaoji, Mohammed Javeed Zaki, Mohammad Al Hasan

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.10004

zbMATH Keywords

graph miningmaximal pattern miningrandomized algorthims

Mathematics Subject Classification ID

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

Related Items (3)

Effective feature construction by maximum common subgraph sampling ⋮ Sampling frequent and minimal Boolean patterns: theory and application in classification ⋮ A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics

Uses Software

• DMTL
• gSpan
• CloseGraph

Cites Work

• Unnamed Item
• Unnamed Item
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Complete mining of frequent patterns from graphs: Mining graph data
• A graph distance metric based on the maximal common subgraph
• Constraint-Based Mining and Inductive Databases

This page was built for publication: ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns