期刊文献+

基于聚类分析和可视化的增强遗传算法—I.算法的引出、原理与分析

Cluster Analysis and Visualization Enhanced Genetic Algorithm—I.Eduction,Principle and Analysis
下载PDF
导出
摘要 提出了一种基于数据可视化的聚类分析法(ClusterConstrainedMapping,CCM)和人机结合的增强遗传算法,可保证进化过程在可行域中进行,不需要任何惩罚函数参数,可有效地进行带约束问题的优化. Genetic Algorithms (GA) based on penalty function methods have been the most popular approach to constrained optimization problems because of their simplicity and ease of implementation. But how to find appropriate penalty parameters needed to guide the search towards the constrained optimum in the penalty function approaches is very difficult. A new cluster analysis based on visualization is proposed to address the constrained optimization problems. First, a Cluster Constrained Mapping (CCM) method based on feed-forward Artificial Neural Network (ANN) is proposed for dimension-reduction mapping from the original n-D space to 2-D, conserving the cluster information in the reduced dimensional space. Then the agglomerative algorithm that works in 2-D space is called upon for cluster analysis. Its parameters are provided through visualization and subsequent interaction with the user. Finally, the cluster information is derived from 2-D back into n-D to obtain the feasible region knowledge in the original dimensions, which is used in the IGA. The enhanced GA, incorporating a new cluster analysis method through data visualization (CCM) and user interaction guarantees the process of evolution in feasible regions without requiring any penalty parameters.
出处 《过程工程学报》 EI CAS CSCD 北大核心 2004年第5期438-444,共7页 The Chinese Journal of Process Engineering
基金 国家973计划资助项目(编号:G2000263)
关键词 可视化 聚类分析 带约束优化 遗传算法 visualization cluster analysis constrained optimization genetic algorithm
  • 相关文献

参考文献12

  • 1Goldberg D E. Genetic Algorithms in Search Optimization and Machine Learning [M]. Reading: Addison Wesley, 1989.
  • 2Michalewicz Z. Genetic Algorithms, Numerical Optimization, and Constraints [A]. Eshelman L. Proceedings of the Sixth International Conference on Genetic Algorithms [C]. San Mateo: Morgan Kauffman, 1995. 151-158.
  • 3Michalewicz Z, Schoenauer M. Evolutionary Algorithms for Constrained Parameter Optimization Problems [J]. Evol. Comput., 1996, 4(1): 1-32.
  • 4Gordon A D. Classification [M]. New York: Chapman and Hall, 1981.
  • 5Kohonen T. Self-organizing Maps [M]. Berlin, Heidelberg: Springer, 1995.
  • 6Ward J H. Hierarchical Grouping to Optimize a Objective Function. [J]. J. Am. Statist. Assoc., 1963, 58: 236-244.
  • 7Pao Y H. Dimension Reduction, Feature Extraction and Interpretation of Data with Network Computing [J]. Int. J. Pattern Recogn. Artif. Intell., 1996, 1(5): 521-535.
  • 8Zhou Meng. Visualization and Self-organization of Multidimensional Data as an Aid to Understanding [M]. Electrical Engineering and Applied Physics, 1999.
  • 9Wang K, Fraga E, Salhi A. A Cluster Identification Using Parallel Coordinate System and Genetic Algorithm for Knowledge Discovery and Nonlinear Optimization [A]. European Symposium on Computer Aided Process Engineering-12 (ESCAPE 12) [C]. Hague, 2002. 100
  • 10Deb K, Goyal M. A Combined Genetic Adaptive Search (GeneAS) for Engineering Design [J]. Comput. Sci. Informa., 1996, 26(4): 30-45.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部