By Topic

A Fast Biological Data Mining Algorithm Based on Embedded Frequent Subtree

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
$33 $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)
Zhong-xue Yang ; Dept. of Inf. Technol., Nanjing Xiaozhuang Coll., Nanjing, China

In this paper, we present a fast biological data mining algorithm named IRTM based on embedded frequent subtree. We also advance a string encoding method for representing the trees, a scope-list for extending all substrings and some pruning rules which can further reduce the computational time and space cost. Experimental results show that IRTM algorithm can achieve significantly performance improvement over previous works.

Published in:

2010 International Conference on Multimedia Information Networking and Security

Date of Conference:

4-6 Nov. 2010