| 基于遗传算法的概念格布局优化 |
| |
| 引用本文： | 陈明,马骏,王芳,郑珂.基于遗传算法的概念格布局优化[J].电脑开发与应用,2007,20(10):3-6. |
| |
| 作者姓名： | 陈明 马骏 王芳 郑珂 |
| |
| 作者单位： | 河南大学,开封,475004 |
| |
| 基金项目： | 河南省高校杰出科研创新人才工程项目
,
河南大学校科研和教改项目 |
| |
| 摘 要： | 针对概念格布局过程中产生的边交叉数过多问题,分析了求解概念格图形中边交叉数问题的方法,并结合遗传算法,提出了减少边交叉数的优化策略,通过目标函数计算出概念格层次图的边交叉数最少时格节点的布局序列,从而达到在二维概念格图形布局过程中尽量减少边交叉数的目的。
|
| 关 键 词： | 概念格 层次图 遗传算法 边交叉数最小化 |
| 文章编号： | 1003-5850（2007）10-0003-04 |
| 收稿时间： | 2007-02-12 |
| 修稿时间： | 2007-08-21 |
Automated Layout Optimization of Concept Lattices based on Genetic Algorithms |
| |
| Chen Ming??.Automated Layout Optimization of Concept Lattices based on Genetic Algorithms[J].Computer Development & Applications,2007,20(10):3-6. |
| |
| Authors: | Chen Ming?? |
| |
| Abstract: | 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. |
| |
| Keywords: | concept lattices hierarchical graphs genetic algorithms edge crossing minimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
