default search action
Léonard Kwuida
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c21]Léonard Kwuida
, Etienne Romuald Temgoua Alomo
Subdirectly Irreducible and Semisimple Double Boolean Algebras. CONCEPTS 2024: 3-19 - [c20]Martin Waffo Kemgne, Blaise Blériot Koguep Njionou, Léonard Kwuida, Dmitry I. Ignatov:
Shapley Values in Classification Problems with Triadic Formal Concept Analysis. CONCEPTS 2024: 83-96 - 2023
- [j13]Léonard Kwuida
On Nontrivial Weak Dicomplementations and the Lattice Congruences that Preserve Them. Order 40(2): 423-453 (2023) - [c19]Gaël Nguepy Dongmo
Rough Fuzzy Concept Analysis via Multilattice. IJCRS 2023: 495-508 - 2022
- [j12]Rokia Missaoui, Pedro H. B. Ruas
Computing triadic generators and association rules from triadic contexts. Ann. Math. Artif. Intell. 90(11-12): 1083-1105 (2022) - [j11]Dmitry I. Ignatov
On Shapley value interpretability in concept-based learning with formal concept analysis. Ann. Math. Artif. Intell. 90(11-12): 1197-1222 (2022) - [j10]Blaise Blériot Koguep Njionou, Léonard Kwuida
Formal Concepts and Residuation on Multilattices. Fundam. Informaticae 188(4): 217-237 (2022) - [p1]Léonard Kwuida
Formal Concept Analysis and Extensions for Complex Data Analytics. Complex Data Analytics with Formal Concept Analysis 2022: 1-15 - [e3]Rokia Missaoui, Léonard Kwuida, Talel Abdessalem:
Complex Data Analytics with Formal Concept Analysis. Springer International Publishing 2022, ISBN 978-3-030-93278-7 [contents] - 2021
- [c18]Pedro H. B. Ruas, Rokia Missaoui, Mark A. J. Song, Léonard Kwuida:
Mining the Groceries Database using Triadic Concept Analysis. RealDataFCA@ICFCA 2021: 36-43 - [c17]Tenkeu Jeufack Yannick Léa, Etienne Romuald Alomo Temgoua, Léonard Kwuida
Filters, Ideals and Congruences on Double Boolean Algebras. ICFCA 2021: 270-280 - [i3]Léonard Kwuida, Dmitry I. Ignatov:
On Interpretability and Similarity in Concept-Based Machine Learning. CoRR abs/2102.12723 (2021) - 2020
- [j9]Léonard Kwuida
On the size of ∃-generalized concept lattices. Discret. Appl. Math. 273: 205-216 (2020) - [j8]George Georgescu, Léonard Kwuida, Claudia Muresan:
Functorial Properties of the Reticulation of a Universal Algebra. FLAP 8(5): 1123-1168 (2020) - [c16]Léonard Kwuida
On Interpretability and Similarity in Concept-Based Machine Learning. AIST 2020: 28-54 - [c15]Dmitry I. Ignatov, Léonard Kwuida:
Shapley and Banzhaf Vectors of a Formal Concept. CLA 2020: 259-271 - [c14]Dmitry I. Ignatov, Léonard Kwuida
Interpretable Concept-Based Classification with Shapley Values. ICCS 2020: 90-102 - [c13]Rokia Missaoui, Pedro H. B. Ruas, Léonard Kwuida
Pattern Discovery in Triadic Contexts. ICCS 2020: 117-131
2010 – 2019
- 2019
- [e2]Diana Cristea, Florence Le Ber, Rokia Missaoui, Léonard Kwuida, Baris Sertkaya:
Supplementary Proceedings of ICFCA 2019 Conference and Workshops, Frankfurt, Germany, June 25-28, 2019. CEUR Workshop Proceedings 2378, CEUR-WS.org 2019 [contents] - 2018
- [j7]Léonard Kwuida
A single axiom for Boolean algebras. Discret. Appl. Math. 249: 85-90 (2018) - [c12]Rostand S. Kuitché, Romuald E. A. Temgoua, Léonard Kwuida:
A Similarity Measure to Generalize Attributes. CLA 2018: 141-152 - [c11]Abdélilah Balamane, Rokia Missaoui, Léonard Kwuida, Jean Vaillancourt:
Découverte de biclusters avec présence ou absence de propriétés. EDA 2018: 211-226 - 2017
- [j6]Ivo Düntsch
A Discrete Representation for Dicomplemented Lattices. Fundam. Informaticae 156(3-4): 281-295 (2017) - 2016
- [c10]Abdélilah Balamane, Rokia Missaoui, Léonard Kwuida
Descriptive group detection in two-mode data networks using biclustering. ASONAM 2016: 744-749 - 2014
- [j5]Léonard Kwuida
Generalized pattern extraction from concept lattices. Ann. Math. Artif. Intell. 72(1-2): 151-168 (2014) - 2012
- [c9]Léonard Kwuida, Rokia Missaoui, Jean Vaillancourt:
Using Taxonomies on Objects and Attributes to Discover Generalized Patterns. CLA 2012: 327-338 - 2011
- [j4]Léonard Kwuida
Valuations and closure operators on finite lattices. Discret. Appl. Math. 159(10): 990-1001 (2011) - [j3]Léonard Kwuida
On the Homomorphism Order of Labeled Posets. Order 28(2): 251-265 (2011) - [c8]Rokia Missaoui, Léonard Kwuida
Mining Triadic Association Rules from Ternary Relations. ICFCA 2011: 204-218 - 2010
- [j2]Léonard Kwuida
On the isomorphism problem of concept algebras. Ann. Math. Artif. Intell. 59(2): 223-239 (2010) - [c7]Léonard Kwuida, Rokia Missaoui, Beligh Ben Amor, Lahcen Boumedjout, Jean Vaillancourt:
Restrictions on Concept Lattices for Pattern Management. CLA 2010: 235-246 - [e1]Léonard Kwuida
Formal Concept Analysis, 8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010. Proceedings. Lecture Notes in Computer Science 5986, Springer 2010, ISBN 978-3-642-11927-9 [contents]
2000 – 2009
- 2009
- [c6]Rokia Missaoui, Léonard Kwuida
What Can Formal Concept Analysis Do for Data Warehouses?. ICFCA 2009: 58-65 - [i2]Rokia Missaoui, Léonard Kwuida, Mohamed Quafafou, Jean Vaillancourt:
Algebraic operators for querying pattern bases. CoRR abs/0902.4042 (2009) - [i1]Léonard Kwuida, Rokia Missaoui, Lahcen Boumedjout, Jean Vaillancourt:
Mining Generalized Patterns from Large Databases using Ontologies. CoRR abs/0905.4713 (2009) - 2007
- [c5]Léonard Kwuida
On the MacNeille Completion of Weakly Dicomplemented Lattices. ICFCA 2007: 271-280 - 2006
- [j1]Bernhard Ganter, Léonard Kwuida
Finite Distributive Concept Algebras. Order 23(2-3): 235-248 (2006) - [c4]Léonard Kwuida
A Note on Negation: A PCS-Completion of Semilattices. ICFCA 2006: 146-160 - 2005
- [c3]Bernhard Ganter, Léonard Kwuida
Which Concept Lattices Are Pseudocomplemented?. ICFCA 2005: 408-416 - 2004
- [c2]Léonard Kwuida
Negation in Contextual Logic. ICCS 2004: 227-241 - [c1]Léonard Kwuida
When Is a Concept Algebra Boolean? ICFCA 2004: 142-155
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 17:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: