![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Jenq-Foung Yao Yongqiao Xiao , Jenq-Foung Yao, Zhigang Li , Margaret H. Dunham : Efficient Data Mining for Maximal Frequent Subtrees. ICDM 2003 : 379-386 1 [ 1 ] 2 [ 1 ] 3 [ 1 ] ![]() ©2004 Association for Computing Machinery |