The relationship between (Un)fractured problems and division of input space

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Problems can be categorized as fractured or unfractured ones. A different set of characteristics are needed for learning algorithms to solve each of these two types of problems. However, the exact characteristics needed to solve each type are unclear. This article shows that the division of the input space is one of these characteristics. In other words, a study is presented showing that while fractured problems benefit from a finer division of the input space, unfractured problems benefit from a coarser division of input space. Many open questions still remains. And the article discusses two conjectures which can be used to solve fractured problems more easily.

Original languageEnglish
Title of host publicationGECCO 2015 - Companion Publication of the 2015 Genetic and Evolutionary Computation Conference
EditorsSara Silva
PublisherAssociation for Computing Machinery, Inc
Pages981-987
Number of pages7
ISBN (Electronic)9781450334884
DOIs
Publication statusPublished - Jul 11 2015
Event17th Genetic and Evolutionary Computation Conference, GECCO 2015 - Madrid, Spain
Duration: Jul 11 2015Jul 15 2015

Publication series

NameGECCO 2015 - Companion Publication of the 2015 Genetic and Evolutionary Computation Conference

Other

Other17th Genetic and Evolutionary Computation Conference, GECCO 2015
CountrySpain
CityMadrid
Period7/11/157/15/15

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'The relationship between (Un)fractured problems and division of input space'. Together they form a unique fingerprint.

Cite this