Abstract

AbstractFrequent approximate subgraph (FAS) mining has become an interesting task with wide applications in several domains of science. Most of the previous studies have been focused on reducing the search space or the number of canonical form (CF) tests. CF-tests are commonly used for duplicate detection; however, these tests affect the efficiency of mining process because they have high computational complexity. In this paper, two prunes are proposed, which allow decreasing the label space, the number of candidates and the number of CF-tests. The proposed prunes are already used and validated in two reported FAS miners by speeding up their mining processes in artificial graph collections.KeywordsApproximate graph miningapproximate graph matchingfrequent approximate subgraphslabeled graphs

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.