{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:10:53Z","timestamp":1776784253171,"version":"3.51.2"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s11390-019-1921-0","type":"journal-article","created":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T17:52:34Z","timestamp":1553709154000},"page":"494-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Lossless Compression of Random Forests"],"prefix":"10.1007","volume":"34","author":[{"given":"Amichai","family":"Painsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saharon","family":"Rosset","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,22]]},"reference":[{"key":"1921_CR1","unstructured":"Breiman L, Friedman J, Olshen R A, Stone C J. Classification and Regression Trees (1st edition). Chapman and Hall\/CRC, 1984."},{"key":"1921_CR2","unstructured":"Quinlan J R. C4.5: Programs for Machine Learning (1st edition). Morgan Kaufmann Publishers, 1992."},{"issue":"2","key":"1921_CR3","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman L. Bagging predictors. Machine Learning, 1996, 24(2): 123-140.","journal-title":"Machine Learning"},{"key":"1921_CR4","doi-asserted-by":"crossref","unstructured":"Schapire R E. The boosting approach to machine learning: An overview. In Nonlinear Estimation and Classification, Denison D D, Hansen M H, Holmes C C, Mallick B, Yu B (eds.), Springer, 2003, pp.149-171.","DOI":"10.1007\/978-0-387-21579-2_9"},{"issue":"1","key":"1921_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L. Random forests. Machine Learning, 2001, 45(1): 5-32.","journal-title":"Machine Learning"},{"key":"1921_CR6","doi-asserted-by":"crossref","unstructured":"Friedman J, Hastie T, Tibshirani R. The Elements of Statistical Learning: Data Mining, Inference, and Prediction (1st edition). Springer, 2001.","DOI":"10.1007\/978-0-387-21606-5_1"},{"key":"1921_CR7","doi-asserted-by":"crossref","unstructured":"Painsky A, Rosset S. Compressing random forests. In Proc. the 16th International Conference on Data Mining, December 2016, pp.1131-1136.","DOI":"10.1109\/ICDM.2016.0148"},{"key":"1921_CR8","doi-asserted-by":"crossref","unstructured":"Geurts P. Some enhancements of decision tree bagging. In Proc. the 4th European Conference Principles of Data Mining and Knowledge Discovery, Sept. 2000, pp.136-147.","DOI":"10.1007\/3-540-45372-5_14"},{"issue":"4","key":"1921_CR9","doi-asserted-by":"publisher","first-page":"2049","DOI":"10.1214\/10-AOAS367","volume":"4","author":"N Meinshausen","year":"2010","unstructured":"Meinshausen N. Node harvest. The Annals of Applied Statistics, 2010, 4(4): 2049-2072.","journal-title":"The Annals of Applied Statistics"},{"issue":"3","key":"1921_CR10","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1214\/07-AOAS148","volume":"2","author":"JH Friedman","year":"2008","unstructured":"Friedman J H, Popescu B E. Predictive learning via rule ensembles. The Annals of Applied Statistics, 2008, 2(3): 916-954.","journal-title":"The Annals of Applied Statistics"},{"key":"1921_CR11","doi-asserted-by":"crossref","unstructured":"Bernard S, Heutte L, Adam S. On the selection of decision trees in random forests. In Proc. the 2009 International Joint Conference on Neural Networks, June 2009, pp.302-307.","DOI":"10.1109\/IJCNN.2009.5178693"},{"key":"1921_CR12","unstructured":"Joly A, Schnitzler F, Geurts P, Wehenkel L. L\n                           1-based compression of random forest models. In Proc. European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, April 2012, pp.375-380."},{"key":"1921_CR13","doi-asserted-by":"crossref","unstructured":"Bucilu\u0103 C, Caruana R, Niculescu-Mizil A. Model compression. In Proc. the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 2006, pp.535-541.","DOI":"10.1145\/1150402.1150464"},{"issue":"2","key":"1921_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0888-613X(03)00021-5","volume":"33","author":"D Tikk","year":"2003","unstructured":"Tikk D, K\u00f3czy L T, Gedeon T D. A survey on universal approximation and its limits in soft computing techniques. International Journal of Approximate Reasoning, 2003, 33(2): 185-202.","journal-title":"International Journal of Approximate Reasoning"},{"issue":"04","key":"1921_CR15","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1142\/S0129054190000291","volume":"1","author":"J Katajainen","year":"1990","unstructured":"Katajainen J, M\u00e4kinen E. Tree compression and optimization with applications. International Journal of Foundations of Computer Science, 1990, 1(04): 425-447.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"1921_CR16","unstructured":"Chen S, Reif J H. Efficient lossless compression of trees and graphs. In Proc. the 6th Data Compression Conference, March 1996, pp.428."},{"key":"1921_CR17","unstructured":"Painsky A, Wornell G W. On the universality of the logistic loss function. arXiv:1805.03804, 2018. \n                    https:\/\/arxiv.org\/pdf\/1805.03804.pdf\n                    \n                  , September 2018."},{"key":"1921_CR18","unstructured":"Painsky A, Wornell G W. Bregman divergence bounds and the universality of the logarithmic loss. arXiv:1810.07014, 2018. \n                    http:\/\/export.arxiv.org\/pdf\/1810.07014\n                    \n                  , September 2018."},{"issue":"3","key":"1921_CR19","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1198\/106186006X133933","volume":"15","author":"T Hothorn","year":"2006","unstructured":"Hothorn T, Hornik K, Zeileis A. Unbiased recursive partitioning: A conditional inference framework. Journal of Computational and Graphical Statistics, 2006, 15(3): 651-674.","journal-title":"Journal of Computational and Graphical Statistics"},{"issue":"11","key":"1921_CR20","doi-asserted-by":"publisher","first-page":"2142","DOI":"10.1109\/TPAMI.2016.2636831","volume":"39","author":"A Painsky","year":"2017","unstructured":"Painsky A, Rosset S. Cross-validated variable selection in tree-based methods improves predictive performance. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2017, 39(11): 2142-2153.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"1921_CR21","doi-asserted-by":"crossref","unstructured":"Sayood K. Introduction to Data Compression (5th Edition). Morgan Kaufmann, 2017.","DOI":"10.1016\/B978-0-12-809474-7.00019-7"},{"issue":"7","key":"1921_CR22","doi-asserted-by":"publisher","first-page":"4094","DOI":"10.1109\/TIT.2012.2195769","volume":"58","author":"W Szpankowski","year":"2012","unstructured":"Szpankowski W, Weinberger M J. Minimax pointwise redundancy for memoryless models over large alphabets. IEEE Transactions on Information Theory, 2012, 58(7): 4094-4104.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"1921_CR23","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1109\/TIT.2004.830761","volume":"50","author":"A Orlitsky","year":"2004","unstructured":"Orlitsky A, Santhanam N P, Zhang J. Universal compression of memoryless sources over unknown alphabets. IEEE Transactions on Information Theory, 2004, 50(7): 1469-1481.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1921_CR24","doi-asserted-by":"crossref","unstructured":"Painsky A, Rosset S, Feder M. Universal compression of memoryless sources over large alphabets via independent component analysis. In Proc. the 2015 Data Compression Conference, April 2015, pp.213-222.","DOI":"10.1109\/DCC.2015.48"},{"key":"1921_CR25","doi-asserted-by":"crossref","unstructured":"Painsky A, Rosset S, Feder M. A simple and efficient approach for adaptive entropy coding over large alphabets. In Proc. the 2016 Data Compression Conference, March 2016, pp.369-378.","DOI":"10.1109\/DCC.2016.59"},{"issue":"10","key":"1921_CR26","doi-asserted-by":"publisher","first-page":"6514","DOI":"10.1109\/TIT.2017.2728017","volume":"63","author":"A Painsky","year":"2017","unstructured":"Painsky A, Rosset S, Feder M. Large alphabet source coding using independent component analysis. IEEE Transactions on Information Theory, 2017, 63(10): 6514-6529.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"22","key":"1921_CR27","doi-asserted-by":"publisher","first-page":"5875","DOI":"10.1109\/TSP.2018.2872006","volume":"66","author":"A Painsky","year":"2018","unstructured":"Painsky A, Rosset S, Feder M G. Linear independent component analysis over finite fields: Algorithms and bounds. IEEE Transactions on Signal Processing, 2018, 66(22): 5875-5886.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1","key":"1921_CR28","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","volume":"10","author":"S Zaks","year":"1980","unstructured":"Zaks S. Lexicographic generation of ordered trees. Theoretical Computer Science, 1980, 10(1): 63-82.","journal-title":"Theoretical Computer Science"},{"key":"1921_CR29","first-page":"1705","volume":"6","author":"A Banerjee","year":"2005","unstructured":"Banerjee A, Merugu S, Dhillon I S, Ghosh J. Clustering with Bregman divergences. Journal of Machine Learning Research, 2005, 6: 1705-1749.","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"1921_CR30","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd S. P. Least squares quantization in PCM. IEEE Transactions on Information Theory, 1982, 28(2): 129-137.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1921_CR31","unstructured":"Cover T M, Thomas J A. Elements of Information Theory (2nd edition, e-book). John Wiley & Sons, 2012."},{"key":"1921_CR32","doi-asserted-by":"crossref","unstructured":"Deutsch L P. Gzip file format specification version 4.3. 1996. \n                    https:\/\/www.rfc-editor.org\/rfc\/rfc1952.txt\n                    \n                  , Oct. 2018.","DOI":"10.17487\/rfc1952"},{"issue":"4","key":"1921_CR33","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1109\/TCOM.1964.1088973","volume":"12","author":"L Schuchman","year":"1964","unstructured":"Schuchman L. Dither signals and their effect on quantization noise. IEEE Transactions on Communication Technology, 1964, 12(4): 162-165.","journal-title":"IEEE Transactions on Communication Technology"},{"issue":"1","key":"1921_CR34","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"P Geurts","year":"2006","unstructured":"Geurts P, Ernst D, Wehenkel L. Extremely randomized trees. Machine Learning, 2006, 63(1): 3-42.","journal-title":"Machine Learning"},{"key":"1921_CR35","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1613\/jair.2470","volume":"32","author":"FT Liu","year":"2008","unstructured":"Liu F T, Ting K M, Yu Y, Zhou Z H. Spectrum of variable-random trees. Journal of Artificial Intelligence Research, 2008, 32: 355-384.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"1921_CR36","unstructured":"Zhou Z H, Feng J. Deep forest: Towards an alternative to deep neural networks. arXiv:1702.08835, 2017. \n                    https:\/\/arxiv.org\/pdf\/1702.08835v2.pdf\n                    \n                  , September 2018."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-019-1921-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-019-1921-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-019-1921-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,21]],"date-time":"2020-03-21T00:15:31Z","timestamp":1584749731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-019-1921-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["1921"],"URL":"https:\/\/doi.org\/10.1007\/s11390-019-1921-0","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3]]},"assertion":[{"value":"8 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}