Joel Ratsaby

Inf. Comput., March, 2023

Accelerating the LZ-complexity algorithm.

[BibT_eX]

[DOI]

Alexander Timashkov

Proceedings of the 29th IEEE International Conference on Parallel and Distributed Systems, 2023

2020

Large-width machine learning algorithm.

[BibT_eX]

[DOI]

Prog. Artif. Intell., 2020

2018

Large width nearest prototype classification on general distance spaces.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Large-width bounds for learning half-spaces on distance spaces.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

On how complexity affects the stability of a predictor.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017

Classification based on prototypes with spheres of influence.

[BibT_eX]

[DOI]

Inf. Comput., 2017

2016

PAC Learning.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Multi-category classifiers and sample width.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

2015

A probabilistic approach to case-based inference.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On complexity and randomness of Markov-chain prediction.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

A Parallel Distributed Processing Algorithm for Image Feature Extraction.

[BibT_eX]

[DOI]

Alexander Belousov

Proceedings of the Advances in Intelligent Data Analysis XIV, 2015

2014

Learning bounds via sample width for classifiers on finite metric spaces.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

A hybrid classifier based on boxes and nearest neighbors.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

A New Pseudo-metric for Fuzzy Sets.

[BibT_eX]

[DOI]

László Kovács

Proceedings of the Artificial Intelligence and Soft Computing, 2014

2013

Machine learning on images using a string-distance

[BibT_eX]

[DOI]

Uzi Chester

CoRR, 2013

Maximal-margin case-based inference.

[BibT_eX]

[DOI]

Proceedings of the 13th UK Workshop on Computational Intelligence, 2013

Machine Learning for Image Classification and Clustering Using a Universal Distance Measure.

[BibT_eX]

[DOI]

Uzi Chester

Proceedings of the Similarity Search and Applications - 6th International Conference, 2013

Quantifying accuracy of learning via sample width.

[BibT_eX]

[DOI]

Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, 2013

2012

Analysis of a multi-category classifier.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Robust cutpoints in the logical analysis of numerical data.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

The performance of a new hybrid classifier based on boxes and nearest neighbors.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

2011

On the sysRatio and its critical point.

[BibT_eX]

[DOI]

Math. Comput. Model., 2011

2010

Maximal width learning of binary functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

On the algorithmic complexity of static structures.

[BibT_eX]

[DOI]

Joël Chaskalovic

J. Syst. Sci. Complex., 2010

Descriptive-complexity based distance for fuzzy sets

[BibT_eX]

[DOI]

László Kovács

CoRR, 2010

Prediction by Compression

[BibT_eX]

[DOI]

CoRR, 2010

2009

Random scattering of bits by prediction

[BibT_eX]

[DOI]

CoRR, 2009

Learning, complexity and information density

[BibT_eX]

[DOI]

CoRR, 2009

Combinatorial information distance

[BibT_eX]

[DOI]

CoRR, 2009

How random are a learner's mistakes?

[BibT_eX]

[DOI]

CoRR, 2009

2008

PAC Learning.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

An Algorithmic Complexity Interpretation of Lin's Third Law of Information Theory.

[BibT_eX]

[DOI]

Entropy, 2008

VC-Dimensions of Random Function Classes.

[BibT_eX]

[DOI]

Bernard Ycart

Discret. Math. Theor. Comput. Sci., 2008

Constrained versions of Sauer's lemma.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

On the complexity of constrained VC-classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Algorithmic complexity and randomness in elastic solids

[BibT_eX]

[DOI]

Joël Chaskalovic

CoRR, 2008

Information Width

[BibT_eX]

[DOI]

CoRR, 2008

On the complexity of binary samples.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2008

2007

The VC dimension of k-uniform random hypergraphs.

[BibT_eX]

[DOI]

Bernard Ycart

Random Struct. Algorithms, 2007

Information Efficiency.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006

Complexity of hyperconcepts.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

On the Combinatorial Representation of Information.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2004

On the Complexity of Samples for Learning.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

On learning multicategory classification with sample queries.

[BibT_eX]

[DOI]

Inf. Comput., 2003

A Stochastic Gradient Descent Algorithm for Structural Risk Minimisation.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

2000

On partially blind learning complexity.

[BibT_eX]

[DOI]

Santosh S. Venkatesh

Proceedings of the IEEE International Symposium on Circuits and Systems, 2000

1999

On the Learnability of Rich Function Classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1999

1998

Incremental Learning With Sample Queries.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 1998

The Degree of Approximation of Sets in Euclidean Space Using Sets with Bounded Vapnik-Chervonenkis Dimension.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1997

On the Value of Partial Information for Learning from Examples.

[BibT_eX]

[DOI]

J. Complex., 1997

An Incremental Nearest Neighbor Algorithm with Queries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 10, 1997

Generalization of the PAC-Model for Learning with Partial Information.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, Third European Conference, 1997

1996

Towards Robust Model Selection Using Estimation and Approximation Error Bounds.

[BibT_eX]

[DOI]

Ron Meir

Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

1995

Learning from a Mixture of Labeled and Unlabeled Examples with Parametric Side Information.

[BibT_eX]

[DOI]