![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Petre Tzvetkov Petre Tzvetkov, Xifeng Yan , Jiawei Han : TSP: Mining Top-K Closed Sequential Patterns. ICDM 2003 : 347-354 Jiawei Han , Jianyong Wang , Ying Lu , Petre Tzvetkov: Mining Top-K Frequent Closed Patterns without Minimum Support. ICDM 2002 : 211-218 1 [ 1 ] [ 2 ] 2 [ 1 ] 3 [ 1 ] 4 [ 2 ] ![]() ©2004 Association for Computing Machinery |