![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Quamrul I. Khan Carson Kai-Sang Leung , Quamrul I. Khan, Tariqul Hoque : CanTree: A Tree Structure for Efficient Incremental Mining of Frequent Patterns. ICDM 2005 : 274-281 1 [ 1 ] 2 [ 1 ] ![]() ©2006 Association for Computing Machinery |