By Topic

An Efficient Algorithm to Mine Unordered Trees

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

5 Author(s)
Yun Li ; Inst. of Inf. Eng., Yangzhou Univ., Yangzhou, China ; Xin Guo ; Yunhao Yuan ; Jia Wu
more authors

Mining unordered trees are very useful in domains like XML date, biological information, Web structure, etc. In this paper, we introduce an efficient algorithm UTMiner (unordered trees miner). As the trees are unordered, in order to avoid mining the same subtrees, an efficient unordered trees standardization is first introduced to transform the unordered trees into the standard subtrees. Then UTMiner is used to get all standardized subtrees. UTMiner builds a multilayered data structure based on subtree vector and the hash table so it reduces isomorphism time in the mining process. It requires only one database scanning so it reduces the scanning times and improves the efficiency, particularly in a large databasepsilas mining process. Many experiments have shown that the UTMiner is feasible and more efficient than other.

Published in:

Computer and Information Science, 2009. ICIS 2009. Eighth IEEE/ACIS International Conference on

Date of Conference:

1-3 June 2009