Cart (Loading....) | Create Account
Close category search window

Hierarchical Pattern Discovery in Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Maulik, U. ; Dept. of Comput. Sci. & Eng., Jadavpur Univ., Kotkata

In this correspondence, an efficient technique for detecting repeating patterns in a graph is described. For this purpose, the searching capability of evolutionary programming is utilized for discovering patterns that are often repeating in such structural data. The approach adopted in this correspondence is hierarchical in nature. Once a pattern is discovered in a particular level of the hierarchy, the graph is compressed using it, and the substructure discovery algorithm is repeated with the compressed graph. The proposed technique is useful for mining knowledge from databases that can be conveniently represented as graphs. The importance of such an endeavor can hardly be overemphasized, given that substantial portion of data that are generated and collected is either structural in nature or is composed of parts and relations between the parts, which can be naturally represented as graphs. A typical example can be the structure of protein as well as computer-aided design circuits that have a natural graphical representation.

Published in:

Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on  (Volume:38 ,  Issue: 6 )

Date of Publication:

Nov. 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.