By Topic

OInduced: An Efficient Algorithm for Mining Induced Patterns From Rooted Ordered 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
$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

4 Author(s)
Mostafa Haghir Chehreghani ; School of Electrical and Computer Engineering, College of Engineering, University of Tehran, Tehran, Iran ; Morteza Haghir Chehreghani ; Caro Lucas ; Masoud Rahgozar

Frequent tree patterns have many practical applications in different domains, such as Extensible Markup Language mining, Web usage analysis, etc. In this paper, we present OInduced , which is a novel and efficient algorithm for finding frequent ordered induced tree patterns. OInduced uses a breadth-first candidate generation method and improves it by means of an indexing scheme. We also introduce frequency counting using tree encoding. For this purpose, we present two novel tree encodings, namely, m-coding and cm-coding, and show how they can restrict nodes of input trees and compute frequencies of generated candidates. We perform extensive experiments on both real and synthetic data sets to show the efficiency and scalability of OInduced.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans  (Volume:41 ,  Issue: 5 )