Volume 70, Issue 1-2

February 2014

Special Issue: “Concept Lattices and their Applications” (selected papers from CLA-2011)”

Issue Editor:

8 articles in this issue

Preface to the special issue on “Concept Lattice and their Applications” (CLA-2011)
Amedeo Napoli
EditorialNotes 16 November 2013 Pages: 1 - 3
Optimizations in computing the Duquenne–Guigues basis of implications
Konstantin Bazhanov
Sergei Obiedkov
OriginalPaper 09 May 2013 Pages: 5 - 24
Fast algorithms for implication bases and attribute exploration using proper premises
Uwe Ryssel
Felix Distel
Daniel Borchmann
OriginalPaper 25 May 2013 Pages: 25 - 53
Biclustering meets triadic concept analysis
Mehdi Kaytoue
Sergei O. Kuznetsov
Amedeo Napoli
OriginalPaper 06 September 2013 Pages: 55 - 79
A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
Laszlo Szathmary
Petko Valtchev
Vladimir Makarenkov
OriginalPaper 07 August 2013 Pages: 81 - 105
Recursive decomposition tree of a Moore co-family and closure algorithm
Pierre Colomb
Alexis Irlande
Yoan Renaud
OriginalPaper 07 June 2013 Pages: 107 - 122
Combining formal concept analysis and translation to assign frames and semantic role sets to French verbs
Ingrid Falk
Claire Gardent
OriginalPaper 18 August 2013 Pages: 123 - 150
Boolean factors as a means of clustering of interestingness measures of association rules
Radim Belohlavek
Dhouha Grissa
Jan Outrata
OriginalPaper 02 August 2013 Pages: 151 - 184

Search