{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:59:35Z","timestamp":1725512375189},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681243"},{"type":"electronic","value":"9783540681250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68125-0_36","type":"book-chapter","created":{"date-parts":[[2008,5,10]],"date-time":"2008-05-10T07:40:05Z","timestamp":1210405205000},"page":"405-416","source":"Crossref","is-referenced-by-count":3,"title":["BOAI: Fast Alternating Decision Tree Induction Based on Bottom-Up Evaluation"],"prefix":"10.1007","author":[{"given":"Bishan","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tengjiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongqing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences\u00a055(1), 119\u2013139 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR2","volume-title":"C4.5: Programs for Machine Learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)"},{"key":"36_CR3","unstructured":"Freund, Y., Mason, L.: The alternating decision tree learning algorithm. In: 16th International Conference on Machine Learning, pp. 124\u2013133 (1999)"},{"key":"36_CR4","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques","author":"I.H. Witten","year":"2005","unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)","edition":"2"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Liu, K.Y., Lin, J., Zhou, X., Wong, S.: Boosting Alternating Decision Trees Modeling of Disease Trait Information. BMC Genetics 6(1) (2005)","DOI":"10.1186\/1471-2156-6-S1-S132"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Mehta, M., Agrawal, R., Rissanen, J.: SLIQ: A fast scalable classifier for data mining. In: 5th International Conference on Extending Database Technology, pp. 18\u201332 (1996)","DOI":"10.1007\/BFb0014141"},{"key":"36_CR7","unstructured":"Shafer, J., Agrawal, R., Mehta, M.: SPRINT: A scalable parallel classifier for data mining. In: 22nd International Conference on Very Large Databases, pp. 544\u2013555 (1996)"},{"key":"36_CR8","unstructured":"Rastogi, R., Shim, K.: PUBLIC: A Decision Tree Classifier that Integrates Pruning and Building. In: 24th International Conference on Very Large Database, pp. 315\u2013344 (1998)"},{"key":"36_CR9","unstructured":"Gehrke, J., Ramakrishnan, R., Ganti, V.: Rainforest: A framework for fast decision tree construction of large data sets. In: 24th International Conference on Very Large Database, pp. 127\u2013162 (1998)"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Gehrke, J., Ganti, V., Ramakrishnan, R., Loh, W.Y.: BOAT|optimistic decision tree construction. In: ACM SIGMOD International Conference on Management of Data, pp. 169\u2013180 (1999)","DOI":"10.1145\/304182.304197"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Pfahringer, B., Holmes, G., Kirkby, R.: Optimizing the Induction of Alternating Decision Trees. In: 5th Pasific-Asia Conference on Knowledge Discovery and Data Mining, pp. 477\u2013487 (2001)","DOI":"10.1007\/3-540-45357-1_50"},{"key":"36_CR12","unstructured":"Vanassche, A., Krzywania, D., Vaneyghen, J., Struyf, J., Blockeel, H.: First order alternating decision trees. In: 13th International Conference on Inductive Logic Programming, pp. 116\u2013125 (2003)"},{"key":"36_CR13","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 Journal\u00a045, 5\u201332 (2001)","journal-title":"Machine Learning Journal"},{"key":"36_CR14","unstructured":"http:\/\/www.salford-systems.com\/products-treenet.html"},{"key":"36_CR15","unstructured":"IBM Intelligent information systems, \n                    \n                      http:\/\/www.almaden.ibm.com\/software\/quest\/resources\/"},{"key":"36_CR16","unstructured":"Maloof, M.: Learning when data sets are imbalanced and when costs are unequal and unknown. In: ICML Workshop on Learning from Imbalanced Data Sets (2003)"},{"key":"36_CR17","unstructured":"Chen, C., Liaw, A., Breiman, L.: Using Random Forest to Learn Imbalanced Data. Technical Report 666, Statistics Department, University of California at Berkeley (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68125-0_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:36:40Z","timestamp":1620016600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68125-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681243","9783540681250"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68125-0_36","relation":{},"subject":[]}}