Algorithms for optimal dyadic decision trees
- 作者Don Hush; Reid Porter
- 卷第80卷
- 期第1期
- 印刷ISSN0885-6125
- 电子ISSN1573-0565
- 文件大小584.98KB
- 发表时间2010-07
- DOI10.1007/s10994-010-5167-x
- 页码85-107
同标题推荐
Mining closed and maximal frequent subtrees from databases of labeled rooted treesYun Chi; Yi Xia; Yirong Yang; R. Muntz · 2005
Correction to "Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees"Yun Chi; Yi Xia; Yirong Yang; R. Muntz · 2005
[ACM Press the 14th ACM SIGKDD international conference - Las Vegas, Nevada, USA (2008.08.24-2008.08.27)] Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD 08 - Mining adaptively frequent closed unlabeled rooted trees in data streamsBifet, Albert; Gavaldà, Ricard · 2008