![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Petre Tzvetkov Jianyong Wang , Jiawei Han , Ying Lu , Petre Tzvetkov: TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets. IEEE Trans. Knowl. Data Eng. 17 (5): 652-664 (2005) Petre Tzvetkov, Xifeng Yan , Jiawei Han : TSP: Mining top- k closed sequential patterns. Knowl. Inf. Syst. 7 (4): 438-457 (2005) 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 ] [ 3 ] [ 4 ] 2 [ 1 ] [ 4 ] 3 [ 1 ] [ 4 ] 4 [ 2 ] [ 3 ] ![]() ©2006 Association for Computing Machinery |