![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Shakil Ahmed Frans Coenen , Paul Leng , Shakil Ahmed: Data Structure for Association Rule Mining: T-Trees and P-Trees. IEEE Trans. Knowl. Data Eng. 16 (6): 774-778 (2004) Frans Coenen , Paul H. Leng , Shakil Ahmed: T-Trees, Vertical Partitioning and Distributed Association Rule Mining. ICDM 2003 : 513-516 1 [ 1 ] [ 2 ] 2 [ 2 ] 3 [ 1 ] ![]() ©2004 Association for Computing Machinery |