On the usefulness of weight-based constraints in frequent subgraph mining

DOI10.1007/978-0-85729-130-1_5zbMATH Open1209.68365OpenAlexW1620215597MaRDI QIDQ3076940FDOQ3076940

Authors: Frank Eichinger, Matthias Huber, Klemens Böhm 

Publication date: 25 February 2011

Published in: Research and Development in Intelligent Systems XXVII (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000017769/1978764

Recommendations

• Mining weighted subgraphs in a single large graph
• An efficient approach for mining frequent subgraphs
• Frequent mining of subgraph structures
• A fast algorithm for mining frequent subgraphs
• Efficient frequent connected subgraph mining in graphs of bounded tree-width

zbMATH Keywords

weighted graphsfrequent subgraph miningexplorative mining in transportation logisticsmining algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Database theory (68P15)

Cited In (3)

• HUSM: high utility subgraph mining in single graph databases
• Generating realistic labelled, weighted random graphs
• Mining weighted subgraphs in a single large graph

This page was built for publication: On the usefulness of weight-based constraints in frequent subgraph mining

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