Stadnyk I. Schema Recombination in a Pattern Recognition Problem Proceedings of The Second International Conference on Genetic Algorithms and Their Applications. Lawrence Erlbaum Associates,1987, 27-35.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....systems is often due to the impossibility to exhaustively test a system. The diversity and imperfect matching abilities for self nonself recognition have already been a source of inspiration in several major applications. The representation of antigen and antibodies by binary strings [10] [22] has seen the development of the negative selection algorithm for self non self discrimination in computer security and virus protection [11] and anomaly detection in time series data [6] 2.1 Representation Methods of self non self differentiation are developed through a finite state machine ....

I. Stadnyk. Schema Recombination in a Pattern Recognition Problem. In Proceedings 2nd Internation Conference on Genetic Algorithms and their Applications, pages 27--35, 1987.

....1989) Fitness sharing works by reducing the fitnesses of similar population elements. Crowding (De Jong, 1975; Mahfoud, 1992, 1994, 1995a) is another type of niching method that has also been applied to classification (Booker, 1982; Goldberg, 1983; Holland Reitman, 1978; Sedbrook et al. 1991; Stadnyk, 1987). Crowding forces newly generated population elements to replace older elements that are similar. Sequential niching (Beasley et al. 1993) is a third approach, implemented by Sikora and Shaw (1994) in their genetic classification system. Sequential niching repeatedly runs a traditional GA, each ....

Stadnyk, I. 1987. Schema recombination in a pattern recognition problem. In Genetic algorithms and their applications: Proceedings of the second international conference on genetic algorithms, 2735.

....to refine our analysis to account for these cases. 6. 3 Relation to immunology The algorithm presented here is related to earlier immune system models based on a universe in which antigens (foreign material) and antibodies (the cells that perform the recognition) are represented by binary strings [5, 17, 7, 6]. The complex chemistry of antibody antigen recognition is highly simplified in these binary immune systems, being modeled as string matching. These binary models have been used to study several different aspects of the immune system, including its ability to detect common patterns in noisy ....

I. Stadnyk, "Schema recombination in pattern recognition problems." In Proceedings of the Second International Conference on Genetic Algorithms, Hillsdale, NJ: Lawrence Erlbaum Associates, 1992, pp. 27-35,

....Antibody . Figure 1 illustrates the matching procedure. There are many possible match rules that are plausible physiologically [19] For example, M can simply count the number of complementary bits or M can identify contiguous regions of complementary bitwise matches within the string. Stadnyk [23] introduced a function M that computes the lengths l i of the complementary regions, and combines them such that long regions are rewarded more than short ones. Using this basic idea, many different specific functions can be defined that are linear or nonlinear in l i . We have studied several ....

I. Stadnyk. Schema recombination in pattern recognition problems. In Proc. 2nd International Conference on Genetic Algorithms and their Applications, Hillsdale, N.J., 1987. Lawrence Erlbaum Assoc.

....scheme. In this, offspring are compared with a few (typically 2 or 3) randomly chosen individuals from the population. The offspring replaces the most similar one found, using Hamming distance as the similarity measure. This again aids diversity, and indirectly encourages speciation. Stadnyk [Sta87] found better results using a variation on this. The sampling of individuals was biassed according to inverse fitness, so that new offspring replace others which are in the same niche and have low fitness. Booker [Boo85] uses restricted mating to encourage speciation. In this scheme, individuals ....

I. Stadnyk. Schema recombination in a pattern recognition problem. In J.J. Grefenstette, editor, Proceedings of the Second International Conference on Genetic Algorithms, pages 27--35. Lawrence Erlbaum Associates, 1987.

....by the deletion of self reactive T cells than by the deletion of antibodies. The algorithm presented here is related to earlier immune system models based on a universe in which antigens (foreign material) and antibodies (the cells that perform the recognition) are represented by binary strings [2, 11, 4, 3]. The complex chemistry of antibody antigen recognition is highly simplified in these binary immune systems, being modeled as string matching. These binary models have been used to study several different aspects of the immune system, including its ability to detect common patterns in noisy ....

I. Stadnyk. Schema recombination in pattern recognition problems. In Proceedings of the Second International Conference on Genetic

No context found.

Stadnyk I. Schema Recombination in a Pattern Recognition Problem Proceedings of The Second International Conference on Genetic Algorithms and Their Applications. Lawrence Erlbaum Associates,1987, 27-35.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC