基于遗传算法的概念格布局优化  

Automated Layout Optimization of Concept Lattices based on Genetic Algorithms

作　　者：陈明[1] 马骏[1] 王芳[1] 郑珂[1] 

机构地区：[1]河南大学,开封475004

出　　处：《电脑开发与应用》2007年第10期3-6,共4页Computer Development & Applications

基　　金：河南省高校杰出科研人才创新工程项目(2007KYCX018);河南大学自然科学基金项目(05YBZR008)

摘　　要：针对概念格布局过程中产生的边交叉数过多问题,分析了求解概念格图形中边交叉数问题的方法,并结合遗传算法,提出了减少边交叉数的优化策略,通过目标函数计算出概念格层次图的边交叉数最少时格节点的布局序列,从而达到在二维概念格图形布局过程中尽量减少边交叉数的目的。The aim of this paper is to solve the problem of edges crossing of the concept lattices＇ layout. This paper analyzes an approach to solve the problem of edge crossing in concept lattices, and then an optimization is given for minimizing edge crossing problem based on the genetic algorithms, The objective function was established to gain the layout sequence of concept lattices when the numbers of layout edges crossing of concept lattices are the least. Using the layout sequence we can achieve the aims of edge crossing minimization during the 2D layout of concept lattices.

关 键 词：概念格 层次图 遗传算法 边交叉数最小化 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]