By Topic

An Efficient Graph-Based Multi-Relational Data Mining Algorithm

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

3 Author(s)

Multi-relational data mining can be categorized into graph-based and logic-based approaches. In this paper, we propose some optimizations for mining graph databases with Subdue, which is one of the earliest and most effective graph-based relational learning algorithms. The optimizations improve the subgraph isomorphism computation and reduce the numbers of subgraph isomorphism testing, which are the major source of complexity in Subdue. Experimental results indicate that the improved algorithm is much more efficient than the original one.

Published in:

Computational Intelligence and Security, 2007 International Conference on

Date of Conference:

15-19 Dec. 2007