{"title":"Mining Closed and Maximal Frequent Induced Free Subtrees","authors":"Hitohiro Shiozaki, Tomonobu Ozaki, T. Ohkawa","doi":"10.1109/ICDMW.2006.111","DOIUrl":null,"url":null,"abstract":"Mining frequent tree patterns is an important problem, since tree structures are used in various fields such as computational biology, XML databases, and so on. However, mining all frequent subtrees is sometimes infeasible because of the combinatorial explosion. In this paper, by combining an efficient algorithm for enumerating free trees and the pruning techniques for mining closed and maximal rooted trees, we present an efficient algorithm named CMFree-TreeMiner that discovers only closed and maximal frequent induced free subtrees in a database of labeled free trees. Experimental results show the effectiveness of the proposed algorithm","PeriodicalId":291862,"journal":{"name":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDMW.2006.111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Mining frequent tree patterns is an important problem, since tree structures are used in various fields such as computational biology, XML databases, and so on. However, mining all frequent subtrees is sometimes infeasible because of the combinatorial explosion. In this paper, by combining an efficient algorithm for enumerating free trees and the pruning techniques for mining closed and maximal rooted trees, we present an efficient algorithm named CMFree-TreeMiner that discovers only closed and maximal frequent induced free subtrees in a database of labeled free trees. Experimental results show the effectiveness of the proposed algorithm
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
