Frequent mining of subgraph structures

DOI10.1080/09528130600975691MaRDI QIDQ3429325zbMATH OpenOpenAlexFDO

Authors Ping Guo, Xinru Wang, Yan-Rong Kang

Publication date 30 March 2007

Published in Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09528130600975691

zbMATH Keywords

data miningfrequent structurefrequent structure mining algorithmfrequent subgraphgraph structured mining

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
• A fast algorithm for mining frequent subgraphs
• An efficient approach for mining frequent subgraphs
• Complete mining of frequent patterns from graphs: Mining graph data
• Mining graph patterns

Cites work

• Complete mining of frequent patterns from graphs: Mining graph data
• Foreword to special issue on SODA 2002
• Inductive Logic Programming: Theory and methods

Cited in

(18)

• Complete mining of frequent patterns from graphs: Mining graph data
• Performance evaluation of frequent subgraph discovery techniques
• Mining frequent subgraphs in multigraphs
• SIAS-miner: mining subjectively interesting attributed subgraphs
• Mining explainable local and global subgraph patterns with surprising densities
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
• Mining graph patterns
• On the usefulness of weight-based constraints in frequent subgraph mining
• Algorithm for mining approximate frequent subgraphs in a single graph
• Meta itemset: a new concise representation of frequent itemset
• Efficient graph structure for the mining of frequent itemsets from data streams
• Efficiently mining \(\delta \)-tolerance closed frequent subgraphs
• scientific article; zbMATH DE number 1966525 (Why is no real title available?)
• scientific article; zbMATH DE number 1977861 (Why is no real title available?)
• scientific article; zbMATH DE number 1930117 (Why is no real title available?)
• An efficient approach for mining frequent subgraphs
• A fast algorithm for mining frequent subgraphs
• Frequent Hypergraph Mining

This page was built for publication: Frequent mining of subgraph structures

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