Clique Detection via Genetic Programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8187
- @TechReport{Haynes:1995:CDG,
-
author = "Thomas Haynes",
-
title = "Clique Detection via Genetic Programming",
-
number = "UTULSA-MCS-95-02",
-
institution = "The University of Tulsa",
-
year = "1995",
-
month = apr # " 24,",
-
keywords = "genetic algorithms, genetic programming",
-
broken = "http://euler.mcs.utulsa.edu/~haynes/tr_clique.ps",
-
URL = "http://citeseer.ist.psu.edu/cache/papers/cs/2785/http:zSzzSzeuler.mcs.utulsa.eduzSz~hayneszSztr_clique.pdf/haynes95clique.pdf",
-
URL = "http://citeseer.ist.psu.edu/135522.html",
-
abstract = "Genetic Programming is used as a technique for
detecting cliques in a network. Candidate cliques are
represented in lists, and the lists are manipulated
such that larger cliques are formed from the
candidates. The clique detection problem has some
interesting implications to the Strongly Typed Genetic
Programming paradigm, namely in forming a class
hierarchy. The problem is also useful in that it is
easy to add noise.",
- }
Genetic Programming entries for
Thomas D Haynes
Citations