Cristina Tîrnăucă

Available identifiers

Publication	Date of Publication	Type
Global optimality in \(k\)-means clustering	2020-09-08	Paper
Closed-Set-Based Discovery of Representative Association Rules	2020-02-21	Paper
Learning definite Horn formulas from closure queries	2017-02-06	Paper
New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries	2012-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q3018962	2011-07-27	Paper
Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices	2011-05-27	Paper
Types of Trusted Information That Make DFA Identification with Correction Queries Feasible	2011-02-11	Paper
Closed-set-based Discovery of Bases of Association Rules	2010-12-03	Paper
Necessary and sufficient conditions for learning with correction queries	2009-11-06	Paper
Learning DFA from Correction and Equivalence Queries	2008-11-27	Paper
A Note on the Relationship between Different Types of Correction Queries	2008-10-16	Paper
Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries	2008-08-19	Paper
Learning regular tree languages from correction and equivalence queries	2008-07-29	Paper
A Characterization of the Language Classes Learnable with Correction Queries	2007-11-13	Paper

This page was built for person: Cristina Tîrnăucă