| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
|
Szathmary, Laszlo
|
|
2013
|
70 |
1-2 |
p. 81-105
|
artikel
|
| 2 |
Biclustering meets triadic concept analysis
|
Kaytoue, Mehdi
|
|
2013
|
70 |
1-2 |
p. 55-79
|
artikel
|
| 3 |
Boolean factors as a means of clustering of interestingness measures of association rules
|
Belohlavek, Radim
|
|
2013
|
70 |
1-2 |
p. 151-184
|
artikel
|
| 4 |
Combining formal concept analysis and translation to assign frames and semantic role sets to French verbs
|
Falk, Ingrid
|
|
2013
|
70 |
1-2 |
p. 123-150
|
artikel
|
| 5 |
Fast algorithms for implication bases and attribute exploration using proper premises
|
Ryssel, Uwe
|
|
2013
|
70 |
1-2 |
p. 25-53
|
artikel
|
| 6 |
Optimizations in computing the Duquenne–Guigues basis of implications
|
Bazhanov, Konstantin
|
|
2013
|
70 |
1-2 |
p. 5-24
|
artikel
|
| 7 |
Preface to the special issue on “Concept Lattice and their Applications” (CLA-2011)
|
Napoli, Amedeo
|
|
2013
|
70 |
1-2 |
p. 1-3
|
artikel
|
| 8 |
Recursive decomposition tree of a Moore co-family and closure algorithm
|
Colomb, Pierre
|
|
2013
|
70 |
1-2 |
p. 107-122
|
artikel
|
Tijdschrift beschrijving