http://de.evo-art.org/index.php?action=history&feed=atom&title=Finding_diverse_examples_using_genetic_algorithms 2026-05-07T07:34:32Z Versionsgeschichte dieser Seite in de_evolutionary_art_org MediaWiki 1.27.4 http://de.evo-art.org/index.php?title=Finding_diverse_examples_using_genetic_algorithms&diff=996&oldid=prev 2014-11-07T08:14:50Z

<p>Die Seite wurde neu angelegt: „ == Reference == Johnson, C.: Finding diverse examples using genetic algorithms. In: John, R., Birkenhead, R. (eds.) Developments in Soft Computing. Advances …“</p> <p><b>Neue Seite</b></p><div><br /> <br /> == Reference ==<br /> Johnson, C.: Finding diverse examples using genetic algorithms. In: John, R., Birkenhead, R. (eds.) Developments in Soft Computing. Advances in Soft Computing, pp. 92–99. Physica/Springer-Verlag (2001). <br /> <br /> == DOI ==<br /> http://link.springer.com/chapter/10.1007/978-3-7908-1829-1_11<br /> <br /> == Abstract ==<br /> The problem of finding qualitative examples is an interesting yet little studied machine learning problem. Take a set of objects, O and a set of classes C, where each object fits into one and only one class. Represent this classification by a total function f: O → C. We assume that ∣range(f)∣ « ∣O∣.<br /> <br /> == Extended Abstract ==<br /> <br /> == Bibtex == <br /> <br /> == Used References ==<br /> Adams, C. A. (1994). The knot book. W.H. Freeman.<br /> <br /> Attwood, T., and Parry-Smith, D. (1999). Introduction to bioinformatics. Addison Wesley Longman.<br /> <br /> Bäck, T. (1996). Evolutionary algorithms in theory and practice. Oxford University Press.<br /> <br /> Belew, R. K. (2000). Finding out about: information retrieval and other technologies for seeking knowledge. Cambridge University Press. (In preparation)<br /> <br /> Bentley, P. J. (Ed.). (1999). Evolutionary design by computers. Academic Press.<br /> <br /> Boden, M. (1990). The creative mind: Myths and mechanisms. Abacus.<br /> <br /> De Jong, K. (1993). Genetic algorithms are NOT function optimizers. In L. Whitley (Ed.), Foundations of genetic algorithms 2 (pp. 5–17). Morgan Kauffmann<br /> <br /> Goldberg, D. E. (1987). Simple genetic algorithms and the minimal deceptive problem. In L. D. Davis (Ed.), Genetic algorithms and simulated annealing. Morgan Kaufmann.<br /> <br /> Harvey, I. (1997). Cognition is not computation: Evolution is not optimisation. In W. Gerstner, A. Germond, M. Hasler,, and J.-D. Nicoud (Eds.), Proceedings of the seventh international conference on artificial neural networks (pp. 685–690). Springer-Verlag.<br /> <br /> Holland, J. H. (1975). Adaptation in natural and artificial systems. MIT Press. (Second edition 1992)<br /> <br /> Hoste, J., Thistlethwaite, M., and Weeks, J. (1998). The first 1,701,936 knots. The Mathematical Intelligencer, 20(4), 33–48.<br /> <br /> Johnson, C. G. (2000). Understanding complex systems through examples: a framework for qualitative example finding. In P. A. Gelepithis (Ed.), Complex intelligent systems. Kingston University.<br /> <br /> Mafoud, S. W. (1997). Niching methods. In T. Bäck, D. B. Fogel, and Z. Michalewicz (Eds.), Handbook of evolutionary computation (pp. C6.1.1—C6.1.4). Oxford University Press/Institute of Physics.<br /> <br /> Mitchell, M. (1996). An introduction to genetic algorithms. Bradford Books/MIT Press.<br /> <br /> Mitchell, M., Forrest, S., and Holland, J. (1992). The royal road for genetic algorithms: Fitness landscapes and GA performance. In F. Varela and P. Bourgine (Eds.), Towards a practice of autonomous systems: Proceedings of the first european conference on artificial life. MIT Press. Murasugi, K. (1996). Knot theory and its applications. Birkhäuser.<br /> <br /> Partridge, D., and Rowe, J. (1994). Computers and creativity. Intellect Books. van Rijsbergen, C. J. (1979). Information retrieval. London: Butterworths.<br /> <br /> <br /> == Links ==<br /> === Full Text === <br /> http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.43.421&amp;rep=rep1&amp;type=pdf<br /> <br /> [[intern file]]<br /> <br /> === Sonstige Links ===<br /> http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.421</div>

Gbachelier