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
.
Mining Graphs with Constraints on Symmetry and Diameter
[chapter]
2010
Lecture Notes in Computer Science
The area of graph mining bears great importance when dealing with semi-structured data such as XML, text and chemical and genetic data. One of the main challenges of this field is that out of many resulting frequent subgraphs it is hard to find interesting ones. We propose a novel algorithm that finds subgraphs of limited diameter and high symmetry. These subgraphs represent the more structurally interesting patterns in the database. Our approach also allows to decrease processing time
doi:10.1007/978-3-642-16720-1_1
fatcat:sqa33jmf5rha7hlfiqogqddsym