Theoretical and Mathematical Physics

, Volume 164, Issue 3, pp 1163–1168 | Cite as

Multidimensional clustering and hypergraphs

Article

Abstract

We discuss a multidimensional generalization of the clustering method. In our approach, the clustering is realized by partially ordered hypergraphs belonging to some family. The suggested procedure is applicable in the case where the original metric depends on a set of parameters. The clustering hypergraph studied here can be regarded as an object describing all possible clustering trees corresponding to different values of the original metric.

Keywords

clustering hypergraph data analysis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    F. Murtagh, Multidimensional Clustering Algorithms (Compstat Lect., Vol. 4), Physica, Heidelberg (1985).MATHGoogle Scholar

Copyright information

© MAIK/Nauka 2010

Authors and Affiliations

  1. 1.Steklov Mathematical InstituteRASMoscowRussia

Personalised recommendations