| Publication | Date of Publication | Type |
|---|
Metric learning for ordered labeled trees with \(pq\)-grams
(available as arXiv preprint) | 2021-07-06 | Paper |
Algorithms and hardness results for the maximum balanced connected subgraph problem
(available as arXiv preprint) | 2020-05-13 | Paper |
Outlier detection using binary decision diagrams
Data Mining and Knowledge Discovery | 2019-05-03 | Paper |
Improved methods for computing distances between unordered trees using integer programming
(available as arXiv preprint) | 2018-03-26 | Paper |
Learning concepts and their unions from positive data with refinement operators
Annals of Mathematics and Artificial Intelligence | 2017-03-06 | Paper |
Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
Machine Learning | 2013-03-28 | Paper |
| \(\Sigma^{0}_\alpha\)-admissible representations. (Extended abstract) | 2012-09-28 | Paper |
Learning families of closed sets in matroids
Computation, Physics and Beyond | 2012-06-15 | Paper |
Learning figures with the Hausdorff metric by fractals
Lecture Notes in Computer Science | 2010-10-01 | Paper |
Topological properties of concept spaces (full version)
Information and Computation | 2010-04-08 | Paper |
Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
Theoretical Computer Science | 2010-03-09 | Paper |
| scientific article; zbMATH DE number 5566139 (Why is no real title available?) | 2009-06-18 | Paper |
Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets
Grammatical Inference: Algorithms and Applications | 2008-10-16 | Paper |
Topological Properties of Concept Spaces
Lecture Notes in Computer Science | 2008-10-14 | Paper |
Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
Lecture Notes in Computer Science | 2008-09-04 | Paper |
An Efficient Algorithm for Computing Kernel Function Defined with Anti-unification
Inductive Logic Programming | 2007-11-15 | Paper |
Hypothesis finding with proof theoretical appropriateness criteria
Theoretical Computer Science | 2006-03-20 | Paper |
| scientific article; zbMATH DE number 2086334 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080447 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2077168 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 1746704 (Why is no real title available?) | 2004-02-25 | Paper |
| scientific article; zbMATH DE number 1966623 (Why is no real title available?) | 2003-08-18 | Paper |
Hypothesis finding based on upward refinement of residue hypotheses.
Theoretical Computer Science | 2003-05-22 | Paper |
| scientific article; zbMATH DE number 1875402 (Why is no real title available?) | 2003-03-02 | Paper |
| scientific article; zbMATH DE number 1759257 (Why is no real title available?) | 2002-10-13 | Paper |
| scientific article; zbMATH DE number 1351094 (Why is no real title available?) | 1999-10-24 | Paper |
| scientific article; zbMATH DE number 1351100 (Why is no real title available?) | 1999-10-20 | Paper |
| scientific article; zbMATH DE number 975708 (Why is no real title available?) | 1997-05-25 | Paper |
| scientific article; zbMATH DE number 975697 (Why is no real title available?) | 1997-02-04 | Paper |
| scientific article; zbMATH DE number 517021 (Why is no real title available?) | 1994-04-14 | Paper |
| scientific article; zbMATH DE number 67628 (Why is no real title available?) | 1992-09-27 | Paper |
Short note: procedural semantics and negative information of elementary formal system
The Journal of Logic Programming | 1992-08-13 | Paper |
Learning elementary formal systems
Theoretical Computer Science | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4045222 (Why is no real title available?) | 1987-01-01 | Paper |
