The use of graphs of elliptical influence in visual hierarchical clustering
- 1 December 2005
- book chapter
- Published by Springer Nature
- p. 392-398
- https://doi.org/10.1007/bfb0029634
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- NP-hard problems in hierarchical-tree clusteringActa Informatica, 1986
- Generalized Dirichlet tessellationsGeometriae Dedicata, 1986
- Efficient algorithms for agglomerative hierarchical clustering methodsJournal of Classification, 1984
- Data Structures and Algorithms 3Published by Springer Nature ,1984
- A Survey of Recent Advances in Hierarchical Clustering AlgorithmsThe Computer Journal, 1983
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the PlaneGeographical Analysis, 1980
- Data analysis implications of some concepts related to the cuts of a graphJournal of Mathematical Psychology, 1977
- Analysis of a complex of statistical variables into principal components.Journal of Educational Psychology, 1933