安庆师范学院学报（自然科学版）2016，Vol.22Issue(2)：60-65,6.DOI:10.13757/j.cnki.cn34-1150/n.2016.02.015
应用 FP树快速生成无关集算法
A Fast Algorithm for Mining Free Sets Based on FP Tree
摘要
Abstract
By introducing free sets, we solve the over large number of mined frequent item sets in data mining and high cost of get exactly support of item set in specific using area problems .A new algorithm FMINEX is proposed , mining free sets from FP tree with a pruning strategy which aims to solve the inefficient of traditional mining free sets method .Experimental results testify FMINEX and show a better performance both in time and space consuming in mining process .关键词
数据挖掘/频繁项集/δ无关集/FP树/剪枝策略Key words
data mining/frequent item sets/free sets/FP tree/pruning strategy分类
信息技术与安全科学引用本文复制引用
许普乐,纪允,张勤..应用 FP树快速生成无关集算法[J].安庆师范学院学报（自然科学版）,2016,22(2):60-65,6.基金项目
安徽省高等学校省级一般教学研究项目（20101264）。 （）
