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

DOI10.1007/S10618-020-00686-9MaRDI QIDQ2194034zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

data mininghypergraphgraph miningsupport measure

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Hypergraphs (05C65) Database theory (68P15)

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

Cites work

• scientific article; zbMATH DE number 1977808 (Why is no real title available?)
• scientific article; zbMATH DE number 2086690 (Why is no real title available?)
• scientific article; zbMATH DE number 6297805 (Why is no real title available?)
• A distributed approach for graph mining in massive networks
• An efficiently computable subgraph pattern support measure: counting independent observations
• Complete mining of frequent patterns from graphs: Mining graph data
• On the Shannon capacity of a graph
• 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
• On the fractional matching polytope of a hypergraph
• Practical graph isomorphism. II.
• Reducibility among combinatorial problems
• Smoothed analysis of algorithms
• Support measures for graph data

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

Describes a project that uses

Uses Software

• CloseGraph
• GitHub
• gSpan
• Traces
• CPLEX
• nauty

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)