Léonard Kwuida

Orcid: 0000-0002-9811-0747

According to our database1, Léonard Kwuida authored at least 37 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Subdirectly Irreducible and Semisimple Double Boolean Algebras.
Proceedings of the Conceptual Knowledge Structures - First International Joint Conference, 2024

Shapley Values in Classification Problems with Triadic Formal Concept Analysis.
Proceedings of the Conceptual Knowledge Structures - First International Joint Conference, 2024

2023
On Nontrivial Weak Dicomplementations and the Lattice Congruences that Preserve Them.
Order, July, 2023

Rough Fuzzy Concept Analysis via Multilattice.
Proceedings of the Rough Sets - International Joint Conference, 2023

2022
Formal Concepts and Residuation on Multilattices.
Fundam. Informaticae, 2022

Computing triadic generators and association rules from triadic contexts.
Ann. Math. Artif. Intell., 2022

On Shapley value interpretability in concept-based learning with formal concept analysis.
Ann. Math. Artif. Intell., 2022

Formal Concept Analysis and Extensions for Complex Data Analytics.
Proceedings of the Complex Data Analytics with Formal Concept Analysis, 2022

2021
Mining the Groceries Database using Triadic Concept Analysis.
Proceedings of the Workshop Analyzing Real Data with Formal Concept Analysis co-located with 16th International Conference on Formal Concept Analysis (ICFCA 2021), 2021

Filters, Ideals and Congruences on Double Boolean Algebras.
Proceedings of the Formal Concept Analysis - 16th International Conference, 2021

2020
Functorial Properties of the Reticulation of a Universal Algebra.
FLAP, 2020

On the size of ∃-generalized concept lattices.
Discret. Appl. Math., 2020

Pattern Discovery in Triadic Contexts.
Proceedings of the Ontologies and Concepts in Mind and Machine, 2020

Interpretable Concept-Based Classification with Shapley Values.
Proceedings of the Ontologies and Concepts in Mind and Machine, 2020

Shapley and Banzhaf Vectors of a Formal Concept.
Proceedings of the Fifthteenth International Conference on Concept Lattices and Their Applications, 2020

On Interpretability and Similarity in Concept-Based Machine Learning.
Proceedings of the Analysis of Images, Social Networks and Texts, 2020

2018
A single axiom for Boolean algebras.
Discret. Appl. Math., 2018

Découverte de biclusters avec présence ou absence de propriétés.
Proceedings of the Business Intelligence & Big Data, 2018

A Similarity Measure to Generalize Attributes.
Proceedings of the Fourteenth International Conference on Concept Lattices and Their Applications, 2018

2017
A Discrete Representation for Dicomplemented Lattices.
Fundam. Informaticae, 2017

2016
Descriptive group detection in two-mode data networks using biclustering.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2014
Generalized pattern extraction from concept lattices.
Ann. Math. Artif. Intell., 2014

2012
Using Taxonomies on Objects and Attributes to Discover Generalized Patterns.
Proceedings of The Ninth International Conference on Concept Lattices and Their Applications, 2012

2011
On the Homomorphism Order of Labeled Posets.
Order, 2011

Valuations and closure operators on finite lattices.
Discret. Appl. Math., 2011

Mining Triadic Association Rules from Ternary Relations.
Proceedings of the Formal Concept Analysis - 9th International Conference, 2011

2010
On the isomorphism problem of concept algebras.
Ann. Math. Artif. Intell., 2010

Restrictions on Concept Lattices for Pattern Management.
Proceedings of the 7th International Conference on Concept Lattices and Their Applications, 2010

2009
Mining Generalized Patterns from Large Databases using Ontologies
CoRR, 2009

Algebraic operators for querying pattern bases
CoRR, 2009

What Can Formal Concept Analysis Do for Data Warehouses?.
Proceedings of the Formal Concept Analysis, 7th International Conference, 2009

2007
On the MacNeille Completion of Weakly Dicomplemented Lattices.
Proceedings of the Formal Concept Analysis, 5th International Conference, 2007

2006
Finite Distributive Concept Algebras.
Order, 2006

A Note on Negation: A PCS-Completion of Semilattices.
Proceedings of the Formal Concept Analysis, 4th International Conference, 2006

2005
Which Concept Lattices Are Pseudocomplemented?.
Proceedings of the Formal Concept Analysis, Third International Conference, 2005

2004
When Is a Concept Algebra Boolean?
Proceedings of the Concept Lattices, 2004

Negation in Contextual Logic.
Proceedings of the Conceptual Structures at Work: 12th International Conference on Conceptual Structures, 2004


  Loading...