Counting frequent patterns in large labeled graphs: a hypergraph-based approach
DOI10.1007/S10618-020-00686-9zbMATH Open1477.68092OpenAlexW3022749277MaRDI QIDQ2194034FDOQ2194034
Authors: Jinghan Meng, Napath Pitaksirianan, Yi-Cheng Tu 
Publication date: 25 August 2020
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10618-020-00686-9
Recommendations
- An efficiently computable subgraph pattern support measure: counting independent observations
- Frequent Hypergraph Mining
- Support measures for graph data
- The smallest valid extension-based efficient, rare graph pattern mining, considering length-decreasing support constraints and symmetry characteristics of graphs
- Mining frequent subgraphs in multigraphs
Applications of mathematical programming (90C90) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Hypergraphs (05C65) Database theory (68P15)
Cites Work
- Practical graph isomorphism. II.
- Reducibility among combinatorial problems
- On the Shannon capacity of a graph
- Smoothed analysis of algorithms
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
- Complete mining of frequent patterns from graphs: Mining graph data
- Support measures for graph data
- Title not available (Why is that?)
- On the fractional matching polytope of a hypergraph
- Title not available (Why is that?)
- A distributed approach for graph mining in massive networks
- Title not available (Why is that?)
- An efficiently computable subgraph pattern support measure: counting independent observations
Cited In (5)
- All normalized anti-monotonic overlap graph measures are bounded
- Frequent Hypergraph Mining
- Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model
- The smallest valid extension-based efficient, rare graph pattern mining, considering length-decreasing support constraints and symmetry characteristics of graphs
- An efficiently computable subgraph pattern support measure: counting independent observations
Uses Software
This page was built for publication: Counting frequent patterns in large labeled graphs: a hypergraph-based approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194034)
