Zobrazeno 1 - 10
of 197
pro vyhledávání: '"Miguel Couceiro"'
Autor:
Gregoire Preud’homme, Kevin Duarte, Kevin Dalleau, Claire Lacomblez, Emmanuel Bresso, Malika Smaïl-Tabbone, Miguel Couceiro, Marie-Dominique Devignes, Masatake Kobayashi, Olivier Huttin, João Pedro Ferreira, Faiez Zannad, Patrick Rossignol, Nicolas Girerd
Publikováno v:
Scientific Reports, Vol 11, Iss 1, Pp 1-14 (2021)
Abstract The choice of the most appropriate unsupervised machine-learning method for “heterogeneous” or “mixed” data, i.e. with both continuous and categorical variables, can be challenging. Our aim was to examine the performance of various c
Externí odkaz:
https://doaj.org/article/26646d58a34f4588aac72200ad772731
Autor:
Jean-Luc Marichal, Miguel Couceiro
Publikováno v:
Axioms, Vol 2, Iss 3, Pp 390-403 (2013)
It is known that several discrete integrals, including the Choquet and Sugeno integrals, as well as some of their generalizations, are comonotonically modular functions. Based on a recent description of the class of comonotonically modular functions,
Externí odkaz:
https://doaj.org/article/6b14e55893c24221b4effee33b98cb9c
Autor:
Miguel Couceiro, Dwight Duffus
Publikováno v:
Order.
Publikováno v:
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning, 2022, 142, pp.370-382. ⟨10.1016/j.ijar.2021.12.011⟩
International Journal of Approximate Reasoning, 2022, 142, pp.370-382. ⟨10.1016/j.ijar.2021.12.011⟩
International audience; In this paper, we study structures such as distributive lattices, distributive semilattices, and median graphs from an algorithmic point of view. Such structures are very useful in classification and phylogeny for representing
Publikováno v:
NLPIR 2022-6th International Conference on Natural Language Processing and Information Retrieval
NLPIR 2022-6th International Conference on Natural Language Processing and Information Retrieval, Dec 2022, Bangkok, Thailand
HAL
NLPIR 2022-6th International Conference on Natural Language Processing and Information Retrieval, Dec 2022, Bangkok, Thailand
HAL
International audience; Contextualized language models have emerged as a de facto standard in natural language processing due to the vast amount of knowledge they acquire during pretraining. Nonetheless, their ability to solve tasks that require reas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5a1b8902e8877bfdcb2bb4f1a2d65074
https://inria.hal.science/hal-03792071
https://inria.hal.science/hal-03792071
Autor:
Paulo Fonte, Luís Lopes, Rui Alves, Nuno Carolino, Paulo Crespo, Miguel Couceiro, Orlando Cunha, Nuno Dias, Nuno C. Ferreira, Susete Fetal, Ana L. Lopes, Jan Michel, Jorge Moreira, Américo Pereira, João Saraiva, Carlos Silva, Magda Silva, Michael Traxler, Antero Abrunhosa, Alberto Blanco, Miguel Castelo-Branco, Mário Pimenta
We present first results from a Positron Emission Tomography (PET) scanner demonstrator based on Resistive Plate Chambers and specialized for brain imaging. The device features a 30 cm wide cubic field-of-view and each detector comprises 40 gas gaps
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19d60688664e0fa695f890bdfa0b971e
http://arxiv.org/abs/2211.05860
http://arxiv.org/abs/2211.05860
Autor:
Miguel Couceiro, Erkko Lehtonen
Publikováno v:
Annals of Mathematics and Artificial Intelligence (AMAI)
Annals of Mathematics and Artificial Intelligence (AMAI), In press, ⟨10.1007/s10472-023-09833-6⟩
Annals of Mathematics and Artificial Intelligence (AMAI), In press, ⟨10.1007/s10472-023-09833-6⟩
Analogical proportions are 4-ary relations that read "A is to B as C is to D". Recent works have highlighted the fact that such relations can support a specific form of inference, called analogical inference. This inference mechanism was empirically
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb090a98fcbdc70a046d5eeac65dcfc3
https://hal.inria.fr/hal-03665625/file/ArxivVersion.pdf
https://hal.inria.fr/hal-03665625/file/ArxivVersion.pdf
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2020, 813, pp.341-361. ⟨10.1016/j.tcs.2020.01.009⟩
Theoretical Computer Science, 2020, 813, pp.341-361. ⟨10.1016/j.tcs.2020.01.009⟩
Theoretical Computer Science, Elsevier, 2020, 813, pp.341-361. ⟨10.1016/j.tcs.2020.01.009⟩
Theoretical Computer Science, 2020, 813, pp.341-361. ⟨10.1016/j.tcs.2020.01.009⟩
International audience; A normal form system (NFS) for representing Boolean functions is thought of as a set of stratified terms over a fixed set of connectives. For a fixed NFS A, the complexity of a Boolean function f with respect to A is the minim
Publikováno v:
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning, 2022, 142, pp.338-348. ⟨10.1016/j.ijar.2021.12.007⟩
International Journal of Approximate Reasoning, 2022, 142, pp.338-348. ⟨10.1016/j.ijar.2021.12.007⟩
International audience; Efficiently discovering causal relations from data and representing them in a way that facilitates their use is an important problem in science that has received much attention. In this paper, we propose an adaptation of the F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e456a07d560c1feeca984573e3b512b2
https://hal.science/hal-03183755v2/document
https://hal.science/hal-03183755v2/document
Publikováno v:
Complex Data Analysis with Formal Concept Analysis
Rokia Missaoui, Leonard Kwuida, Talel Abdessalem. Complex Data Analysis with Formal Concept Analysis, Springer, inPress, Complex Data Analysis with Formal Concept Analysis
HAL
Complex Data Analytics with Formal Concept Analysis ISBN: 9783030932770
Rokia Missaoui, Leonard Kwuida, Talel Abdessalem. Complex Data Analysis with Formal Concept Analysis, Springer, inPress, Complex Data Analysis with Formal Concept Analysis
HAL
Complex Data Analytics with Formal Concept Analysis ISBN: 9783030932770
International audience; It is known that a distributive lattice is a median graph, and that a distributive ∨-semilattice can be thought of as a median graph iff every triple of elements such that the infimum of each couple of its elements exists, h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63313d09579abdcbb15d58b5471600f0
https://inria.hal.science/hal-03537989/document
https://inria.hal.science/hal-03537989/document