Skip to main content
SpringerLink
Log in

The use of graphs of elliptical influence in visual hierarchical clustering

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1990 (MFCS 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 452))

Abstract

We explore hierarchical clustering methods in the plane within the context of visual separability by means of graphs of elliptical influence. A novel efficient method of visual hierarchical clustering is developed.

Extended abstract

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ASH P.,BOLKER E.:Generalized Dirichlet tesselations. Geometriae dedicata 20(1986), 209–243.

    Google Scholar 

  2. BENTLEY J.,WEIDE B., YAO A.:Optimal expected-time algorithms for closest point problems, ACM Trans.on Math.Software 6(1980),563–580.

    Google Scholar 

  3. DAY W.,EDELSBRUNNER H.:Efficient algorithms for agglomerative hierarchical clustering methods. J.of Classification 1(1984), 7–24.

    Google Scholar 

  4. DIDAY E.,et all: Optimisation en classification automatique. INRIA, 1979.

    Google Scholar 

  5. EDELSBRUNNER H.:Algorithms in combinatorial geometry. Springer, 1987.

    Google Scholar 

  6. HARTIGAN J.:Clustering algorithms. Wiley, 1975.

    Google Scholar 

  7. HOTTELING H.:Analysis of a complex statistical variables into principal components, J.Educ.Psych. 24(1933), 417–441.

    Google Scholar 

  8. HUBERT L.:Data analysis implications of some concepts related to cuts of graphs, J.Math.Psych. 15(1977), 199–208.

    Google Scholar 

  9. KŘIVÁNEK M., MORÁVEK J.: N-P-hard problems in hierarchical-tree clustering, Acta informatica 23(1986), 311–323.

    Google Scholar 

  10. MATULA D., SOKAL R.:Properties of Gabriel graphs relevant to geographic variation research and the clustering of point in the plane, Geographical analysis 12(1980), 205–222.

    Google Scholar 

  11. MEHLHORN K.: Data structures and algorithms 3: multidimensional searching and computational geometry. Springer, 1984.

    Google Scholar 

  12. MURTAGH F.:A survey of recent advances in hierarchical clustering algorithms, Computer J. 26(1983), 354–360.

    Google Scholar 

  13. PREPARATA F., SHAMOS M.: Computational geometry: an introduction. Springer, 1985.

    Google Scholar 

  14. TOUSSAINT G.:The relative neighborhood graph of a finite planer set, Pattern recognition 12(1980), 261–268.

    Google Scholar 

  15. URQUHART R.:Graph theoretical clustering based on limited neighborhood sets, Pattern recognition 15(1982), 173–187.

    Google Scholar 

  16. ZAHN C.:Graph-theoretical methods for detecting and describing gestalt clusters, IEEE Trans.on Computers 20(1971), 68–86.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Charles University, Malostranské nám. 25, CS-118 00, Praha 1

    Mirko Křivánek

Authors
  1. Mirko Křivánek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Křivánek, M. (1990). The use of graphs of elliptical influence in visual hierarchical clustering. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029634

Download citation

  • DOI: https://doi.org/10.1007/BFb0029634

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation