Applications of Rough Genetic Algorithms

摘要: This paper describes rough genetic algorithms based on the notion of interval values. A gene in a algorithm can be represented using an interval. The explains how this generalization facilitates development new operators and evaluation measures. Various operations are illustrated simple document retrieval example. An experiment involving classification interval-valued traffic patterns demonstrates usefulness for real-world applications. discussion further extensions to sets is also included.