scientific article; zbMATH DE number 1977808

MaRDI QIDQ4423976zbMATH OpenFDO

Authors Mingsheng Hong, HaoFeng Zhou, Wei Wang, Baile Shi

Publication date 9 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2637/26370040.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 1930117
• An efficient approach for mining frequent subgraphs
• Mining for unconnected frequent graphs with direct subgraph isomorphism tests
• A fast algorithm for mining frequent subgraphs
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs

Cited in

(6)

• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• Efficient frequent connected subgraph mining in graphs of bounded tree-width
• Counting frequent patterns in large labeled graphs: a hypergraph-based approach
• Mining for unconnected frequent graphs with direct subgraph isomorphism tests
• COOMA: a components overlaid mining algorithm for enumerating connected subgraphs with common itemsets
• scientific article; zbMATH DE number 1930117 (Why is no real title available?)

Describes a project that uses

Uses Software

• gSpan

This page was built for publication:

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