Fetching the paper…
Reading the bibliography…
A $k$-decision tree $t$ (or $k$-tree) is a recursive partition of a matrix (2D-signal) into $k\geq 1$ block matrices (axis-parallel rectangles, leaves) where each rectangle is assigned a real label.
Über den variabilitätsbereich der koeffizienten von potenzreihen, die gegebene werte nicht annehmen
Constantin Carathéodory · 1907
Earlier work this paper cites.
Dynamic programming
Richard Bellman · 1966
Earlier work this paper cites.
Constructing optimal binary decision trees is np-complete
Hyafil Laurent and Ronald L Rivest · 1976
Earlier work this paper cites.
Decomposable searching problems i. static-to-dynamic transformation
Jon Louis Bentley and James B Saxe · 1980
Earlier work this paper cites.
Epsilon-nets and simplex range queries
D Haussler and E Welzl · 1986
Earlier work this paper cites.
Decision tree construction via linear programming
Kristin P Bennett · 1992
Earlier work this paper cites.
Principles of risk minimization for learning theory
Vladimir Vapnik · 1992
Earlier work this paper cites.
Regression with dummy variables
Melissa A Hardy · 1993
Earlier work this paper cites.
Image compression via improved quadtree decomposition algorithms
Eli Shusterman and Meir Feder · 1994
Earlier work this paper cites.
Random decision forests
Tin Kam Ho · 1995
Earlier work this paper cites.
Random forests
Leo Breiman · 2001
Earlier work this paper cites.
On coresets for k-means and k-median clustering
Sariel Har-Peled and Soham Mazumdar · 2004
Earlier work this paper cites.
Geometric approximation via coresets
Pankaj K Agarwal, Sariel Har-Peled, Kasturi R Varadarajan, et al · 2005
Earlier work this paper cites.
Decision trees
Lior Rokach and Oded Maimon · 2005
Earlier work this paper cites.
The h. 264/mpeg4 advanced video coding standard and its applications
Detlev Marpe, Thomas Wiegand, and Gary J Sullivan · 2006
Earlier work this paper cites.
Uci machine learning repository, 2007
Arthur Asuncion and David Newman · 2007
Earlier work this paper cites.
Decision trees for entity identification: Approximation algorithms and hardness results
Venkatesan T Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Pranjal Awasthi, and Mukesh Mohania · 2007
Earlier work this paper cites.
On field calibration of an electronic nose for benzene estimation in an urban pollution monitoring scenario
Saverio De Vito, Ettore Massera, Marco Piga, Luca Martinotto, and Girolamo Di Francia · 2008
Earlier work this paper cites.
An empirical comparison of techniques for handling incomplete data using decision trees
Bhekisipho Twala · 2009
Earlier work this paper cites.
Coresets, sparse greedy approximation, and the frank-wolfe algorithm
Kenneth L Clarkson · 2010
Earlier work this paper cites.
Universal ε \varepsilon -approximators for integrals
Michael Langberg and Leonard J Schulman · 2010
Cited alongside, same era.
A unified framework for approximating and clustering data
Dan Feldman and Michael Langberg · 2011
Cited alongside, same era.
Classification and regression trees
Wei-Yin Loh · 2011
Cited alongside, same era.
Scikit-learn: Machine learning in python
Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, et al · 2011
Cited alongside, same era.
The single pixel gps: learning big data signals from tiny coresets
Dan Feldman, Cynthia Sung, and Daniela Rus · 2012
Cited alongside, same era.
Mergeable summaries
Pankaj K Agarwal, Graham Cormode, Zengfeng Huang, Jeff M Phillips, Zhewei Wei, and Ke Yi · 2013
Cited alongside, same era.
Lightgbm: A highly efficient gradient boosting decision tree
Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu · 2017
Later among the works it cites.
Training gaussian mixture models at scale via coresets
Mario Lucic, Matthew Faulkner, Andreas Krause, and Dan Feldman · 2017
Later among the works it cites.
Optimal randomized classification trees
Rafael Blanquero, Emilio Carrizosa, Cristina Molero-Rıo, and Dolores Romero Morales · 2018
Later among the works it cites.
Catboost: gradient boosting with categorical features support
Anna Veronika Dorogush, Vasily Ershov, and Andrey Gulin · 2018
Later among the works it cites.
Coreset-based neural network compression
Abhimanyu Dubey, Moitreya Chatterjee, and Narendra Ahuja · 2018
Later among the works it cites.
On coresets for logistic regression
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Gesture unit segmentation using support vector machines: segmenting gestures from rest positions
Renata CB Madeo, Clodoaldo AM Lima, and Sarajane M Peres · 2013
Cited alongside, same era.
A comparative study of decision tree id3 and c4. 5
Badr Hssina, Abdelkarim Merbouha, Hanane Ezzikouri, and Mohammed Erritali · 2014
Cited alongside, same era.
Composable core-sets for diversity and coverage maximization
Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, and Vahab S Mirrokni · 2014
Cited alongside, same era.
C4. 5: programs for machine learning
J Ross Quinlan · 2014
Cited alongside, same era.
Coresets for k-segmentation of streaming data
Guy Rosman, Mikhail Volkov, Danny Feldman, John W Fisher III, and Daniela Rus · 2014
Cited alongside, same era.
Uniform sampling for matrix approximation
Michael B Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford · 2015
Cited alongside, same era.
Alexander Munteanu, Chris Schwiegelshohn, Christian Sohler, and David Woodruff · 2018
Later among the works it cites.
Optimal sparse decision trees
Xiyang Hu, Cynthia Rudin, and Margo Seltzer · 2019
Later among the works it cites.
Fast and accurate least-mean-squares solvers
Alaa Maalouf, Ibrahim Jubran, and Dan Feldman · 2019
Later among the works it cites.
Learning optimal classification trees using a binary linear program formulation
Sicco Verwer and Yingqian Zhang · 2019
Later among the works it cites.
Core-sets: Updated survey
Dan Feldman · 2020
Later among the works it cites.
Turning big data into tiny data: Constant-size coresets for k-means, pca, and projective clustering
Dan Feldman, Melanie Schmidt, and Christian Sohler · 2020
Later among the works it cites.
Sets clustering
Ibrahim Jubran, Murad Tukan, Alaa Maalouf, and Dan Feldman · 2020
Later among the works it cites.
Robust coreset construction for distributed machine learning
Hanlin Lu, Ming-Ju Li, Ting He, Shiqiang Wang, Vijaykrishnan Narayanan, and Kevin S Chan · 2020
Later among the works it cites.
Faster pac learning and smaller coresets via smoothed analysis
Alaa Maalouf, Ibrahim Jubran, Murad Tukan, and Dan Feldman · 2020
Later among the works it cites.
Autonomous toy drone via coresets for pose estimation
Soliman Nasser, Ibrahim Jubran, and Dan Feldman · 2020
Later among the works it cites.
Sampling techniques for supervised or unsupervised tasks
Frédéric Ros and Serge Guillaume · 2020
Later among the works it cites.
Coresets for near-convex functions
Morad Tukan, Alaa Maalouf, and Dan Feldman · 2020
Later among the works it cites.
Kaggle forecasting competitions: An overlooked learning opportunity
Casper Solheim Bojer and Jens Peder Meldgaard · 2021
Closest in time.
Overview of accurate coresets
Ibrahim Jubran, Alaa Maalouf, and Dan Feldman · 2021
Closest in time.
Open source code for the algorithms presented in this paper, 2021
Jubran, Ibrahim and Sanches, Ernesto and Newman, Ilan and Feldman, Dan · 2021
Closest in time.