The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON COMPUTERS
Transactions ID Number: 32-260
Full Name: Tarek Gharib
Position: Please, select:
Age: ON
Sex: Male
Address: Faculty of Computer and Information Sciences, Ain Shams University, Cairo
Country: EGYPT
Tel: 002-010-6066683
Tel prefix:
Fax:
E-mail address: tgharib@eun.eg
Other E-mails: mtarek62@yahoo.com
Title of the Paper: Mining Maximal and Closed Embedded for Unordered Trees
Authors as they appear in the Paper:
Email addresses of all the authors:
Number of paper pages: 10
Abstract: Currently, tree mining techniques have a wide area of applications because of the usage of tree structure in many data representation formats like DNA, XML databases, computer networks simulation, and pattern recognition and so on. In this paper we are present an efficient approach to discover all the closed and maximal frequent embedded and unordered sub-trees because current tree mining algorithms are only interested in generating the frequent unordered sub-trees. Our experiments with both synthetic and real datasets against the known algorithms for mining closed embedded and unordered trees, demonstrate the effectiveness and the efficiency of the technique.
Keywords: Frequent subtrees, closed and maximal subtrees, unordered and ordered subtrees, embedded subtrees.
EXTENSION of the file: .doc
Special (Invited) Session:
Organizer of the Session:
How Did you learn about congress:
IP ADDRESS: 41.235.121.1
