| Learning DFA from correction and equivalence queries L Becerra-Bonache, AH Dediu, C Tîrnăucă International Colloquium on Grammatical Inference, 281-292, 2006 | 40 | 2006 |
| Global optimality in k-means clustering C Tîrnăucă, D Gómez-Pérez, JL Balcázar, JL Montaña Information Sciences 439, 79-94, 2018 | 17 | 2018 |
| A note on the relationship between different types of correction queries C Tîrnăucă International Colloquium on Grammatical Inference, 213-223, 2008 | 16 | 2008 |
| Polynomial time algorithms for learning k-reversible languages and pattern languages with correction queries C Tîrnăucă, T Knuutila International Conference on Algorithmic Learning Theory, 272-284, 2007 | 12 | 2007 |
| The power of programmed grammars with graphs from various classes M Barbaiani, C Bibire, J Dassow, A Delaney, S Fazekas, M Ionescu, G Liu, ... Journal of Applied Mathematics and Computing 22 (1-2), 21-38, 2006 | 12* | 2006 |
| Learning DFA from corrections L Becerra-Bonache, C Bibire, AH Dediu Theoretical Aspects of Grammar Induction (TAGI), 1-12, 2005 | 10 | 2005 |
| Human Activity Recognition through Weighted Finite Automata S Salomón, C Tîrnăucă Multidisciplinary Digital Publishing Institute Proceedings 2 (19), 1263, 2018 | 8 | 2018 |
| Learning definite Horn formulas from closure queries M Arias, JL Balcázar, C Tîrnăucă Theoretical Computer Science 658, 346-356, 2017 | 7 | 2017 |
| Behavioral modeling based on probabilistic finite automata: An empirical study C Tîrnăucă, JL Montaña, S Ontañón, AJ González, LM Pardo Sensors 16 (7), 958, 2016 | 7 | 2016 |
| A characterization of the language classes learnable with correction queries C Tîrnăucă, S Kobayashi International Conference on Theory and Applications of Models of Computation …, 2007 | 6 | 2007 |
| Learning regular tree languages from correction and equivalence queries CI Tırnauca, C Tırnauca Journal of Automata, Languages and Combinatorics 12 (4), 501-524, 2007 | 6 | 2007 |
| Border algorithms for computing Hasse diagrams of arbitrary lattices JL Balcázar, C Tîrnăucă International Conference on Formal Concept Analysis, 49-64, 2011 | 5 | 2011 |
| Filtering Association Rules with Negations on the Basis of Their Confidence Boost. JL Balcázar, C Tîrnauca, ME Zorrilla KDIR, 263-268, 2010 | 5* | 2010 |
| Language learning with correction queries C Tirnauca Universitat Rovira i Virgili, 2009 | 5 | 2009 |
| Daily routines inference based on location history S Salomón, C Tîrnăucă, R Duque, JL Montaña International Conference on Ubiquitous Computing and Ambient Intelligence …, 2017 | 4 | 2017 |
| User interaction modeling and profile extraction in interactive systems: a groupware application case study C Tîrnăucă, R Duque, JL Montaña Sensors 17 (7), 1669, 2017 | 4 | 2017 |
| Automatic generation of user interaction models C Tîrnăucă, R Duque, JL Montaña International Conference on Ubiquitous Computing and Ambient Intelligence …, 2016 | 3 | 2016 |
| Model-driven regularization approach to straight line program genetic programming JL Montaña, CL Alonso, CE Borges, C Tîrnăucă Expert Systems with Applications 57, 76-90, 2016 | 3 | 2016 |
| Closed-set-based discovery of representative association rules revisited JL Balcázar Navarro, C Tîrnauca Extraction et gestion des connaissances (EGC'2011), actes, 25 au 29 janvier …, 2011 | 3 | 2011 |
| Mining educational data for patterns with negations and high confidence boost JL Balcázar Navarro, C Tirnauca, ME Zorrilla Pantaleón Actas de V Simposio de Teoría y Aplicaciones de Minería de Datos (TAMIDA …, 2010 | 3* | 2010 |
Jose Luis MontañaProfesor de Informática, Universidad de CantabriaVerified email at unican.es
