A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the Usefulness of Weight-Based Constraints in Frequent Subgraph Mining
[chapter]
2010
Research and Development in Intelligent Systems XXVII
Frequent subgraph mining is an important data-mining technique. In this paper we look at weighted graphs, which are ubiquitous in the real world. The analysis of weights in combination with mining for substructures might yield more precise results. In particular, we study frequent subgraph mining in the presence of weight-based constraints and explain how to integrate them into mining algorithms. While such constraints only yield approximate mining results in most cases, we demonstrate that
doi:10.1007/978-0-85729-130-1_5
dblp:conf/sgai/EichingerHB10
fatcat:etdvl2r3hnfzblll3hoabjsuzi