| [1] |
纪允.析取闭合项集的快速生成和恢复算法研究[D].合肥:合肥工业大学,2013.
|
| [2] |
王红梅,党源源,胡明,等.基于排序树的频繁项集挖掘算法[J].吉林大学学报(工学版),2016,46(4):1216.
|
| [3] |
朱玉全,孙志挥,赵传申.快速更新频繁项集[J].计算机研究与发展,2003,40(1):94.
|
| [4] |
BASTIDE Y,TAOUIL R,PASQUIRE N,et al.Mining frequent patterns with counting inference[J].SIGKDD Explorations,2000,2(2):66.
|
| [5] |
许普乐,张勤,纪允.基于FP树的一种快速挖掘生成器算法[J].安庆师范学院学报(自然科学版),2013,19(1):48.
|
| [6] |
PASQUIER N,BASTIDE Y,TAOUIL R,et al.Discovering frequent closed itemsets for association rules[C]//7th Intl.Conf.on Database Theory.Heidelberg:Springer,1999:398.
|
| [7] |
BAYARDO R J.Efficiently mining long patterns from databases[C]//Proc of the ACM SIGMOD Int Conf on Management of Data.New York:ACM Press,1998:85.
|
| [8] |
MANNILA H,TOIVONEN H.Multiple uses of frequent sets and condensed representations:Extended abstract[C]//Proc of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD'96).[S.l.]:[s.n.],1996:189.
|
| [9] |
BOULICAUT J F,BYKOWSKI A,RIGOTTI C.Free-sets:A condensed representation of boolean data for the approximation of frequency queries[J].Data Mining and Knowledge Discovery,2003,7(1):5.
|
| [10] |
许普乐,纪允,张勤.应用FP树快速生成无关集算法[J].安庆师范学院学报(自然科学版),2016,22(2):60.
|
| [11] |
RYMON R.Search through systematic set enumeration[C]//Proc of Third Int'l Conf.on Principles of Knowledge Representation and Reasoning.[S.l.]:[s.n.],1992:539.
|
| [12] |
田卫东,纪允.一种频繁核心项集的快速挖掘算法[J].计算机工程,2014,40(6):120.
|