Funder
National Natural Science Foundation of China
Reference31 articles.
1. Learning boolean formulae or finite automata is as hard as factoring;Kearns;Technical Report TR-14-88 Harvard University Aikem Computation Laboratory,1988
2. Cryptographic limitations on learning boolean formulae and finite automata;Kearns;Journal of the ACM (JACM),1994
3. A decision-theoretic generalization of on-line learning and an application to boosting;Freund;J. Comput. System Sci.,1997
4. Greedy function approximation: a gradient boosting machine;Friedman;Ann. Statist.,2001
5. Xgboost: A scalable tree boosting system;Chen,2016
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献