一种基于混合搜索的高效Top-K最频繁模式挖掘算法.pdf

31 2 JOURNAL OF NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY Vol.31 No.2 2009 :1001- 2486(2009) 02- 0090- 04 X Top-K 1 2 1 1 敖富江 , 杜 静 , 陈 彬 , 黄柯棣 ( 1. , 410073; 2. , 410073) : Top-K Top-K k , Top-K k, , Top-K MTKFP, k ; Top-K ,MTKFP 70%, ;MTKFP :Top-K ; ; ;FP-Tree :TP391 :A An Efficient Mixed-searching-based Algorithm for Mining Top-K Most-frequent Patterns 1 2 2 1 AO Fu-Jiang ,DU Jing , CHEN Bin ,HUANG Ke-Di ( 1. Collegeof Mechatronics Engineering and Automation, National Univ. of DefenseTechnology, Changsh a410073, China; 2. College of Computer, National Univ. of DefenseTechnology, Changsh a410073, China) Abstract: It is significant to mine Top-K mos-t frequent patterns in dataset. The existing algorithms usually use the k-most frequent items as the initial items, and use the support of item with lowest frequency in initial items as the initial border support. In fact, since the number of items in Top-K mos-t frequent patterns is much less than k, the efficiency of the existing algorithms is restricted. To solve this problem, an efficient mixed-searching-based algorithm for mining Top-K mos-t frequent patterns, MTKFP is presented. The algorithm firstly mines some short item sets by breadth-first searching, and uses short item sets to obtainthe scope of the initial items ( the number of initial items is less than k) and the higher initial border support; then it obtains all Top-K mos-t frequent patterns by depth-first searching. The