【24h】

Selective Equation Constructor: A Scalable Genetic Algorithm

机译:选择方程构造器:一种可扩展的遗传算法

获取原文

摘要

Efforts to improve machine learning performance begin with defining a valuable feature set. However, datasets with copious amounts of attributes can have relevant information that is obscured by its high dimensionality, which can be caused by repetitive characteristics or irrelevant qualities. Genetic algorithms provide improvements to feature sets through dimensionality reduction and feature construction. Most genetic algorithms follow the theoretical framework of evolutionary theory where a population of features randomly evolves through generations through a series of random operations such as crossover and mutation. While successful, the randomness of feature modification operations and derived constructed features may yield offsprings that under-perform compared to their ancestors, yet their properties are utilized in future generations. We developed a new genetic algorithm called Selective Equation Constructor (SEC) that evolves constructed features selectively in order to limit the shortcomings of other genetic algorithms. The algorithm leads to faster computation and better results compared to similar algorithms. Analysis of the results indicates increases in classification accuracy, decreased run time, and reduction in attribute count.
机译:从定义有价值的功能集开始,努力提高机器学习性能。但是,具有大量属性的数据集可能具有因其高维度而被遮盖的相关信息,这可能是由重复性特征或无关质量引起的。遗传算法通过减少维数和构建特征来改进特征集。大多数遗传算法遵循进化论的理论框架,在进化论中,一系列特征通过一系列随机操作(例如交叉和变异)随机地世代演化。虽然成功,但特征修改操作和派生的构造特征的随机性可能会产生后代与其后代相比表现不佳的后代,但其后代会利用其后代。我们开发了一种称为选择方程构造器(SEC)的新遗传算法,该算法选择性地扩展了构造的特征,以限制其他遗传算法的缺点。与类似算法相比,该算法可加快计算速度并获得更好的结果。结果分析表明,分类准确性提高了,运行时间减少了,属性计数减少了。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利