Please use this identifier to cite or link to this item:
Full metadata record
|dc.contributor.author||Santhi Thilagam, P.||-|
|dc.identifier.citation||Proceedings - 2006 14th International Conference on Advanced Computing and Communications, ADCOM 2006, 2006, Vol., , pp.541-546||en_US|
|dc.description.abstract||Tree structures are used extensively in domains such as XML databases, computational biology, pattern recognition, computer networks, web mining, multi-relational data mining and so on. In this paper, we present an EfficientTreeMiner, a computationally efficient algorithm that discovers all frequently occurring induced subtrees in a database of labeled rooted unordered trees. The proposed algorithm mines frequent subtrees without generating any candidate subtrees. Efficiency is achieved by compressing the large database into a condensed data structure, namely prefix string representation, which reduces space complexity and by adopting a Frequent Immediate Descendents method that avoids the costly generation of candidate sets. Experimental results show that our algorithm has less time complexity when compared to existing approaches and is also scalable for mining both long and short frequent subtrees. � 2006 IEEE.||en_US|
|dc.title||EfficientTreeMiner: Mining frequent induced substructures from XML documents without candidate generation||en_US|
|Appears in Collections:||2. Conference Papers|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.