Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Tîrnăucă, Cristina"'
Autor:
Tirnauca, Cristina
Publikováno v:
TDX (Tesis Doctorals en Xarxa).
In the field of grammatical inference, the goal of any learning algorithm is to identify a target concept from a given class by having access to a specific type of information. The main learning settings are Gold's model of learning in the limit and
Externí odkaz:
http://hdl.handle.net/10803/8792
Autor:
Sánchez-Rodríguez, Antonio, Tirnauca, Cristina, Salas-Gómez, Diana, Fernández-Gorgojo, Mario, Martínez-Rodríguez, Isabel, Sierra, María, González-Aramburu, Isabel, Stan, Diana, Gutierrez-González, Angela, Meissner, Johannes M., Andrés-Pacheco, Javier, Rivera-Sánchez, María, Sánchez-Peláez, María Victoria, Sánchez-Juan, Pascual, Infante, Jon
Publikováno v:
In Parkinsonism and Related Disorders May 2022 98:21-26
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
A definite Horn theory is a set of n-dimensional Boolean vectors whose characteristic function is expressible as a definite Horn formula, that is, as conjunction of definite Horn clauses. The class of definite Horn theories is known to be learnable u
Externí odkaz:
http://arxiv.org/abs/1503.09025
Autor:
Tîrnăucă, Cristina1 (AUTHOR) cristina.tirnauca@unican.es, Stan, Diana1 (AUTHOR), Meissner, Johannes Mario2 (AUTHOR), Salas-Gómez, Diana3 (AUTHOR), Fernández-Gorgojo, Mario3 (AUTHOR), Infante, Jon4,5,6 (AUTHOR)
Publikováno v:
Mathematics (2227-7390). Oct2022, Vol. 10 Issue 19, p3500. 25p.
Autor:
Homocianu, Daniel1 (AUTHOR) daniel.homocianu@uaic.ro, Tîrnăucă, Cristina2 (AUTHOR)
Publikováno v:
Axioms (2075-1680). Oct2022, Vol. 11 Issue 10, pN.PAG-N.PAG. 23p.
Publikováno v:
Revue des Nouvelles Technologies de l'Information RNTI-E-20 (2011), pages 635-646
The output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the "essential" or "representative" rules. We revisit the algorithm given by Kryszkiewicz (Int. Symp.
Externí odkaz:
http://arxiv.org/abs/1012.0735
Autor:
Balcázar, José L., Tîrnăucă, Cristina
The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into a distrib
Externí odkaz:
http://arxiv.org/abs/1012.0742
Publikováno v:
In Information Sciences May 2018 439-440:79-94
Publikováno v:
In Expert Systems With Applications 15 September 2016 57:76-90