| 用于挖掘TCM-FP树中维间最大频繁项集的算法 |
| |
| 引用本文： | 韩立毛,鞠时光,朱金伟.用于挖掘TCM-FP树中维间最大频繁项集的算法[J].江南大学学报(自然科学版),2010,9(2):185-190. |
| |
| 作者姓名： | 韩立毛 鞠时光 朱金伟 |
| |
| 作者单位： | 1. 盐城工学院,信息工程学院,江苏,盐城,224003
2. 江苏大学,计算机科学与通信学院,江苏,镇江,212013 |
| |
| 摘 要： | 为了提高数据挖掘算法在中医药数据处理中的效率,提出了采用TCMA算法挖掘TCM-FP树中的维间最大频繁项集。根据中医药数据的特点及药组挖掘的需求,在FP-growth算法的基础上,提出了TCM-FP树及其建树算法和挖掘算法TCMA,在TCM-FP树中采用优化搜索策略挖掘维间最大频繁项集,与FP-growth算法挖掘所有频繁项集比,大大缩短了时间。优化搜索算法切合中药TCM规则挖掘的实际意义,比FP-growth算法挖掘有更高的运行效率。
|
| 关 键 词： | 数据挖掘 搜索策略 关联规则 最大频繁项集 TCMA算法 |
Research on the Mining of Inter-Dimensional Maximal Frequent Itemsets Algorithm of TCM-FP Tree |
| |
| HAN Li-mao,JU Shi-guang,ZHU Jin-wei.Research on the Mining of Inter-Dimensional Maximal Frequent Itemsets Algorithm of TCM-FP Tree[J].Journal of Southern Yangtze University:Natural Science Edition,2010,9(2):185-190. |
| |
| Authors: | HAN Li-mao JU Shi-guang ZHU Jin-wei |
| |
| Institution: | 1.School of Information Engineering;Yancheng Institute of Technology;Yancheng 224003;China;2.School of Computer Science and Communication Engineering;Jiangsu University;Zhenjiang 212013;China |
| |
| Abstract: | To improve the data mining algorithms in traditional Chinese medicine data processing efficiency,the adoption of the inter-dimensional maximal frequent item set of the TCMA(traditional Chinese medicine algorithm) algorithms mining is presented.In accordance with the characteristics of Chinese medicine and the demand for drugs group and based on FP-growth algorithms,TCM-FP tree and its contribution algorithm and TCMA mining algorithm is proposed.Optimized search strategy mining inter-dimensional maximal freq... |
| |
| Keywords: | data mining search strategy association rule maximal frequent itemset TCMA algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
