Dismiss
The Prior Art Database and Publishing service will be updated on Sunday, February 25th, from 1-3pm ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

A Method for Efficiently Deriving Connected Frequent Subgraphs from Graph Structured Data

IP.com Disclosure Number: IPCOM000010395D
Original Publication Date: 2002-Nov-26
Included in the Prior Art Database: 2002-Nov-26
Document File: 1 page(s) / 6K

Publishing Venue

IBM

Abstract

Graph structured data mining to derive frequent subgraphs from a graph dataset is difficult because the search for subgraphs is combinatorially explosive, and includes subgraph isomorphism matching.The past research on this issue has not show the sufficient performance for practical use. In this paper, we propose a new approach called AcGM which achieves the complete search of frequent connected (induced) subgraphs in a massive labeled graph dataset within highly practical time.The power of AcGM comes from the algebraic representation of graphs, its associated operations and well-organized constraints to limit the search space efficiently. Its performance has been evaluated through some artificial simulation data and real world data. The high scalability of AcGM has been confirmed for the amount of data, the complexity of graphs and the computation time.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 1

  A Method for Efficiently Deriving Connected Frequent Subgraphs from Graph Structured Data

Disclosed by International Business Machines Corporation

1