VizEq can visualize equivalence classes. The goal of this tool is to show the eq. classes of small examples.1


Usage: ./  [switches]  <database>  <min_supp>  [-alg:<alg>]

   -stat                           stop after printing statistics at the beginning
   -uc                             show attribute names in uppercase
   -notrans                        don't show transitive connections among equivalence classes
   -bt                             show figure from bottom to top (default: top to bottom)
                                   can be used in the case of .bool and .rcf files

Algorithms available:
   Zart                            default

   database                        database file
   min_supp                        minimum support, a) integer or b) double followed by '%'
                                      example: 2 or 20% or 1.75%
   alg                             the algorithm to use for itemset extraction


Example 1 (a simple one)

./ sample/laszlo.rcf 1

GraphViz .dot representation of the equivalence classes is written to ./graphviz/

Steps to follow:

  • cd graphviz/
  • ./
  • ./

Result (click for full size):

As you can see, concepts with the same support are at the same level.

Let's see the concept in the top left hand corner. Meaning: the closed itemset ABDE has support 1. It has one generator, D. Now consider the concept in the center: AC is a closed itemset with support 3. Its generator is itself, so AC is not repeated. It means that the eq. class of AC is a singleton class.

Example 2 (removing transitive relations)

If you have a larger context then it is a good idea to remove the transitive relations:

./ sample/laszlo.rcf 1 -uc -notrans

The switch -uc will print attribute names in uppercase which is more readable in my opinion.

Result (click for full size):

Example 3 (upside down)

You can turn the order of concepts upside down with the -bt (bottom to top) option:

./ sample/laszlo.rcf 1 -uc -notrans -bt

Result (click for full size):

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License