Clustering by hypergraphs and dimensionality of cluster systems
From MaRDI portal
Publication:359396
DOI10.1134/S2070046612030016zbMATH Open1269.05081arXiv1204.5952OpenAlexW2079680825MaRDI QIDQ359396FDOQ359396
Publication date: 12 August 2013
Published in: \(p\)-Adic Numbers, Ultrametric Analysis, and Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1204.5952
Cites Work
Cited In (14)
- Clustering Using Cyclic Spaces of Reversible Cellular Automata
- Ultrametricity in the theory of complex systems
- Clustering in Hypergraphs to Minimize Average Edge Service Time
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(p\)-adic mathematical physics: the first 30 years
- Cluster adjacency beyond MHV
- Cluster networks and Bruhat-Tits buildings
- Motif and Hypergraph Correlation Clustering
- Watersheds on Hypergraphs for Data Clustering
- Parsimonious cluster systems
- The abstract Laplacian tensor of a hypergraph with applications in clustering
- Title not available (Why is that?)
- From hypertrees to arboreal quasi-ultrametrics
Recommendations
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)