Zobrazeno 1 - 10
of 1 035
pro vyhledávání: '"Koudijs A"'
Research on knowledge graph embeddings has recently evolved into knowledge base embeddings, where the goal is not only to map facts into vector spaces but also constrain the models so that they take into account the relevant conceptual knowledge avai
Externí odkaz:
http://arxiv.org/abs/2408.04913
We investigate an approach for extracting knowledge from trained neural networks based on Angluin's exact learning model with membership and equivalence queries to an oracle. In this approach, the oracle is a trained neural network. We consider Anglu
Externí odkaz:
http://arxiv.org/abs/2305.12143
Autor:
Cate, Balder ten, Koudijs, Raoul
We study the existence of finite characterisations for modal formulas. A finite characterisation of a modal formula $\varphi$ is a finite collection of positive and negative examples that distinguishes $\varphi$ from every other, non-equivalent modal
Externí odkaz:
http://arxiv.org/abs/2304.06646
Autor:
Judith M. Boer, Uri Ilan, Aurélie Boeree, Karin P. S. Langenberg, Jan Koster, Marco J. Koudijs, Jayne Y. Hehir‐Kwa, Stefan Nierkens, Corinne Rossi, Jan J. Molenaar, Bianca F. Goemans, Monique L. denBoer, C. Michel Zwaan
Publikováno v:
HemaSphere, Vol 8, Iss 7, Pp n/a-n/a (2024)
Abstract Over the past 10 years, institutional and national molecular tumor boards have been implemented for relapsed or refractory pediatric cancer to prioritize targeted drugs for individualized treatment based on actionable oncogenic lesions, incl
Externí odkaz:
https://doaj.org/article/cc8777c8974245468114f51e19691ae4
Autor:
Cate, Balder ten, Koudijs, Raoul
We initiate the study of finite characterizations and exact learnability of modal languages. A finite characterization of a modal formula w.r.t. a set of formulas is a finite set of finite models (labelled either positive or negative) which distingui
Externí odkaz:
http://arxiv.org/abs/2206.06049
We study LFD, a base logic of functional dependence introduced by Baltag and van Benthem (2021) and its connections with the guarded fragment GF of first-order logic. Like other logics of dependence, the semantics of LFD uses teams: sets of permissib
Externí odkaz:
http://arxiv.org/abs/2206.06046
Autor:
Bakhuizen, Jette J, van Dijk, Freerk, Koudijs, Marco J, Bladergroen, Reno S, Bon, Sebastian B B, Hopman, Saskia M J, Kester, Lennart A, Kranendonk, Mariëtte E G, Loeffen, Jan L C, Smetsers, Stephanie E, Sonneveld, Edwin, Tachdjian, Melissa, de Vos-Kerkhof, Evelien, Goudie, Catherine, Merks, Johannes H M, Kuiper, Roland P, Jongmans, Marjolijn C J *
Publikováno v:
In The Lancet Child & Adolescent Health October 2024 8(10):751-761
Autor:
Hogervorst, F.B.L., van Leeuwen, F.E., Adank, M.A., Schmidt, M.K., Stommel-Jenner, D.J., de Groot, R., Vieveen, E., Collée, J.M., Geurts-Giele, W., Heemskerk-Gerritsen, B.A.M., Hooning, M.J., Boere, I.A., van Asperen, C.J., Devilee, P., van der Luijt, R.B., Wevers, M.R., Mensenkamp, A.R., de Hullu, J.A., Ausems, M.G.E.M., Koudijs, M.J., Koole, W., van Engelen, K., Gille, J.J.P., Gómez García, E.B., Blok, M.J., Berger, L.P.V., van der Hout, A.H., de Bock, G.H., Yigit, R., Siesling, S., Verloop, J., Voorham, Q.J.M., Schreurs, Maartje A.C., Schmidt, Marjanka K., Hollestelle, Antoinette, Schaapveld, Michael, van Asperen, Christi J., Ausems, Margreet G.E.M., van de Beek, Irma, Broekema, Marjoleine F., Margriet Collée, J., van der Hout, Annemieke H., van Kaam, Kim J.A.F., Komdeur, Fenne L., Mensenkamp, Arjen R., Adank, Muriel A., Hooning, Maartje J.
Publikováno v:
In Genetics in Medicine September 2024 26(9)
Publikováno v:
In International Journal of Approximate Reasoning August 2024 171
Autor:
Koudijs, Raoul
Publikováno v:
EPTCS 346, 2021, pp. 166-178
Recently, Baltag and van Benthem introduced a decidable logic of functional dependence (LFD) that extends the logic of Cylindrical Relativized Set Algebras (CRS) with atomic local dependence statements. Its semantics can be given in terms of generali
Externí odkaz:
http://arxiv.org/abs/2109.08313