摘要
通过对概念格渐进式构造过程的分析,探讨了影响Godin算法效率的因素并给出解决办法,认为在形式背景中对象的属性分布均匀的情况下,一个最佳的对象输入序列是按照它们所包含属性的从多到少的顺序,并根据实验数据验证这一结论.
This paper analyzes the process of incremental updating, makes detailed analyses of Godin algorithm, discusses the factors that affect the efficiency of Godin algorithm and gives the answer. It is supposed that the best input order of the objects is in line with the order of the numbers of attributes that belongs to each object in case of a attributes-even-distributing context, which has been improved by the experimentation data.
出处
《河南大学学报（自然科学版）》
CAS
北大核心
2006年第2期96-101,共6页
Journal of Henan University:Natural Science
基金
河南省自然科学基金项目(0311011700)
关键词
形式概念分析
概念格
渐进式算法
最佳原理
formal concept analysis
concept lattice
incremental algorithm
the optimal principium
