| Publication | Date of Publication | Type |
|---|
| The complexity of learning minor closed graph classes | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5053235 | 2022-12-06 | Paper |
| Data Dependent Priors in PAC-Bayes Bounds | 2020-07-14 | Paper |
| High-probability minimax probability machines | 2018-02-23 | Paper |
| Design and Generalization Analysis of Orthogonal Matching Pursuit Algorithms | 2017-07-12 | Paper |
| PAC-Bayesian Inequalities for Martingales | 2017-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405232 | 2014-04-01 | Paper |
| Tighter PAC-Bayes bounds through distribution-dependent priors | 2013-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2896151 | 2012-07-13 | Paper |
| Sparse canonical correlation analysis | 2012-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093300 | 2011-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093406 | 2011-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174164 | 2011-10-12 | Paper |
| Prior Knowledge in Learning Finite Parameter Spaces | 2011-05-11 | Paper |
| Decomposing the tensor kernel support vector machine for neuroscience data with structured labels | 2010-10-07 | Paper |
| Distribution-Dependent PAC-Bayes Priors | 2010-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575762 | 2010-07-28 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| Handbook for the GREAT08 challenge: an image analysis competition for cosmological lensing | 2009-05-20 | Paper |
| Convergence analysis of kernel canonical correlation analysis: theory and practice | 2009-03-31 | Paper |
| On the Eigenspectrum of the Gram Matrix and the Generalization Error of Kernel-PCA | 2008-12-21 | Paper |
| Support Vector Machine to Synthesise Kernels | 2008-03-17 | Paper |
| Machine Learning: ECML 2004 | 2008-03-14 | Paper |
| Complexity of pattern classes and the Lipschitz property | 2007-09-18 | Paper |
| Algorithmic Learning Theory | 2006-11-01 | Paper |
| PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification | 2005-11-07 | Paper |
| Structural, Syntactic, and Statistical Pattern Recognition | 2005-08-24 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification | 2005-06-17 | Paper |
| On the generalization of soft margin algorithms | 2005-05-11 | Paper |
| Canonical Correlation Analysis: An Overview with Application to Learning Methods | 2005-04-05 | Paper |
| 10.1162/jmlr.2003.3.4-5.723 | 2005-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817981 | 2004-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420632 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420737 | 2003-08-18 | Paper |
| 10.1162/153244302760200687 | 2003-05-13 | Paper |
| Estimating the Support of a High-Dimensional Distribution | 2003-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547453 | 2002-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4546602 | 2002-08-20 | Paper |
| Covering numbers for support vector machines | 2002-08-04 | Paper |
| An unsupervised neural network approach to profiling the behavior of mobile phone users for use in fraud detection | 2002-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2779818 | 2002-04-15 | Paper |
| Linear programming boosting via column generation | 2002-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2755103 | 2001-11-06 | Paper |
| Enlarging the margins in perceptron decision trees | 2001-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937859 | 2000-02-20 | Paper |
| Structural risk minimization over data-dependent hierarchies | 1999-11-21 | Paper |
| A sufficient condition for polynomial distribution-dependent learnability | 1998-06-01 | Paper |
| Valid Generalisation from Approximate Interpolation | 1997-07-07 | Paper |
| Fast String Matching in Stationary Ergodic Sources | 1997-05-22 | Paper |
| A unifying framework for invariant pattern recognition | 1997-05-12 | Paper |
| Representation theory and invariant neural networks | 1997-01-14 | Paper |
| On specifying Boolean functions by labelled examples | 1995-11-28 | Paper |
| Erratum: A result of Vapnik with applications | 1995-10-09 | Paper |
| Sample sizes for threshold networks with equivalences | 1995-05-28 | Paper |
| Coverings of complete bipartite graphs and associated structures | 1995-05-03 | Paper |
| Using the Perceptron Algorithm to Find Consistent Hypotheses | 1994-12-18 | Paper |
| A result of Vapnik with applications | 1994-11-29 | Paper |
| Homeomorphism of 2-Complexes is Graph Isomorphism Complete | 1994-03-27 | Paper |
| Bounding sample size with the Vapnik-Chervonenkis dimension | 1993-05-16 | Paper |
| An approximate string-matching algorithm | 1992-09-26 | Paper |
| Sample sizes for multiple-output threshold networks | 1991-01-01 | Paper |
| The Spectral Radius of infinite Graphs | 1988-01-01 | Paper |
| Automorphism groups of primitive distance-bitransitive graphs are almost simple | 1987-01-01 | Paper |
| Distance-regularised graphs are distance-regular or distance-biregular | 1987-01-01 | Paper |
| Cubic Distance-Regular Graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3778780 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3220601 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3693541 | 1984-01-01 | Paper |
| Edge-colorability of graph bundles | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3665146 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3323992 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4748184 | 1982-01-01 | Paper |
| Search for minimal trivalent cycle permutation graphs with girth nine | 1981-01-01 | Paper |
