On the Usefulness of Weight-Based Constraints in Frequent Subgraph Mining

DOI10.1007/978-0-85729-130-1_5zbMath1209.68365OpenAlexW1620215597MaRDI QIDQ3076940

Klemens Böhm, Matthias Huber, Frank Eichinger

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

zbMATH Keywords

weighted graphsmining algorithmsfrequent subgraph miningexplorative mining in transportation logistics

Mathematics Subject Classification ID

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

Related Items

Generating realistic labelled, weighted random graphs