Nearly exact mining of frequent trees in large networks

DOI10.1007/S10618-013-0321-2MaRDI QIDQ2435702zbMATH OpenOpenAlexFDO

Authors Ashraf M. Kibriya, Jan Ramon

Publication date 19 February 2014

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/404056

zbMATH Keywords

graph mininghomomorphismisomorphismpattern matchingpattern miningsubgraph isomorphism

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• The Complexity of Mining Maximal Frequent Subgraphs
• Efficient frequent connected subgraph mining in graphs of bounded tree-width
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
• Frequent subtree mining -- an overview
• Constraint-Based Mining and Inductive Databases

Cites work

• Algorithms for maximum independent sets
• All normalized anti-monotonic overlap graph measures are bounded
• An Algorithm for Subgraph Isomorphism
• Designing programs that check their work
• Efficient frequent connected subgraph mining in graphs of bounded tree-width
• Faster Algebraic Algorithms for Path and Packing Problems
• scientific article; zbMATH DE number 5296741 (Why is no real title available?)
• scientific article; zbMATH DE number 5776838 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Inductive Logic Programming
• Limits and Applications of Group Algebras for Parameterized Problems
• Transforming graph data for statistical relational learning
• Vertex cover: Further observations and further improvements

Cited in

(9)

• Finding supported paths in heterogeneous networks
• A distributed approach for graph mining in massive networks
• Mining blackhole and volcano patterns in directed graphs: a general approach
• Probabilistic and exact frequent subtree mining in graphs beyond forests
• An efficiently computable subgraph pattern support measure: counting independent observations
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
• scientific article; zbMATH DE number 7306903 (Why is no real title available?)
• Algorithms for regular tree grammar network search and their application to mining human-viral infection patterns
• CAGE: cache-aware graphlet enumeration

Describes a project that uses

Uses Software

• gSpan
• MoSS
• CloseGraph

This page was built for publication: Nearly exact mining of frequent trees in large networks

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