Efficiently mining -tolerance closed frequent subgraphs

DOI10.1007/S10994-010-5215-6MaRDI QIDQ413834zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ichigaku Takigawa, Hiroshi Mamitsuka

Publication date 8 May 2012

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s10994-010-5215-6

zbMATH Keywords

\(\delta \)-tolerance closednessfrequent subgraph miningpartial reverse search

Mathematics Subject Classification ID

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
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
• Frequent mining of subgraph structures
• Efficient frequent connected subgraph mining in graphs of bounded tree-width
• A fast algorithm for mining frequent subgraphs

Cites work

• Depth-First Search and Linear Graph Algorithms
• Full Perfect Extension Pruning for Frequent Subgraph Mining
• scientific article; zbMATH DE number 1934539 (Why is no real title available?)
• Reverse search for enumeration

Cited in

(3)

• Summarization and visualization of multi-level and multi-dimensional itemsets
• FCSG-Miner: frequent closed subgraph mining in multi-graphs
• Mining approximate patterns with frequent locally optimal occurrences

Describes a project that uses

Uses Software

• CloseGraph
• gSpan
• Fg-index
• ParMol

This page was built for publication: Efficiently mining \(\delta \)-tolerance closed frequent subgraphs

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