A Non-Discrete Approach to the Evolution of Information Filtering Trees

  • Authors:
  • E. Bonsma

  • Affiliations:
  • -

  • Venue:
  • BT Technology Journal
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Boolean keyword trees can be used for information filtering. When they are generated by an evolutionary algorithm they can adapt to changes in the user's interests. This paper presents a non-discrete tree model that has been designed to be easier to evolve than more commonly used Boolean trees. Each tree is encoded by a genome that contains binary data as well as real-valued data. The results of the experiments are promising and suggest that the proposed model indeed offers an improvement.