description

build a concept lattice. ADD_EXTENT algorithm builds the complete concept lattice. ICEBERG builds a lattice with only the top-most concepts of the concept lattice. . A bottom concept is added that groups remaining attributes (not introduced by a frequent concept extent) and transforms the semi-lattice into a lattice. Euclidian division is used in FCA4J: e.g. In Iceberg50,  the concepts have an extent whose cardinality is >= total object count * 50 /100, where / is Euclidian division

usage

java -jar fca4j-cli.jar LATTICE <input> [<output-file>] [options]

options

-a <ALGO>  

supported algorithms are:

    • ADD_EXTENT (default)
    • ICEBERG                    

 -p <PERCENT>

for ICEBERG: percentage (of extent) to keep the top-most concepts

 -i <INPUT-FORMAT>

supported formats are:

    • CXT (Burmeisters ConImp)
    • SLF (HTK Standard Latice Format)
    • XML (Galicia v3)
    • CEX (ConExp)
    • CSV (Comma separated values)

 -o <OUTPUT-FORMAT>

supported formats are:

    • XML (default)
    • JSON

 -g <DOTFILE>

.DOT output file for GraphViz

-d <DISPLAY-MODE>

display format of the concepts for GraphViz.

Available formats are:

    • FULL
    • SIMPLIFIED (default)
    • MINIMAL

 -m <IMPL>

supported implementations are:

    • BITSET (default)
    • HASHSET
    • KOLOBOKE_SET
    • TREESET
    • TROVE_HASHSET
    • COMPRESSED_BITSET
    • SPARSE_BITSET
    • INT_ARRAY
    • FASTUTIL_AVL_TREESET
    • FASTUTIL_RB_TREESET
    • HPPC_HASHSET
    • HPPC_BITSET
    • ARRAYLIST
    • BOOL_ARRAY

-s <SEPARATOR>

separator (CSV format only):

    • COMMA (default)
    • SEMICOLON
    • TAB

 -timeout <SECONDS>

set timeout for algorithm execution, in seconds

 -v,--verbose

print a final report of the algorithm execution