Cited By
View all- (2018)EditorialJournal of Classification10.1007/s00357-016-9201-y33:1(1-5)Online publication date: 15-Dec-2018
Minkowski Generalizations of Ward's Method in Hierarchical Clustering
Authors: 
Alan Lee, Bobby WillcoxAuthors Info & Claims
Alan Lee, Bobby WillcoxAuthors Info & ClaimsPages 194 - 218
Abstract
In this paper, we consider several generalizations of the popular Ward's method for agglomerative hierarchical clustering. Our work was motivated by clustering software, such as the R function hclust, which accepts a distance matrix as input and applies Ward's definition of inter-cluster distance to produce a clustering. The standard version of Ward's method uses squared Euclidean distance to form the distance matrix. We explore the effect on the clustering of using other definitions of distance, such as the Minkowski distance.
References
[1]
ALBIAC, F., and KALTON, N.J. (2006), Topics in Banach Space Theory , New York: Springer.
[2]
CHEN, Z., and VAN NESS, J.W. (1996), "Space Conserving and Agglomerative Algorithms," Journal of Classification, 13 , 157-168.
[3]
CHRITCHLOW, D.E., PEARL, D.K., and QIAN, C. (1996), "The Triples Distance for Rooted Bifurcating Trees," Systematic Biology, 3 , 323-334.
[4]
ELSNER, L., HAN, L., KOLTRACHT, I., NEUMANN, M., and ZIPPEN, M. (1997), "On a Polygon Inequality by Bernius and Blanchard", unpublished manuscript, available at www.ma.huji.ac.il/~landau/preprint97/polygon.ps.
[5]
EVERITT, B.S, LANDAU, S., and LEESE. M. (2001), Cluster Analysis (4th ed.), New York: Oxford University Press.
[6]
HUBERT, L., and ARABIE, P. (1985), "Comparing Partitions", Journal of Classification, 2 , 193-218.
[7]
JACCARD, P. (1912), "The Distribution of Flora in the Alpine Zone", New Phytologist, 11 , 37-50.
[8]
KUHNER, M. K., and FELSENSTEIN, J. (1994), "A Simulation Comparison of Phylogeny Algorithms Under Equal and Unequal Evolutionary Rates", Molecular Biology and Evolution, 11 , 459-468.
[9]
LANCE, G.N., and WILLIAMS, W.T. (1967), "A General Theory of Classificatory Sorting Strategies. 1. Hierarchical Systems," Computer Journal, 9 , 373-380.
[10]
LEISCH, F., and DIMITRIADOU, E. (2010), "mlbench: Machine Learning Benchmark Problems", R package version 2.1-0, available at http://cran.r-project.org/web/packages/mlbench/mlbench.pdf.
[11]
MEILA, M. (2007), "Comparing Clusterings - An Information Based Distance," Journal of Multivariate Analysis, 98 , 873-895.
[12]
PENNY, D., and HENDY, M.D. (1985), "The Use of Tree Comparison Metrics," Systematic Zoology, 34 , 75-82.
[13]
RAND, W.M. (1971), "Objective Crieteria for the Evaluation of Clustering Methods", Jounral of the American Statiscal Association, 66 , 846-850.
[14]
ROBINSON, D.F., and FOULDS, L.R. (1981), "Comparison of Phylogenetic Trees," Mathematical Biosciences, 53 , 131-147.
[15]
SEBER, G.A.F. (1984), Multivariate Observations , New York: Wiley.
[16]
SOKAL, R.R., and ROHLF, F.J. (1962), "The Comparison of Dendrograms by Objective Methods," Taxon, 11 , 33-40.
[17]
SZÉKELY, G.J., and RIZZO, M.L. (2005), "Hierarchical Clustering via Joint Between-Within Distances: Extending Ward's Minimum Variance Method," Journal of Classification, 22 , 151-183.
[18]
WELLS, J.H., and WILLIAMS, L.R. (1970), Embeddings and Extensions in Analysis , New York: Springer.
[19]
WILLIAMS, W.T., and CLIFFORD, H.T. (1971), "On the Comparison of Two Classifications of the Same Set of Elements", Taxon, 20 , 519-522.
- Minkowski Generalizations of Ward's Method in Hierarchical Clustering
Recommendations
A novel Minkowski-distance-based consensus clustering algorithm
Consensus clustering is the problem of coordinating clustering information about the same data set coming from different runs of the same algorithm. Consensus clustering is becoming a state-of-the-art approach in an increasing number of applications. ...
Semi-supervised agglomerative hierarchical clustering with ward method using clusterwise tolerance
MDAI'11: Proceedings of the 8th international conference on Modeling decisions for artificial intelligenceThis paper presents a new semi-supervised agglomerative hierarchical clustering algorithm with ward method using clusterwise tolerance. Recently, semi-supervised clustering has been remarked and studied in many research fields. In semi-supervised ...
Analysis of ward's method
SODA '19: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete AlgorithmsWe study Ward's method for the hierarchical k-means problem. This popular greedy heuristic is based on the complete linkage paradigm: Starting with all data points as singleton clusters, it successively merges two clusters to form a clustering with one ...
Comments
Information & Contributors
Information
Published In
Copyright © Copyright © 2014 Classification Society of North America.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 July 2014
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 30 Jan 2025
Other Metrics
Citations
Cited By
View all- (2018)EditorialJournal of Classification10.1007/s00357-016-9201-y33:1(1-5)Online publication date: 15-Dec-2018