快速的混合进化子结构发现算法  

Fast hybrid evolutionary substructure discovery algorithm

作　　者：常新功[1] 马尚才[1] 贾伟[1] 

机构地区：[1]山西财经大学信息管理学院,太原030031

出　　处：《计算机应用》2009年第6期1594-1597,1614,共5页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60873100);山西省高校科技研究开发项目(20081023)

摘　　要：将混合进化算法引入图数据挖掘,避免了陷入局部极值问题,提高了解的质量。在此基础上提出了一种基于单标签扩展的子结构扩展方法,该方法可以减少进化过程中图同构操作执行的次数。在典型数据集上的仿真实验和理论证明表明了该方法的高效性和正确性。To avoid local-optima and enhance the qualities of solutions, a hybrid evolutionary algorithms system was developed to perform data mining on databases represented as graphs. To increase the efficiency of the algorithm, a new substructure extension method based on single-label substructure extension was proposed, which could greatly reduce the times for performing graph isomorphism during the evolution. Experimental resuhs on some typical data sets and theoretical proof indicate its high efficiency and correctness.

关 键 词：进化算法 图数据挖掘 子结构发现 子结构扩展 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]