.png){kind=icon}
返回
Using support vector machines to learn the efficient set in multiple objective discrete optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2007.09.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose using support vector machines (SVMs) to learn the efficient set in multiple objective discrete optimization (MODO). We conjecture that a surface generated by SVM could provide a good approximation of the efficient set. As one way of testing this idea, we embed the SVM-approximated efficient set information into a Genetic Algorithm (GA). This is accomplished by using a SVM-based fitness function that guides the GA search. We implement our SVM-guided GA on the multiple objective knapsack and assignment problems. We observe that using SVM improves the performance of the GA compared to a benchmark distance based fitness function and may provide competitive results. (C) 2007 Elsevier B.V. All rights reserved.
Keyword:
Multiple objective optimization
Efficient set
Machine learning
Support vector machines
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
分享收藏Credit rating analysis with support vector machines and neural networks: a market comparative study基于支持向量机和神经网络的信用评级分析: 市场比较研究
PREAI
分享收藏分享收藏Text categorization with support vector machines.: How to represent texts in input space?.png)
MACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏
查看更多内容