| 快速更新最小频繁概念格 |
| |
| 引用本文： | 许娅.快速更新最小频繁概念格[J].合肥工业大学学报(自然科学版),2009,32(5). |
| |
| 作者姓名： | 许娅 |
| |
| 作者单位： | 合肥工业大学,计算机与信息学院,安徽,合肥,230009;安徽水利水电职业技术学院,机电系,安徽,合肥,231603 |
| |
| 摘 要： | 更新挖掘最大频繁项目集是研究动态数据库挖掘的重要方面;文章在量化概念格的基础上,引进最小频繁概念格的概念,提出了一种快速的更新挖掘最大频繁项目集的算法,该算法能够在原有挖掘结果的基础上,快速有效地挖掘出更新后的数据库中隐含的新最大频繁项目集.
|
| 关 键 词： | 量化概念格 最小频繁概念格 增量式更新 |
Fast updating of the minimum frequent concept lattice |
| |
| XU Ya.Fast updating of the minimum frequent concept lattice[J].Journal of Hefei University of Technology(Natural Science),2009,32(5). |
| |
| Authors: | XU Ya |
| |
| Institution: | 1.School of Computer and Information;Hefei University of Technology;Hefei 230009;China;2.Dept.of Mechano-electronic Engineering;Anhui Water Resources and Hydropower Vocational and Technical College;Hefei 231603;China |
| |
| Abstract: | Updating in mining maximum frequent item sets is a key problem in data mining research.A new concept of minimum frequent concept lattice is introduced based on the Quantitative Concept Lattice(QCL).A fast updating algorithm for mining maximum frequent item sets is proposed.The algorithm can efficiently discover maximum frequent item sets from an updated database based on the previous mining result. |
| |
| Keywords: | QCL minimum frequent concept lattice incremental updating |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
