{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:37:54Z","timestamp":1759333074839},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[1996,10]]},"DOI":"10.1007\/bf00115299","type":"journal-article","created":{"date-parts":[[2004,11,1]],"date-time":"2004-11-01T02:11:46Z","timestamp":1099275106000},"page":"23-50","source":"Crossref","is-referenced-by-count":9,"title":["Using the minimum description length principle to infer reduced ordered decision graphs"],"prefix":"10.1007","volume":"25","author":[{"given":"Arlindo L.","family":"Oliveira","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Sangiovanni-Vincentelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"273","volume-title":"Proceedings of the 18th Annual ACM Symposium on the Theory of Computation","author":"A. Blumer","year":"1986","unstructured":"BlumerA., EhrenfeuchtA., HausslerD., & WarmuthM. (1986). Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension. InProceedings of the 18th Annual ACM Symposium on the Theory of Computation (pp. 273?282). Berkeley, CA: ACM Press."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A. Blumer","year":"1987","unstructured":"BlumerA., EhrenfeuchtA., HausslerD., & WarmuthM. K. (1987). Occam's razor.Information Processing Letters, 24, 377?380.","journal-title":"Information Processing Letters"},{"key":"CR3","first-page":"40","volume-title":"Proceedings of the Design Automation Conference","author":"K. Brace","year":"1989","unstructured":"BraceK., RudellR., & BryantR. (1989). Efficient implementation of a BDD package. InProceedings of the Design Automation Conference (pp. 40?45). Anaheim, CA: ACM Press."},{"key":"CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2821-6","volume-title":"Logic Minimization Algorithms for VLSI Synthesis","author":"R. K. Brayton","year":"1984","unstructured":"BraytonR. K., HachtelG. D., McMullenC., & Sangiovanni-VincentelliA. S. (1984).Logic Minimization Algorithms for VLSI Synthesis. Hingham, MA: Kluwer Academic Publishers."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/5.52213","volume":"78","author":"R. K. Brayton","year":"1990","unstructured":"BraytonR. K., HachtelG. D., & VincentelliA. S. (1990). Multilevel logic synthesis.Proceedings of the IEEE, 78, 264?300.","journal-title":"Proceedings of the IEEE"},{"key":"CR6","volume-title":"Classification and Regression Trees","author":"L. Breiman","year":"1984","unstructured":"BreimanL., FriedmanJ. H., OlshenR. A., & StoneC. J. (1984).Classification and Regression Trees. Belmont, CA: Wadsworth International Group."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. E. Bryant","year":"1986","unstructured":"BryantR. E. (1986). Graph-based algorithms for Boolean function manipulation.IEEE Transactions on Computers, 35, 677?691.","journal-title":"IEEE Transactions on Computers"},{"key":"CR8","volume-title":"Statistical Inference","author":"G. Casella","year":"1990","unstructured":"CasellaG. & BergerR. L. (1990).Statistical Inference. Pacific Grove, CA: Wadsworth & Brooks\/Cole."},{"key":"CR9","series-title":"Lecture Notes in Computer Science","first-page":"365","volume-title":"Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems","author":"O. Coudert","year":"1989","unstructured":"CoudertO., BerthetC., & MadreJ. C. (1989). Verification of synchronous sequential machines based on symbolic execution. InProceedings of the Workshop on Automatic Verification Methods for Finite State Systems, Volume 407 ofLecture Notes in Computer Science (pp. 365?373). Grenoble, France: Springer-Verlag."},{"key":"CR10","first-page":"194","volume-title":"Proceedings of the Twelfth International Conference on Machine Learning","author":"J. Dougherty","year":"1995","unstructured":"DoughertyJ., KohaviR., & SahamiM. (1995). Superised and unsupervised discretization of continuous features. InProceedings of the Twelfth International Conference on Machine Learning (pp. 194?202). Tahoe City, CA: Morgan Kaufmann."},{"key":"CR11","first-page":"1022","volume-title":"Proceedings of the 13th International Joint Conference on Artifical Intelligence","author":"U. M. Fayyad","year":"1993","unstructured":"FayyadU. M., & IraniK. B. (1993). Multi-interval discretization of continuous-valued attributes for classification learning. InProceedings of the 13th International Joint Conference on Artifical Intelligence (pp. 1022?1027). Chambery, France: Morgan Kaufmann."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/12.53586","volume":"39","author":"S. J. Friedman","year":"1990","unstructured":"FriedmanS. J. & SupowitK. J. (1990). Finding the optimal variable ordering for binary decision diagrams.IEEE Transactions on Computers, 39, 710?713.","journal-title":"IEEE Transactions on Computers"},{"key":"CR13","series-title":"Technical Report WL-TR-94-1102","doi-asserted-by":"crossref","DOI":"10.21236\/ADA285582","volume-title":"Machine learning: A comparative study of pattern theory and C4.5","author":"J. A. Goldman","year":"1994","unstructured":"GoldmanJ. A. (1994). Machine learning: A comparative study of pattern theory and C4.5. Technical Report WL-TR-94?1102, Wright Laboratory, USAF, WL\/AART, WPAFB, OH."},{"key":"CR14","first-page":"472","volume-title":"Proceedings of the International Conference on Computer Aided Design","author":"N. Ishiura","year":"1991","unstructured":"IshiuraN., SawadaH., & YajimaS. (1991). Minimization of binary decision diagrams based on exchanges of variables. InProceedings of the International Conference on Computer Aided Design (pp. 472?475). Santa Clara, CA: IEEE Computer Society Press."},{"key":"CR15","series-title":"UC Berkeley Tech. Report ERL M90\/125","volume-title":"Multi-valued decision diagrams","author":"T. Kam","year":"1990","unstructured":"KamT. & BraytonR. (1990). Multi-valued decision diagrams.UC Berkeley Tech. Report ERL M90\/125, EECS Department, Berkeley, CA."},{"key":"CR16","first-page":"613","volume-title":"Proceedings of the Twelfth National Conference on Artificial Intelligence","author":"R. Kohavi","year":"1994","unstructured":"KohaviR. (1994). Bottom-up induction of oblivious read-once decision graphs: Strengths and limitations. InProceedings of the Twelfth National Conference on Artificial Intelligence (pp. 613?618). Tahoe City, CA: Morgan Kaufmann."},{"key":"CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3860-5","volume-title":"An Introduction to Kolmogorov Complexity","author":"M. Li","year":"1993","unstructured":"LiM. & Vit\u00e1nyiP. M. B. (1993).An Introduction to Kolmogorov Complexity. New York, NY: Springer-Verlag."},{"key":"CR18","series-title":"Technical Report 91-154","volume-title":"Initializing ID5R with a domain theory: some negative results","author":"J. J. Mahoney","year":"1991","unstructured":"MahoneyJ. J. & MooneyR. J. (1991). Initializing ID5R with a domain theory: some negative results. Technical Report 91?154, CS Department, University of Texas at Austin, Austin, TX."},{"key":"CR19","volume-title":"Modified Branching Programs and Their Computational Power","author":"C. Meinel","year":"1989","unstructured":"MeinelC. (1989).Modified Branching Programs and Their Computational Power. New York, NY: Springer-Verlag."},{"key":"CR20","volume-title":"Repository of Machine Learning Databases ? Machine readable data repository","author":"P. M. Murphy","year":"1991","unstructured":"MurphyP. M. & AhaD. W. (1991).Repository of Machine Learning Databases ? Machine readable data repository. University of California, Irvine."},{"key":"CR21","unstructured":"Oliveira, A. L. (1994).Inductive Learning by Selection of Minimal Complexity Representations. PhD thesis, UC Berkeley, Berkeley, CA. Also available as UCB\/ERL Technical Report M94\/97."},{"key":"CR22","first-page":"911","volume-title":"Advances in Neural Information Processing Systems 6","author":"A. L. Oliveira","year":"1993","unstructured":"OliveiraA. L. & VincentelliA. S. (1993). Learning complex Boolean functions: algorithms and applications. InAdvances in Neural Information Processing Systems 6 (pp. 911?918). Denver, CO: Morgan Kaufmann."},{"key":"CR23","first-page":"421","volume-title":"Proceedings of the Twelfth International Conference on Machine Learning","author":"A. L. Oliveira","year":"1995","unstructured":"OliveiraA. L. & VincentelliA. S. (1995). Inferring reduced ordered decision graphs of minimal description length. InProceedings of the Twelfth International Conference on Machine Learning (pp. 421?429). Tahoe City, CA: Morgan Kaufmann."},{"key":"CR24","series-title":"Technical Report 92\/173","volume-title":"Decision graphs ? an extension of decision trees","author":"J. J. Oliver","year":"1993","unstructured":"OliverJ. J. (1993). Decision graphs ? an extension of decision trees. Technical Report 92\/173, Monash University, Clayton, Victoria, Australia."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1022611825350","volume":"5","author":"G. Pagallo","year":"1990","unstructured":"PagalloG. & HausslerD. (1990). Boolean feature discovery in empirical learning.Machine Learning, 5, 71?100.","journal-title":"Machine Learning"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1080\/03081077808960690","volume":"4","author":"J. Pearl","year":"1978","unstructured":"PearlJ. (1978). On the connection between the complexity and credibility of inferred models.Journal of General Systems, 4, 255?264.","journal-title":"Journal of General Systems"},{"key":"CR27","first-page":"81","volume":"1","author":"J. R. Quinlan","year":"1986","unstructured":"QuinlanJ. R. (1986). Induction of decision trees.Machine Learning, 1, 81?106.","journal-title":"Machine Learning"},{"key":"CR28","volume-title":"C4.5 ? Programs for Machine Learning","author":"J. R. Quinlan","year":"1993","unstructured":"QuinlanJ. R. (1993).C4.5 ? Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","volume":"80","author":"J. R. Quinlan","year":"1989","unstructured":"QuinlanJ. R. & RivestR. L. (1989). Inferring decision trees using the minimum description length principles.Information and Computation, 80, 227?248.","journal-title":"Information and Computation"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"RissanenJ. (1978). Modeling by shortest data description.Automatica, 14, 465?471.","journal-title":"Automatica"},{"key":"CR31","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1214\/aos\/1176350051","volume":"14","author":"J. Rissanen","year":"1986","unstructured":"RissanenJ. (1986). Stochastic complexity and modeling.Annals of Statististics, 14, 1080?1100.","journal-title":"Annals of Statististics"},{"key":"CR32","first-page":"42","volume-title":"Proceeddings of the International Conference on Computer Aided Design","author":"R. Rudell","year":"1993","unstructured":"RudellR. (1993). Dynamic variable ordering for ordered binary decision diagrams. InProceeddings of the International Conference on Computer Aided Design (pp. 42?47). Santa Clara, CA: IEEE Computer Society Press."},{"key":"CR33","first-page":"259","volume-title":"Proceedings of the Eleventh International Conference on Machine Learning","author":"C. Schaffer","year":"1994","unstructured":"SchafferC. (1994). A conservation law for generalization performance. InProceedings of the Eleventh International Conference on Machine Learning (pp. 259?265). New Brunswick, NJ: Morgan Kaufmann."},{"key":"CR34","first-page":"713","volume":"57","author":"C. E. Shannon","year":"1938","unstructured":"ShannonC. E. (1938). A symbolic analysis of relay and switching circuits.Transactions AIEE, 57, 713?723.","journal-title":"Transactions AIEE"},{"key":"CR35","first-page":"225","volume-title":"Proceedings of the Design Automation Conference","author":"T. R. Shiple","year":"1994","unstructured":"ShipleT. R., HojatiR., VincentelliA. L. S., & BraytonR. K. (1994). Heuristic minimization of BDDs using don't cares. InProceedings of the Design Automation Conference (pp. 225?231). San Diego, CA: ACM Press."},{"key":"CR36","first-page":"389","volume-title":"Proceedings of the Fourth International Symposium on Algorithms and Computation","author":"S. Tani","year":"1993","unstructured":"TaniS., HamaguchiK., & YajimaS. (1993). The complexity of the optimal variable ordering problems of shared binary decision diagrams. InProceedings of the Fourth International Symposium on Algorithms and Computation (pp. 389?98). Hong Kong: Springer-Verlag."},{"key":"CR37","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022646101185","volume":"11","author":"C. S. Wallace","year":"1993","unstructured":"WallaceC. S. & PatrickJ. D. (1993). Coding decision trees.Machine Learning, 11, 7?22.","journal-title":"Machine Learning"},{"key":"CR38","first-page":"223","volume-title":"Proceedings of the Eight International Conference on Machine Learning","author":"D. S. Yang","year":"1991","unstructured":"YangD. S., RendellL., & BlixG. (1991). Fringe-like feature construction: A comparative study and a unifying scheme. InProceedings of the Eight International Conference on Machine Learning (pp. 223?227). Evanston, IL: Morgan Kaufmann."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00115299.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00115299\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00115299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T14:09:21Z","timestamp":1554732561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00115299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["BF00115299"],"URL":"https:\/\/doi.org\/10.1007\/bf00115299","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}