Decision Trees and Diagrams
暂无分享,去创建一个
[1] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[2] Seth Zimmerman. An Optimal Search Procedure , 1959 .
[3] C. Y. Lee. Representation of switching circuits by binary-decision programs , 1959 .
[4] A. F. Whiting. Identification , 1960, Australian Water Bugs. (Hemiptera - Heteroptera, Gerromorpha & Nepomorpha).
[5] E. J. Kletsky,et al. An Application of the Information Theory Approach to Failure Diagnosis , 1960 .
[6] Michael Montalbano. Tables, Flow Charts and Program Logic , 1962, IBM Syst. J..
[7] J. F. Egler,et al. A procedure for converting logic table conditions into an efficient sequence of test instructions , 1963, CACM.
[8] H. Riesel. In which order are different conditions to be examined? , 1963 .
[9] Donald V. Osborne,et al. SOME ASPECTS OF THE THEORY OF DICHOTOMOUS KEYS , 1963 .
[10] James R. Slagle. An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions , 1964, JACM.
[11] David Mandelbaum. A Measure of Efficiency of Diagnostic Tests Upon Sequential Logic , 1964, IEEE Trans. Electron. Comput..
[12] Michael A. Harrison,et al. Introduction to switching and automata theory , 1965 .
[13] Solomon L. Pollack,et al. Conversion of limited-entry decision tables to computer programs , 1965, CACM.
[14] Laurence I. Press,et al. Conversion of decision tables to computer programs , 1965, CACM.
[15] Herbert Y. Chang. An Algorithm for Selecting an Optimum Set of Diagnostic Tests , 1965, IEEE Trans. Electron. Comput..
[16] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..
[17] Lewis T. Reinwald,et al. Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time , 1966, JACM.
[18] Lewis T. Reinwald,et al. Conversion of Limited-Entry Decision Tables to Optimal Computer Programs II: minimum storage requirement , 1967, JACM.
[19] F. J. M. Laver. JANUS - Reflections on DATAFAIR 69 , 1970, Comput. J..
[20] Michael Randolph Garey. Optimal binary decision trees for diagnostic identification problems , 1970 .
[21] C. R. Muthukrishnan,et al. On the conversion of decision tables to computer programs , 1970, CACM.
[22] R. J. Pankhurst,et al. A Computer Program for Generating Diagnostic Keys , 1970, Comput. J..
[23] Richard C. T. Lee,et al. A New Algorithm for Generating Prime Implicants , 1970, IEEE Transactions on Computers.
[24] G. Metze,et al. Fault diagnosis of digital systems , 1970 .
[25] Richard C. T. Lee,et al. Application of game tree searching techniques to sequential pattern recognition , 1971, CACM.
[26] L. E. Morse. SPECIMEN IDENTIFICATION AND KEY CONSTRUCTION WITH TIME‐SHARING COMPUTERS , 1971 .
[27] Donald E. Knuth,et al. Mathematical Analysis of Algorithms , 1971, IFIP Congress.
[28] J. C. GOWER,et al. Selecting Tests in Diagnostic Keys with Unknown Responses , 1971, Nature.
[29] Jonas Rabin,et al. Conversion of limited-entry decision tables into optimal decision trees: fundamental concepts , 1971, SIGP.
[30] Bruce Silberg,et al. Detab/65 in third-generation Cobol , 1971, SIGP.
[31] Toshio Yasui. Some aspects of decision table conversion techniques , 1971, SIGP.
[32] M. Garey. Optimal Binary Identification Procedures , 1972 .
[33] Edward M. Reingold,et al. On the Optimality of Some Set Algorithms , 1972, JACM.
[34] M. R. Garey. Simple Binary Identification Problems , 1972, IEEE Transactions on Computers.
[35] A. J. Bayes. A Dynamic Programming Algorithm to Optimise Decision Table Code , 1973, Aust. Comput. J..
[36] S. Ganapathy,et al. Information theory applied to the conversion of decision tables to computer programs , 1973, CACM.
[37] William S. Meisel,et al. A Partitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees , 1973, IEEE Transactions on Computers.
[38] Roger G. Johnson,et al. Some comments on the use of ambiguous decision tables and their conversion to computer programs , 1973, CACM.
[39] M. J. Dallwitz,et al. A Flexible Computer Program for Generating Identification Keys , 1974 .
[40] Keith Shwayder. Extending the infomation theory approach to converting limited-entry decision tables to computer programs , 1974, CACM.
[41] Udo W. Pooch,et al. Translation of Decision Tables , 1974, ACM Comput. Surv..
[42] David A. Landgrebe,et al. The decision tree approach to classification , 1975 .
[43] C. D. McGillem,et al. Machine processing of remotely sensed data , 1975 .
[44] Bernie L. Hulme,et al. A Prime Implicant Algorithm with Factoring , 1975, IEEE Transactions on Computers.
[45] J. Gower,et al. A comparison of different criteria for selecting binary tests in diagnostic keys , 1975 .
[46] Keith Shwayder. Combining decision rules in a decision table , 1975, CACM.
[47] Eugene Wong,et al. Decomposition—a strategy for query processing , 1976, TODS.
[48] K. S. Fu,et al. An Approach to the Design of a Linear Binary Tree Classifier , 1976 .
[49] Frederic J. Mowle,et al. A Numerical Expansion Technique and Its Application to Minimal Multiplexer Logic Circuits , 1976, IEEE Transactions on Computers.
[50] Ronald L. Rivest,et al. Constructing Optimal Binary Decision Trees is NP-Complete , 1976, Inf. Process. Lett..
[51] Kenneth C. Sevcik,et al. The synthetic approach to decision table conversion , 1976, CACM.
[52] Yehoshua Perl,et al. Optimal sequential arrangement of evaluation trees for boolean functions , 1976, Inf. Sci..
[53] Ronald L. Rivest,et al. On Recognizing Graph Properties from Adjacency Matrices , 1976, Theor. Comput. Sci..
[54] Michael Z. Hanani. An optimal evaluation of Boolean expressions in an online query system , 1977, CACM.
[55] Philip H. Swain,et al. Purdue e-Pubs , 2022 .
[56] P. Brown. Functions for selecting tests in diagnostic key construction , 1977 .
[57] William S. Meisel,et al. An Algorithm for Constructing Optimal Binary Decision Trees , 1977, IEEE Transactions on Computers.
[58] Raymond P. Voith,et al. ULM Implicants for Minimization of Univers Logic Module Circuits , 1977, IEEE Transactions on Computers.
[59] Bruce W. Weide,et al. A Survey of Analysis Techniques for Discrete Algorithms , 1977, CSUR.
[60] R. W. Payne. Reticulation and Other Methods of Reducing the Size of Printed Diagnostic Keys , 1977 .
[61] Richard E. Barlow,et al. Reliability and Fault Tree Analysis , 1977 .
[62] Erik Meineche Schmidt,et al. The Complexity of Equivalence and Containment for Free Single Variable Program Schemes , 1978, ICALP.
[63] M. Davio,et al. Optimization of multivalued decision algorithms , 1978, MVL '78.
[64] Sheldon B. Akers,et al. Binary Decision Diagrams , 1978, IEEE Transactions on Computers.
[65] Donald A. Bell,et al. Decision Trees, Tables, and Lattices , 1978 .
[66] Alberto Martelli,et al. Optimizing decision trees through heuristically guided search , 1978, CACM.
[67] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[68] Ashok V. Kulkarni. On the Mean Accuracy of Hierarchical Classifiers , 1978, IEEE Transactions on Computers.
[69] Yuri Breitbart,et al. Analysis of Algorithms for the Evaluation of Monotonic Boolean Functions , 1978, IEEE Transactions on Computers.
[70] Ryszard S. Michalski. Designing Extended Entry Decision Tables and Optimal Decision Trees Using Decision Diagrams , 1978 .
[71] Ronald E. Prather,et al. Realization of Boolean Expressions by Atomic Digraphs , 1978, IEEE Transactions on Computers.
[72] Jean-Pierre Deschamps,et al. Discrete and switching functions , 1978 .
[73] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[74] Eduardo Sanchez,et al. Synthesis of Minimal Binary Decision Trees , 1979, IEEE Transactions on Computers.
[75] Laveen N. Kanal,et al. Problem-Solving Models and Search Strategies for Pattern Recognition , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[76] Abraham Kandel,et al. On the Properties and Applications of Fuzzy-Valued Switching Functions , 1980, IEEE Transactions on Computers.
[77] B. Moret. The representation of discrete functions by decision trees: aspects of complexity and problems of testing , 1982 .
[78] Manuel Blum,et al. Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time , 1980, Inf. Process. Lett..
[79] R. Tosic. An optimal search procedure , 1980 .
[80] D. A. Preece,et al. Identification Keys and Diagnostic Tables: a Review , 1980 .
[81] Ishwar K. Sethi,et al. Conversion of decision tables to efficient sequential testing procedures , 1980, CACM.
[82] Bernard M. E. Moret,et al. The Activity of a Variable and Its Relation to Decision Trees , 1980, TOPL.
[83] André Thayse. Boolean Calculus of Differences , 1981, Lecture Notes in Computer Science.
[84] R. Payne. Selection criteria for the construction of efficient diagnostic keys , 1981 .
[85] G. R. Dattatreya,et al. Bayesian and Decision Tree Approaches for Pattern Recognition Including Feature Measurement Costs , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[86] André Thayse. P-functions: A new tool for the analysis and synthesis of binary programs , 1981, IEEE Transactions on Computers.
[87] Ellis Horowitz,et al. The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSI , 1981, IEEE Transactions on Computers.
[88] Udi Manber,et al. Probabilistic, nondeterministic, and alternating decision trees (Preliminary Version) , 1982, STOC '82.
[89] Pramod K. Varshney,et al. Application of information theory to the construction of efficient decision trees , 1982, IEEE Trans. Inf. Theory.
[90] Václav Chvalovský,et al. Decision tables , 1983, Softw. Pract. Exp..