摘要
通过在FP-Tree中加入分类信息,并将特征结点与分类结点转换成按字典排序的项-序表,生成被约束子树,实现了对基于分类频繁模式树的关联分类数据挖掘算法的改进。
By adding classified information and transforming feature crunode and classified crunode into alphabet order table to produce Restricted Sub-tree.We can make the improvement of the association classified data excavation algorithm based on CFP-tree.
出处
《电脑编程技巧与维护》
2011年第20期114-115,共2页
Computer Programming Skills & Maintenance