δ无关集的引入可解决数据挖掘领域中挖掘出来的频繁项集数量过大以及在实际应用中获取准确项集支持度代价过大的问题。针对传统方法生成无关集生成效率过低等问题，本文提出了一种在 FP树上快速生成、结合一定的剪枝策略的快速挖掘算法FMINEX。实验效果证明，该算法在挖掘过程中，时间和空间性能都比较好。%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 .
展开▼
