{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T13:32:52Z","timestamp":1725975172385},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811302916"},{"type":"electronic","value":"9789811302923"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-13-0292-3_2","type":"book-chapter","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T18:39:00Z","timestamp":1523644740000},"page":"24-37","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rank Forest: Systematic Attribute Sub-spacing in Decision Forest"],"prefix":"10.1007","author":[{"given":"Zaheer","family":"Babar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md Zahidul","family":"Islam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sameen","family":"Mansha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,14]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546914","volume-title":"The Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data","author":"R Feldman","year":"2006","unstructured":"Feldman, R., Sanger, J.: The Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data. Cambridge University Press, Cambridge (2006)"},{"key":"2_CR2","unstructured":"Martin, J.K., Hirschberg, D.S.: The time complexity of decision tree induction (1995)"},{"key":"2_CR3","series-title":"Intelligent Systems Reference Library","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22661-8","volume-title":"Average Time Complexity of Decision Trees","author":"I Chikalov","year":"2011","unstructured":"Chikalov, I.: Average Time Complexity of Decision Trees. Intelligent Systems Reference Library, vol. 12. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22661-8"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45014-9_1","volume-title":"Multiple Classifier Systems","author":"TG Dietterich","year":"2000","unstructured":"Dietterich, T.G.: Ensemble methods in machine learning. In: Kittler, J., Roli, F. (eds.) MCS 2000. LNCS, vol. 1857, pp. 1\u201315. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45014-9_1"},{"key":"2_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. Mach. Learn. 45, 5\u201332 (2001). https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach. Learn."},{"key":"2_CR6","first-page":"1063","volume":"13","author":"G Biau","year":"2012","unstructured":"Biau, G., Biau, G.: Analysis of a random forests model. J. Mach. Learn. Res. 13, 1063\u20131095 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1093\/bioinformatics\/btn356","volume":"24","author":"D Amaratunga","year":"2008","unstructured":"Amaratunga, D., Cabrera, J., Lee, Y.-S.: Enriched random forests. Bioinformatics 24, 2010\u20132014 (2008). https:\/\/doi.org\/10.1093\/bioinformatics\/btn356","journal-title":"Bioinformatics"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Zhao, H., Williams, G.J., Huang, J.Z.: wsrf: an R package for classification with scalable weighted subspace random forests (2017). jstatsoft.org","DOI":"10.18637\/jss.v077.i03"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Hssina, B., Merbouha, A., Ezzikouri, H., Erritali, M.: A comparative study of decision tree ID3 and C4.5. Int. J. Adv. Comput. Sci. Appl. (IJACSA) 4(2) (2014)","DOI":"10.14569\/SpecialIssue.2014.040203"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-25704-9_7","volume-title":"Data Security and Security Data","author":"MZ Islam","year":"2012","unstructured":"Islam, M.Z.: EXPLORE: a novel decision tree classification algorithm. In: MacKinnon, L.M. (ed.) BNCOD 2010. LNCS, vol. 6121, pp. 55\u201371. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-25704-9_7"},{"key":"2_CR11","volume-title":"C4.5: Programs for Machine Learning","author":"JR Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, Los Altos (1993)"},{"key":"2_CR12","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1, 81\u2013106 (1986)","journal-title":"Mach. Learn."},{"key":"2_CR13","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L.: Bagging predictors. Mach. Learn. 24, 123\u2013140 (1996)","journal-title":"Mach. Learn."},{"key":"2_CR14","volume-title":"Data Mining: Concepts and Techniques","author":"J Han","year":"2006","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, Los Altos (2006)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1109\/34.709601","volume":"20","author":"TK Ho","year":"1998","unstructured":"Ho, T.K.: The random subspace method for constructing decision forests. IEEE Trans. Pattern Anal. Mach. Intell. 20, 832\u2013844 (1998). https:\/\/doi.org\/10.1109\/34.709601","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-319-31753-3_25","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"MN Adnan","year":"2016","unstructured":"Adnan, M.N., Islam, M.Z.: Forest CERN: a new decision forest building technique. In: Bailey, J., Khan, L., Washio, T., Dobbie, G., Huang, J.Z., Wang, R. (eds.) PAKDD 2016. LNCS (LNAI), vol. 9651, pp. 304\u2013315. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31753-3_25"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Li, J., Liu, H.: Ensembles of cascading trees. In: Proceedings of the Third IEEE International Conference on Data Mining, pp. 585\u2013588 (2003)","DOI":"10.1109\/ICDM.2003.1250983"},{"key":"2_CR18","unstructured":"Islam, M.Z., Giggins, H.: Knowledge discovery through SysFor -a systematically developed forest of multiple decision trees. In: Proceedings of the 9th Australasian Data Mining Conference (2011)"},{"key":"2_CR19","unstructured":"Xu, Y., Jones, G., Li, J., Wang, B., Sun, C.: A study on mutual information-based feature selection for text categorization. J. Comput. Inf. Syst. 3(3), 203\u2013213 (2005)"}],"container-title":["Communications in Computer and Information Science","Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-0292-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T19:56:24Z","timestamp":1571169384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-0292-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811302916","9789811302923"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-0292-3_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]}}}