. . "Kubal\u00EDk, Ji\u0159\u00ED" . "[1E86DA759E02]" . . . . . "ACM" . "New York" . "2"^^ . . "2"^^ . . "Context-sensitive Refinements for Stochastic Optimization Algorithms in Inductive Logic Programming" . "RIV/68407700:21230/10:00171012!RIV11-MSM-21230___" . "2010-07-07+02:00"^^ . "optimization; evolutionary algorithms; inductive logic programming"@en . "Z(MSM6840770012)" . "251971" . . "Context-sensitive Refinements for Stochastic Optimization Algorithms in Inductive Logic Programming" . "Proceedings of the 12th annual conference comp on Genetic and evolutionary computation" . "RIV/68407700:21230/10:00171012" . "21230" . . "Portland, Oregon" . . . . "Context-sensitive Refinements for Stochastic Optimization Algorithms in Inductive Logic Programming"@en . "Context-sensitive Refinements for Stochastic Optimization Algorithms in Inductive Logic Programming"@en . "In this paper we describe a new approach to the application of evolutionary stochastic search in Inductive Logic Programming (ILP). Unlike traditional approaches that focus on evolving populations of logical clauses, our refinement-based approach uses the stochastic optimization process to iteratively adapt initial working clause. Utilization of context-sensitive concept refinements (adaptations) helps the search operations to produce mostly syntactically correct concepts and enables using available background knowledge both for efficiently restricting the search space and for directing the search. Thereby, the search is more flexible, less problem-specific and the framework can be easily used with any stochastic search algorithm within ILP domain. Experimental results on several data sets verify the usefulness of this approach." . . "Buryan, Petr" . . . "In this paper we describe a new approach to the application of evolutionary stochastic search in Inductive Logic Programming (ILP). Unlike traditional approaches that focus on evolving populations of logical clauses, our refinement-based approach uses the stochastic optimization process to iteratively adapt initial working clause. Utilization of context-sensitive concept refinements (adaptations) helps the search operations to produce mostly syntactically correct concepts and enables using available background knowledge both for efficiently restricting the search space and for directing the search. Thereby, the search is more flexible, less problem-specific and the framework can be easily used with any stochastic search algorithm within ILP domain. Experimental results on several data sets verify the usefulness of this approach."@en . "978-1-4503-0073-5" . . "2"^^ .