Present: Lee, Nic, Lance, Tom (scribe), Ben, Beryl, Tim, Wren, Eddie
Finishing some Student Project Ideas from Last Week
Eddie – He’s tried some stuff with Brevis and Quill. He might next work some with Pucks.
Ben – Not sure yet. Maybe something A-Life-y?
Tom’s Benchmark Problems
Should we include problems beyond iJava and Yuriy’s paper?
- We should have a citable source outside our work for the problem — i.e. not “we made it up”. Otherwise, probably “yes”.
- FizzBuzz (kata) – yes
- Bowling (kata) – maybe
- Factorial – maybe (too easy?)
- WC – yes
- US Change – maybe (need citable source)
- Tom will consult rest of committee.
Wren is going to try some things and consult others to try to see if a solution already exists.
Homology of Population
- Levenshtein distance of pairs of programs seems like good measurement.
- Likely can’t test all pairs, since this will usually be about 1 million Levenshtein distance computations. This will probably be too slow.
- Instead, sample random pairs of individuals — maybe on the order of 1000 to 10000.
- May need to do validation to make sure the sample results really reflect the population.
- Report: median, quartiles, mean, standard deviation.
Nic McPhee Presents: Analysis of Ancestry in GP with a Graph DB
- Using Neo4j – a graph database – to store ancestry info throughout a GP run.
- Makes ancestry info easy to collect and query.
- NeoCons – Clojure with Neo4j
- Cool stats can be queried from the database!
- Could be neat to look at common ancestries using different parent selection methods!