Efficiently mining -tolerance closed frequent subgraphs

DOI10.1007/S10994-010-5215-6zbMATH Open1237.68168DBLPjournals/ml/TakigawaM11OpenAlexW2161646342WikidataQ62669631 ScholiaQ62669631MaRDI QIDQ413834FDOQ413834

Authors: Ichigaku Takigawa, Hiroshi Mamitsuka 

Publication date: 8 May 2012

Published in: Machine Learning (Search for Journal in Brave)

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

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

zbMATH Keywords

frequent subgraph mining\(\delta \)-tolerance closednesspartial reverse search

Mathematics Subject Classification ID

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

Cites Work

• Depth-First Search and Linear Graph Algorithms
• Reverse search for enumeration
• Title not available (Why is that?)
• Full Perfect Extension Pruning for Frequent Subgraph Mining

Cited In (3)

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

Uses Software

• gSpan
• ParMol
• Fg-index
• CloseGraph

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)