nips nips2003 nips2003-24 nips2003-24-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: David Kauchak, Sanjoy Dasgupta
Abstract: We describe a procedure which finds a hierarchical clustering by hillclimbing. The cost function we use is a hierarchical extension of the k-means cost; our local moves are tree restructurings and node reorderings. We show these can be accomplished efficiently, by exploiting special properties of squared Euclidean distances and by using techniques from scheduling algorithms. 1
[1] T.L. Ferea et al. Systematic changes in gene expression patterns following adaptive evolution in yeast. Proceedings of the National Academy of Sciences, 97, 1999.
[2] J.A. Hartigan. Clustering algorithms. Wiley, 1975.
[3] J.A. Hartigan. Statistical theory in clustering. Journal of Classification, 1985.
[4] W.A. Horn. Single-machine job sequencing with treelike precedence ordering and linear delay penalties. SIAM Journal on Applied Mathematics, 23:189–202, 1972.
[5] D. Kauchak and S. Dasgupta. Manuscript, 2003. 90