Partition distances

Details Partition distances Partition distances

2011-06-22

arxiv.org/abs/1106.4579v1

Computer Science

Discrete Mathematics

22 pages

Scientific paper

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to modular elements of the partition lattice, as well as in terms of suitable classifiers. Two of the new measures obtain through the size, a function mapping every partition into the number of atoms finer than that partition. One of these size-based distances extends to geometric lattices the traditional Hamming distance between subsets, when these latter are regarded as hypercube vertexes or binary n-vectors. After carefully framing the environment, a main comparison finally results from the following bounding problem: for every value k, with 0

Affiliated with

Also associated with

No associations

Rating

Partition distances 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 Partition distances, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partition distances will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-469022