Clustering by hypergraphs and dimensionality of cluster systems
From MaRDI portal
Abstract: In the present paper we discuss the clustering procedure in the case where instead of a single metric we have a family of metrics. In this case we can obtain a partially ordered graph of clusters which is not necessarily a tree. We discuss a structure of a hypergraph above this graph. We propose two definitions of dimension for hyperedges of this hypergraph and show that for the multidimensional p-adic case both dimensions are reduced to the number of p-adic parameters. We discuss the application of the hypergraph clustering procedure to the construction of phylogenetic graphs in biology. In this case the dimension of a hyperedge will describe the number of sources of genetic diversity.
Recommendations
Cites work
Cited in
(15)- Cluster adjacency beyond MHV
- scientific article; zbMATH DE number 1305418 (Why is no real title available?)
- Watersheds on Hypergraphs for Data Clustering
- From hypertrees to arboreal quasi-ultrametrics
- Clustering in Hypergraphs to Minimize Average Edge Service Time
- Clustering Using Cyclic Spaces of Reversible Cellular Automata
- scientific article; zbMATH DE number 1409218 (Why is no real title available?)
- Cluster networks and Bruhat-Tits buildings
- Motif and Hypergraph Correlation Clustering
- Ultrametricity in the theory of complex systems
- Multidimensional clustering and hypergraphs
- scientific article; zbMATH DE number 5320278 (Why is no real title available?)
- Parsimonious cluster systems
- The abstract Laplacian tensor of a hypergraph with applications in clustering
- \(p\)-adic mathematical physics: the first 30 years
This page was built for publication: Clustering by hypergraphs and dimensionality of cluster systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359396)