Decision trees for entity identification: approximation algorithms and hardness results
暂无分享,去创建一个
Mukesh K. Mohania | Sambuddha Roy | Venkatesan T. Chakaravarthy | Pranjal Awasthi | Vinayaka Pandit | Vinayaka Pandit | Pranjal Awasthi | M. Mohania | Sambuddha Roy
[1] R. J. Pankhurst,et al. A Computer Program for Generating Diagnostic Keys , 1970, Comput. J..
[2] Yogish Sabharwal,et al. Approximating Decision Trees with Multiway Branches , 2009, ICALP.
[3] M H Zwietering,et al. A computerised system for the identification of lactic acid bacteria. , 1997, International journal of food microbiology.
[4] Bernard M. E. Moret,et al. Decision Trees and Diagrams , 1982, CSUR.
[5] Ronald L. Graham,et al. Performance bounds on the splitting algorithm for binary testing , 1974, Acta Informatica.
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Ran Raz,et al. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.
[8] Michael Randolph Garey. Optimal binary decision trees for diagnostic identification problems , 1970 .
[9] Geoffrey Exoo,et al. A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers , 1994, Electron. J. Comb..
[10] Jaroslav Nesetril,et al. I. Schur, C.E. Shannon and Ramsey Numbers, a short story , 2001, Discret. Math..
[11] Ronald L. Rivest,et al. Constructing Optimal Binary Decision Trees is NP-Complete , 1976, Inf. Process. Lett..
[12] Kathryn Fraughnaugh,et al. Introduction to graph theory , 1973, Mathematical Gazette.
[13] G. Winskel. What Is Discrete Mathematics , 2007 .
[14] Sreerama K. Murthy,et al. Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey , 1998, Data Mining and Knowledge Discovery.
[15] Steven Skiena,et al. Decision trees for geometric models , 1993, SCG '93.
[16] László Lovász,et al. Approximating Min Sum Set Cover , 2004, Algorithmica.
[17] Sanjoy Dasgupta,et al. Analysis of a greedy active learning strategy , 2004, NIPS.
[18] Ramsey Theory,et al. Ramsey Theory , 2020, Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic.
[19] Micah Adler,et al. Improving access to organized information , 2006 .
[20] Micah Adler,et al. Approximating Optimal Binary Decision Trees , 2008, APPROX-RANDOM.
[21] Teresa M. Przytycka,et al. On an Optimal Split Tree Problem , 1999, WADS.
[22] Victor J. Rayward-Smith,et al. Algorithms for Identification Key Generation and Optimization with Application to Yeast Identification , 2003, EvoWorkshops.
[23] Micah Adler,et al. Approximating Optimal Decision Trees , 2005 .
[24] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[25] M. Garey. Optimal Binary Identification Procedures , 1972 .
[26] Fan Chung Graham,et al. A survey of bounds for classical Ramsey numbers , 1983, J. Graph Theory.