pcbo - computes formal concepts and maximal frequent itemsets
This program computes intents of all formal concepts in an object-attribute data set (a formal context), i.e. the algorithm computes all maximal submatrices of a boolean matrix which are full of 1's. The program implements PCbO, a parallel algorithm based on Kuznetsov's CbO.
The INPUT-FILE is in the usual FIMI format: each line represents a transaction or an object and it contains of a list of attributes/features/items. If the INPUT-FILE is omitted or if it equals to `-', the program reads the input form the stdin. The OUTPUT-FILE has a similar format, each line represents one intent (itemset), where numbers indicate attributes in the intent (itemset). If the OUTPUT-FILE is omitted or if it equals to `-', the program writes the input to the stdout.
Computes all intents in the file named mushroom.dat where 1 denotes the first attribute in mushroom.dat. The output is written to the standard output.
pcbo -1 -P6 mushroom.dat
Computes all intents in mushroom.dat with first attribute 1 using 6 threads. The output is written to the standard output.
pcbo -P8 -L4 foo.dat output-intents.dat
Computes all intents in mushroom.dat with 8 threads using the initial stage recursion depth 4, and writing results to output-intents.dat.
pcbo -P4 -L3 -V2 - output.dat
Computes all intents in data from the standard input with 4 threads using the initial stage recursion depth 3, and verbosity level 2, writing result to output.dat.
Written by Petr Krajca, Jan Outrata, and Vilem Vychodil.
Report bugs to <email@example.com>.
GNU GPL 2 (http://www.gnu.org/licenses/gpl-2.0.html). This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law.
Users in academia are kindly asked to cite the following resources if the software is used to pursue any research activities which may result in publications:
Krajca P., Outrata J., Vychodil V.: Parallel Algorithm for
Computing Fixpoints of Galois Connections.
Annals of Mathematics and Artificial Intelligence 59(2)(2010), pp. 257–272.
DOI 10.1007/s10472–010–9199–5, ISSN 1012–2443 (paper), 1573–7470 (online)
Krajca P., Outrata J., Vychodil V.: Parallel Recursive Algorithm for FCA.
In: Belohlavek R., Kuznetsov S. O. (Eds.): Proc. CLA 2008, pp. 71–82.
CEUR WS, Vol. 433, ISBN 978–80–244–2111–7
The program can be obtained from http://fcalgs.sourceforge.net
Further information can be found at http://fcalgs.sourceforge.net