Joel Ratsaby

529 total citations
54 papers, 287 citations indexed

About

Joel Ratsaby is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Joel Ratsaby has authored 54 papers receiving a total of 287 indexed citations (citations by other indexed papers that have themselves been cited), including 49 papers in Artificial Intelligence, 20 papers in Computational Theory and Mathematics and 11 papers in Computer Vision and Pattern Recognition. Recurrent topics in Joel Ratsaby's work include Machine Learning and Algorithms (34 papers), Algorithms and Data Compression (22 papers) and Machine Learning and Data Classification (15 papers). Joel Ratsaby is often cited by papers focused on Machine Learning and Algorithms (34 papers), Algorithms and Data Compression (22 papers) and Machine Learning and Data Classification (15 papers). Joel Ratsaby collaborates with scholars based in Israel, United Kingdom and France. Joel Ratsaby's co-authors include Martin Anthony, Santosh S. Venkatesh, Vitaly Maiorov, V. Maiorov, Ron Meir, László Kovács, Ronny Meir and Bernard Ycart and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Pattern Analysis and Machine Intelligence and Chaos Solitons & Fractals.

In The Last Decade

Joel Ratsaby

44 papers receiving 252 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Joel Ratsaby Israel	8	220	70	56	30	23	54	287
Anastasios Zouzias Canada	9	211 1.0×	106 1.5×	68 1.2×	25 0.8×	147 6.4×	13	353
Yunwen Lei China	11	242 1.1×	97 1.4×	30 0.5×	10 0.3×	111 4.8×	51	355
Yair Carmon United States	7	130 0.6×	32 0.5×	45 0.8×	61 2.0×	114 5.0×	16	215
Victor Bittorf United States	4	145 0.7×	63 0.9×	24 0.4×	8 0.3×	70 3.0×	5	254
Iraj Kalantari United States	10	91 0.4×	44 0.6×	173 3.1×	65 2.2×	22 1.0×	28	320
Daniel Dadush Netherlands	10	92 0.4×	20 0.3×	160 2.9×	82 2.7×	24 1.0×	37	282
Haim Schweitzer United States	9	89 0.4×	126 1.8×	7 0.1×	9 0.3×	47 2.0×	41	231
Ragesh Jaiswal India	9	211 1.0×	38 0.5×	129 2.3×	4 0.1×	12 0.5×	27	316
János Pach Hungary	6	36 0.2×	91 1.3×	180 3.2×	17 0.6×	36 1.6×	15	365
Peyman Afshani Denmark	10	89 0.4×	93 1.3×	81 1.4×	9 0.3×	20 0.9×	44	270

Countries citing papers authored by Joel Ratsaby

Since Specialization

Citations

This map shows the geographic impact of Joel Ratsaby's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Joel Ratsaby with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joel Ratsaby more than expected).

Fields of papers citing papers by Joel Ratsaby

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Joel Ratsaby. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Joel Ratsaby. The network helps show where Joel Ratsaby may publish in the future.

Co-authorship network of co-authors of Joel Ratsaby

This figure shows the co-authorship network connecting the top 25 collaborators of Joel Ratsaby. A scholar is included among the top collaborators of Joel Ratsaby based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Joel Ratsaby. Joel Ratsaby is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Ratsaby, Joel. (2024). Bounded complexity approximation of fractal sets. 12(2). 281–304. 1 indexed citations

Ratsaby, Joel, et al.. (2023). Accelerating the LZ-complexity algorithm. 22. 200–207.

Ratsaby, Joel. (2018). ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS. Probability in the Engineering and Informational Sciences. 33(4). 528–563. 3 indexed citations

Anthony, Martin & Joel Ratsaby. (2018). Large width nearest prototype classification on general distance spaces. Theoretical Computer Science. 738. 65–79. 1 indexed citations

Anthony, Martin & Joel Ratsaby. (2018). Large-width bounds for learning half-spaces on distance spaces. Discrete Applied Mathematics. 243. 73–89. 3 indexed citations

Anthony, Martin & Joel Ratsaby. (2015). A probabilistic approach to case-based inference. Theoretical Computer Science. 589. 61–75. 6 indexed citations

Anthony, Martin & Joel Ratsaby. (2014). A hybrid classifier based on boxes and nearest neighbors. Discrete Applied Mathematics. 172. 1–11. 6 indexed citations

Kovács, László & Joel Ratsaby. (2013). Analysis of Linear Interpolation of Fuzzy Sets with Entropy-based Distances. Acta Polytechnica Hungarica. 10(3). 51–64. 6 indexed citations

Kovács, László, et al.. (2013). Analysis of Linear Interpolation of Fuzzy Sets with Entropy-based Distances. Acta Polytechnica Hungarica. 10(3). 3 indexed citations

10.

Anthony, Martin & Joel Ratsaby. (2013). Learning bounds via sample width for classifiers on finite metric spaces. Theoretical Computer Science. 529. 2–10. 6 indexed citations

11.

Anthony, Martin & Joel Ratsaby. (2012). The performance of a new hybrid classifier based on boxes and nearest neighbors. London School of Economics and Political Science Research Online (London School of Economics and Political Science). 5 indexed citations

12.

Anthony, Martin & Joel Ratsaby. (2012). Analysis of a multi-category classifier. Discrete Applied Mathematics. 160(16-17). 2329–2338. 4 indexed citations

13.

Anthony, Martin & Joel Ratsaby. (2011). Robust cutpoints in the logical analysis of numerical data. Discrete Applied Mathematics. 160(4-5). 355–364. 14 indexed citations

14.

Ratsaby, Joel. (2010). Some Consequences of the Complexity of Intelligent Prediction. SHILAP Revista de lepidopterología. 2 indexed citations

15.

Ratsaby, Joel. (2010). On the sysRatio and its critical point. Mathematical and Computer Modelling. 53(5-6). 939–944. 4 indexed citations

16.

Ratsaby, Joel. (2006). Complexity of hyperconcepts. Theoretical Computer Science. 363(1). 2–10.

17.

Maiorov, Vitaly, Ron Meir, & Joel Ratsaby. (1999). On the Approximation of Functional Classes Equipped with a Uniform Measure Using Ridge Functions. Journal of Approximation Theory. 99(1). 95–111. 16 indexed citations

18.

Maiorov, Vitaly & Joel Ratsaby. (1998). The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension. Discrete Applied Mathematics. 86(1). 81–93. 12 indexed citations

19.

Ratsaby, Joel. (1997). An Incremental Nearest Neighbor Algorithm with Queries. Neural Information Processing Systems. 10. 612–618. 1 indexed citations

20.

Ratsaby, Joel & Vitaly Maiorov. (1997). On the Value of Partial Information for Learning from Examples. Journal of Complexity. 13(4). 509–544. 10 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact