| Filters, Ideals and Congruences on Double Boolean Algebras. | 0 | 0.34 | 2021 |
| On the size of ∃-generalized concept lattices | 0 | 0.34 | 2020 |
| Interpretable Concept-Based Classification with Shapley Values. | 0 | 0.34 | 2020 |
| Pattern Discovery in Triadic Contexts. | 0 | 0.34 | 2020 |
| On Interpretability and Similarity in Concept-Based Machine Learning | 0 | 0.34 | 2020 |
| A single axiom for Boolean algebras. | 0 | 0.34 | 2018 |
| Découverte de biclusters avec présence ou absence de propriétés. | 0 | 0.34 | 2018 |
| A Similarity Measure to Generalize Attributes. | 0 | 0.34 | 2018 |
| A Discrete Representation for Dicomplemented Lattices. | 2 | 0.37 | 2017 |
| Descriptive group detection in two-mode data networks using biclustering. | 0 | 0.34 | 2016 |
| Generalized pattern extraction from concept lattices | 0 | 0.34 | 2014 |
| Using Taxonomies on Objects and Attributes to Discover Generalized Patterns. | 1 | 0.35 | 2012 |
| Mining triadic association rules from ternary relations | 8 | 0.48 | 2011 |
| On the Homomorphism Order of Labeled Posets | 5 | 0.53 | 2011 |
| Valuations and closure operators on finite lattices | 1 | 0.36 | 2011 |
| Formal Concept Analysis, 8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010. Proceedings | 20 | 6.69 | 2010 |
| On the isomorphism problem of concept algebras | 2 | 0.42 | 2010 |
| Restrictions on Concept Lattices for Pattern Management. | 7 | 0.56 | 2010 |
| What Can Formal Concept Analysis Do for Data Warehouses? | 2 | 0.41 | 2009 |
| Algebraic operators for querying pattern bases | 4 | 0.49 | 2009 |
| Mining Generalized Patterns from Large Databases using Ontologies | 0 | 0.34 | 2009 |
| On the MacNeille completion of weakly dicomplemented lattices | 1 | 0.43 | 2007 |
| Finite Distributive Concept Algebras | 1 | 0.37 | 2006 |
| A note on negation: a PCS-Completion of semilattices | 0 | 0.34 | 2006 |
| Which concept lattices are pseudocomplemented? | 1 | 0.39 | 2005 |
| When Is a Concept Algebra Boolean? | 0 | 0.34 | 2004 |
