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

DOI10.1002/SAM.10004MaRDI QIDQ4969622zbMATH OpenOpenAlexFDO

Authors Vineet Chaoji, Saeed Salem, Jérémy Besson, Mohammad Al Hasan, 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.10004

zbMATH Keywords

graph miningmaximal pattern miningrandomized algorthims

Mathematics Subject Classification ID

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

Cites work

• A graph distance metric based on the maximal common subgraph
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Complete mining of frequent patterns from graphs: Mining graph data
• Constraint-Based Mining and Inductive Databases
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)

Cited in

(3)

• 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
• Effective feature construction by maximum common subgraph sampling

Describes a project that uses

Uses Software

• gSpan
• DMTL
• CloseGraph

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

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