摘要
为准确高效的完成数据的准备工作,提出在属性集不同、对象集相同形式背景下多区间概念格的动态横向合并算法.首先,为保证格结构的完整性,对区间概念格的渐进式生成算法进行改进,将区间概念分为存在概念、冗余概念和空概念;其次,结合区间概念格自身特点,给出区间概念格一致性的概念以及格结构横向合并的充要条件;再次,将合并后的区间概念分情况进行讨论,并给出相应的横向合并原理;最后应用层序遍历的方法扫描格结构,提出横向合并效率.实例表明,该算法的可行性和高效性.
In the era of big data,the data updating is real-time.How to prepare the data accurately and efficiently is the key to mining association rules.In view of the above questions,this paper proposed a dynamic horizontal union algorithm of multi interval concept lattice under the same background of the different attribute set and object set.First,in order to ensure the integrity of the lattice structure,the interval concept lattice incremental generation algorithm was improved,and then interval concept was divided into existing concept,redundancy concept and the empty concept.Secondly,combining the characteristics of interval concept lattice,the concept of consistency of interval concept lattice was defined and it is the necessary and sufficient conditions for the horizontal union of lattice structure.Further,the interval concepts merged were discussed,and the principle of horizontal mergers was given.Finally,the sequence was scanned by the traversal method.This method increased the efficiency of horizontal merger.A case study shows the feasibility and efficiency of the proposed algorithm.
出处
《辽宁工程技术大学学报（自然科学版）》
CAS
北大核心
2016年第11期1363-1369,共7页
Journal of Liaoning Technical University (Natural Science)
基金
国家自然科学基金项目(61370168
61472340)
河北省科技厅条件建设项目(14960112D)
关键词
大数据
区间概念格
动态性
横向合并
层序遍历
big data
interval concept lattice
horizontal merger
sequence traversal
