Joel Ratsaby

Publication Activity (10 Years)

Years Active: 1995-2023
Publications (10 Years): 11

Top Topics

Nearest Neighbor

Learning Algorithm

Image Feature Extraction

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Publications

Joel Ratsaby
Learning half-spaces on general infinite spaces equipped with a distance function. Inf. Comput. 291 (2023)
Joel Ratsaby, Alexander Timashkov
Accelerating the LZ-complexity algorithm. ICPADS (2023)
Martin Anthony, Joel Ratsaby
Large-width machine learning algorithm. Prog. Artif. Intell. 9 (3) (2020)
Martin Anthony, Joel Ratsaby
Large-width bounds for learning half-spaces on distance spaces. Discret. Appl. Math. 243 (2018)
Joel Ratsaby
On how complexity affects the stability of a predictor. AISTATS (2018)
Martin Anthony, Joel Ratsaby
Large width nearest prototype classification on general distance spaces. Theor. Comput. Sci. 738 (2018)
Martin Anthony, Joel Ratsaby
Classification based on prototypes with spheres of influence. Inf. Comput. 256 (2017)
Martin Anthony, Joel Ratsaby
Multi-category classifiers and sample width. J. Comput. Syst. Sci. 82 (8) (2016)
Joel Ratsaby
On complexity and randomness of Markov-chain prediction. ITW (2015)
Alexander Belousov, Joel Ratsaby
A Parallel Distributed Processing Algorithm for Image Feature Extraction. IDA (2015)
Martin Anthony, Joel Ratsaby
A probabilistic approach to case-based inference. Theor. Comput. Sci. 589 (2015)
László Kovács, Joel Ratsaby
A New Pseudo-metric for Fuzzy Sets. ICAISC (1) (2014)
Martin Anthony, Joel Ratsaby
A hybrid classifier based on boxes and nearest neighbors. Discret. Appl. Math. 172 (2014)
Martin Anthony, Joel Ratsaby
Learning bounds via sample width for classifiers on finite metric spaces. Theor. Comput. Sci. 529 (2014)
Martin Anthony, Joel Ratsaby
Quantifying accuracy of learning via sample width. FOCI (2013)
Uzi Chester, Joel Ratsaby
Machine Learning for Image Classification and Clustering Using a Universal Distance Measure. SISAP (2013)
Uzi Chester, Joel Ratsaby
Machine learning on images using a string-distance CoRR (2013)
Martin Anthony, Joel Ratsaby
Maximal-margin case-based inference. UKCI (2013)
Martin Anthony, Joel Ratsaby
Analysis of a multi-category classifier. Discret. Appl. Math. 160 (16-17) (2012)
Martin Anthony, Joel Ratsaby
Robust cutpoints in the logical analysis of numerical data. Discret. Appl. Math. 160 (4-5) (2012)
Martin Anthony, Joel Ratsaby
The performance of a new hybrid classifier based on boxes and nearest neighbors. ISAIM (2012)
Joel Ratsaby
On the sysRatio and its critical point. Math. Comput. Model. 53 (5-6) (2011)
Martin Anthony, Joel Ratsaby
Maximal width learning of binary functions. Theor. Comput. Sci. 411 (1) (2010)
László Kovács, Joel Ratsaby
Descriptive-complexity based distance for fuzzy sets CoRR (2010)
Joel Ratsaby
Prediction by Compression CoRR (2010)
Joel Ratsaby, Joël Chaskalovic
On the algorithmic complexity of static structures. J. Syst. Sci. Complex. 23 (6) (2010)
Joel Ratsaby
How random are a learner's mistakes? CoRR (2009)
Joel Ratsaby
Learning, complexity and information density CoRR (2009)
Joel Ratsaby
Combinatorial information distance CoRR (2009)
Joel Ratsaby
Random scattering of bits by prediction CoRR (2009)
Joel Ratsaby, Joël Chaskalovic
Algorithmic complexity and randomness in elastic solids CoRR (2008)
Joel Ratsaby
On the complexity of binary samples. Ann. Math. Artif. Intell. 52 (1) (2008)
Joel Ratsaby
An Algorithmic Complexity Interpretation of Lin's Third Law of Information Theory. Entropy 10 (1) (2008)
Joel Ratsaby
An algorithmic complexity interpretation of Lin's third law of information theory CoRR (2008)
Joel Ratsaby
Constrained versions of Sauer's lemma. Discret. Appl. Math. 156 (14) (2008)
Joel Ratsaby
On the Complexity of Binary Samples CoRR (2008)
Joel Ratsaby
On the complexity of constrained VC-classes. Discret. Appl. Math. 156 (6) (2008)
Joel Ratsaby
Information Width CoRR (2008)
Bernard Ycart, Joel Ratsaby
VC-Dimensions of Random Function Classes. Discret. Math. Theor. Comput. Sci. 10 (1) (2008)
Bernard Ycart, Joel Ratsaby
The VC dimension of k-uniform random hypergraphs. Random Struct. Algorithms 30 (4) (2007)
Joel Ratsaby
Information Efficiency. SOFSEM (1) (2007)
Joel Ratsaby
Complexity of hyperconcepts. Theor. Comput. Sci. 363 (1) (2006)
Joel Ratsaby
On the Combinatorial Representation of Information. COCOON (2006)
Joel Ratsaby
On the Complexity of Samples for Learning. COCOON (2004)
Joel Ratsaby
A Stochastic Gradient Descent Algorithm for Structural Risk Minimisation. ALT (2003)
Joel Ratsaby
On learning multicategory classification with sample queries. Inf. Comput. 185 (2) (2003)
Joel Ratsaby, Santosh S. Venkatesh
On partially blind learning complexity. ISCAS (2000)
Joel Ratsaby, Vitaly Maiorov
On the Learnability of Rich Function Classes. J. Comput. Syst. Sci. 58 (1) (1999)
Vitaly Maiorov, Joel Ratsaby
The Degree of Approximation of Sets in Euclidean Space Using Sets with Bounded Vapnik-Chervonenkis Dimension. Discret. Appl. Math. 86 (1) (1998)
Joel Ratsaby
Incremental Learning With Sample Queries. IEEE Trans. Pattern Anal. Mach. Intell. 20 (8) (1998)
Joel Ratsaby, Vitaly Maiorov
On the Value of Partial Information for Learning from Examples. J. Complex. 13 (4) (1997)
Joel Ratsaby
An Incremental Nearest Neighbor Algorithm with Queries. NIPS (1997)
Joel Ratsaby, Vitaly Maiorov
Generalization of the PAC-Model for Learning with Partial Information. EuroCOLT (1997)
Joel Ratsaby, Ron Meir, Vitaly Maiorov
Towards Robust Model Selection Using Estimation and Approximation Error Bounds. COLT (1996)
Joel Ratsaby, Santosh S. Venkatesh
Learning from a Mixture of Labeled and Unlabeled Examples with Parametric Side Information. COLT (1995)