Felipe Lessa <felipe.le...@gmail.com> writes: > Hello! > > I'm pleased to announce the release of two new packages: > > http://hackage.haskell.org/package/hierarchical-clustering > http://hackage.haskell.org/package/gsc-weighting > > 'hierarchical-clustering' provides a function to create a dendrogram > from a list of items and a distance function between them. The most > common linkage types are available: single linkage, complete linkage > and UPGMA. An item can be anything, for example a DNA sequence, so > this may used to create a phylogenetic tree.
What actual clustering algorithm are you using here? Also, would it be possible to have some more documentation there in general? At the very least, in your next release explain what a dendogram is and why someone would want to use your package (I had to do some quick wikipedia looking to refresh my memory on what dendogram, etc. were to get an understanding of what it does). -- Ivan Lazar Miljenovic ivan.miljeno...@gmail.com IvanMiljenovic.wordpress.com _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
