A New Quartet Tree Heuristic for Hierarchical Clustering

Created by W.Langdon from gp-bibliography.bib Revision:1.4340

  author =       "Rudi Cilibrasi and Paul M. B. Vitany",
  title =        "A New Quartet Tree Heuristic for Hierarchical
  booktitle =    "Theory of Evolutionary Algorithms",
  year =         "2006",
  editor =       "Dirk V. Arnold and Thomas Jansen and 
                 Michael D. Vose and Jonathan E. Rowe",
  number =       "06061",
  series =       "Dagstuhl Seminar Proceedings",
  ISSN =         "1862-4405",
  publisher =    "Internationales Begegnungs- und Forschungszentrum fuer
                 Informatik (IBFI), Schloss Dagstuhl, Germany",
  address =      "Dagstuhl, Germany",
  URL =          "http://drops.dagstuhl.de/opus/volltexte/2006/598/pdf/06061.VitanyiPaulB.Paper.598.pdf",
  URL =          "http://drops.dagstuhl.de/opus/volltexte/2006/598",
  note =         "$<$http://drops.dagstuhl.de/opus/volltexte/2006/598$>$
                 [date of citation: 2006-01-01]",
  month =        "5-10 " # feb,
  keywords =     "genetic algorithms, genetic programming, hierarchical
                 clustering, quartet tree method",
  size =         "13 pages",
  abstract =     "We present a new quartet heuristic for hierarchical
                 clustering from a given distance matrix. We determine a
                 dendrogram (ternary tree) by a new quartet method and a
                 fast heuristic to implement it. We do not assume that
                 there is a true ternary tree that generated the
                 distances and which we with to recover as closely as
                 possible. Our aim is to model the distance matrix as
                 faithfully as possible by the dendrogram. Our algorithm
                 is essentially randomised hill-climbing, using
                 parallelised Genetic Programming, where undirected
                 trees evolve in a random walk driven by a prescribed
                 fitness function. Our method is capable of handling up
                 to 60--80 objects in a matter of hours, while no
                 existing quartet heuristic can directly compute a
                 quartet tree of more than about 20--30 objects without
                 running for years. The method is implemented and
                 available as public software at www.complearn.org. We
                 present applications in many areas like music,
                 literature, bird-flu (H5N1) virus clustering, and
                 automatic meaning discovery using Google.",

Genetic Programming entries for Rudi Cilibrasi Paul M B Vitany