Clustering by hypergraphs and dimensionality of cluster systems

Details Clustering by hypergraphs and dimensionality of cluster systems Clustering by hypergraphs and dimensionality of cluster systems

2012-04-26

arxiv.org/abs/1204.5952v1

Computer Science

Data Structures and Algorithms

15 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Clustering by hypergraphs and dimensionality of cluster systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clustering by hypergraphs and dimensionality of cluster systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering by hypergraphs and dimensionality of cluster systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-314713