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

DOI10.3390/SYM8050032MaRDI QIDQ2412349zbMATH OpenOpenAlexFDO

Authors Unil Yun, Gangin Lee, C. H. Kim

Publication date 23 October 2017

Published in Symmetry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
• An efficient approach for mining frequent subgraphs
• Mining graph patterns
• Counting frequent patterns in large labeled graphs: a hypergraph-based approach
• scientific article; zbMATH DE number 1930117

Cited in

(1)

• Counting frequent patterns in large labeled graphs: a hypergraph-based approach

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)