Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Léonard Kwuida"'
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 90:1083-1105
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8d485149299bb1fe696543da2d75cd6
https://doi.org/10.1007/s10472-022-09784-4
https://doi.org/10.1007/s10472-022-09784-4
Publikováno v:
Discrete Applied Mathematics. 273:205-216
Formal Concept Analysis (FCA) offers several tools for qualitative data analysis. One possibility is to group objects that share common attributes together and get a concept lattice that describes the data. Quite often the size of this concept lattic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ddc6640264d7c597363d3a66903a5408
https://doi.org/10.1016/j.dam.2019.02.035
https://doi.org/10.1016/j.dam.2019.02.035
Autor:
Léonard Kwuida, Rokia Missaoui
Publikováno v:
Complex Data Analytics with Formal Concept Analysis ISBN: 9783030932770
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fa6da9db54cac1c22002aff21edef36
https://doi.org/10.1007/978-3-030-93278-7_1
https://doi.org/10.1007/978-3-030-93278-7_1
Autor:
Dmitry I. Ignatov, Léonard Kwuida
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030726096
AIST
AIST
Machine Learning (ML) provides important techniques for classification and predictions. Most of these are black-box models for users and do not provide decision-makers with an explanation. For the sake of transparency or more validity of decisions, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fca31012e98043945252721ea755154a
https://doi.org/10.1007/978-3-030-72610-2_3
https://doi.org/10.1007/978-3-030-72610-2_3
Publikováno v:
Formal Concept Analysis ISBN: 9783030778668
ICFCA
ICFCA
Double Boolean algebras (dBas) are algebras \(\underline{D}:=(D;\sqcap ,\)\(\sqcup ,\lnot ,\lrcorner ,\bot ,\top )\) of type (2, 2, 1, 1, 0, 0), introduced by R. Wille to capture the equational theory of the algebra of protoconcepts. Boolean algebras
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de965a54ef47bbdbe6671acb80a69557
https://doi.org/10.1007/978-3-030-77867-5_18
https://doi.org/10.1007/978-3-030-77867-5_18
Publikováno v:
Ontologies and Concepts in Mind and Machine ISBN: 9783030578541
ICCS
ICCS
Many real-life applications are best represented as ternary and more generally n-ary relations. In this paper, we use Triadic Concept Analysis as a framework to mainly discover implications. Indeed, our contributions are as follows. First, we adapt t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::000e53380cd0d6a727fc35b75f7bff99
https://doi.org/10.1007/978-3-030-57855-8_9
https://doi.org/10.1007/978-3-030-57855-8_9
Autor:
Léonard Kwuida, Dmitry I. Ignatov
Publikováno v:
Ontologies and Concepts in Mind and Machine ISBN: 9783030578541
ICCS
ICCS
Among the family of rule-based classification models, there are classifiers based on conjunctions of binary attributes. For example, JSM-method of automatic reasoning (named after John Stuart Mill) was formulated as a classification technique in term
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38743137cadb691fd43f918d8f365dad
https://doi.org/10.1007/978-3-030-57855-8_7
https://doi.org/10.1007/978-3-030-57855-8_7
Autor:
Léonard Kwuida
Publikováno v:
Discrete Applied Mathematics. 249:85-90
We prove that an algebra ( L , ∧ , ∨ , ′ ) of type ( 2 , 2 , 1 ) is a Boolean algebra iff ( L , ∧ , ∨ ) is a non empty lattice that satisfies the equation ( ‡ ) ( x ∧ y ) ∨ ( x ∧ y ′ ) = ( x ∨ y ) ∧ ( x ∨ y ′ ) .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77ad50effb2961db7869df1f5a2a809a
https://doi.org/10.1016/j.dam.2018.08.002
https://doi.org/10.1016/j.dam.2018.08.002
Publikováno v:
Fundamenta Informaticae. 156:281-295
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aaaa521dfa753141ce396be539f2f2ec
https://doi.org/10.3233/fi-2017-1609
https://doi.org/10.3233/fi-2017-1609
FCA is an important formalism that is associated with a variety of research areas such as lattice theory, knowledge representation, data mining, machine learning, and semantic Web. It is successfully exploited in an increasing number of application