The smallest valid extension-based efficient, rare graph pattern mining, considering length-decreasing support constraints and symmetry characteristics of graphs

DOI10.3390/SYM8050032zbMATH Open1373.05192OpenAlexW2345980508MaRDI QIDQ2412349FDOQ2412349

Unil Yun, C. H. Kim, Gangin Lee

Publication date: 23 October 2017

Published in: Symmetry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/sym8050032

zbMATH Keywords

data mininggraph symmetrygraph mininglength-decreasing supportrare item problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Pattern recognition, speech recognition (68T10) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: The smallest valid extension-based efficient, rare graph pattern mining, considering length-decreasing support constraints and symmetry characteristics of graphs

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