摘要
采用剪枝方法,通过对NextClosure算法的改进,提出一种基于剪枝的概念格批处理算法Prun-NextClosure,减少了概念格构造过程中闭包运算的次数,从而提高概念格的构造效率。实验使用随机生成的数据集,验证了该算法的正确性和有效性。
Based on pruning, this paper presents a new batch algorithm-Prun _ NextClosure, which could decrease the times of closure operation through the amelioration algorithm-NextClosure. It could improve the efficiency of the concept lattice＇s construction. The experiment results proved the correctness and validity of the Algorithm by taking random data as the formal context.
出处
《广西师范大学学报（自然科学版）》
CAS
北大核心
2007年第4期32-35,共4页
Journal of Guangxi Normal University:Natural Science Edition
基金
辽宁省教育厅高等学校科学研究基金资助项目(105L011)
关键词
概念格
批处理算法
前缀树
concept lattice
batch algorithm
prefix-tree
