{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:15:50Z","timestamp":1759331750165},"reference-count":48,"publisher":"Walter de Gruyter GmbH","issue":"2","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>One of the most commonly used predictive models in classification is the decision tree (DT). The task of a DT is to map observations to target values. In the DT, each branch represents a rule. A rule\u2019s consequent is the leaf of the branch and its antecedent is the conjunction of the features. Most applied algorithms in this field use the concept of Information Entropy and Gini Index as the splitting criterion when building a tree. In this paper, a new splitting criterion to build DTs is proposed. A splitting criterion specifies the tree\u2019s best splitting variable as well as the variable\u2019s threshold for further splitting. Using the idea from classical Forward Selection method and its enhanced versions, the variable having the largest absolute correlation with the target value is chosen as the best splitting variable at each node. Then, the idea of maximizing the margin between classes in a support vector machine (SVM) is used to find the best classification threshold on the selected variable. This procedure will execute recursively at each node, until reaching the leaf nodes. The final decision tree has a shorter height than previous methods, which effectively reduces useless variables and the time needed for classification of future data. Unclassified regions are also generated under the proposed method, which can be interpreted as an advantage or disadvantage. The simulation results demonstrate an improvement in the generated decision tree compared to previous methods.<\/jats:p>","DOI":"10.2478\/s13537-011-0017-x","type":"journal-article","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T23:43:15Z","timestamp":1309218195000},"source":"Crossref","is-referenced-by-count":5,"title":["Correlation based splitting criterionin multi branch decision tree"],"prefix":"10.2478","volume":"1","author":[{"given":"Nima","family":"Salehi-Moghaddami","sequence":"first","affiliation":[]},{"given":"Hadi","family":"Yazdi","sequence":"additional","affiliation":[]},{"given":"Hanieh","family":"Poostchi","sequence":"additional","affiliation":[]}],"member":"374","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1016\/j.eswa.2006.12.017","volume":"34","author":"Y.S. Kim","year":"2008","unstructured":"Kim Y.S., Comparison of the decision tree, artificial neural network, and linear regression methods based on the number and types of independent variables and sample size, EXPERT SYST APPL, 2008, 34, 1227\u20131234","journal-title":"EXPERT SYST APPL"},{"key":"17_CR2","volume-title":"Classification and Regression Trees, The Wadsworth statistics\/probability series","author":"L. Breiman","year":"1984","unstructured":"Breiman L., Friedman J., Stone C.J., Olshen R.A., Classification and Regression Trees, The Wadsworth statistics\/probability series, Wadsworth and Brooks, Monterey, CA, 1984"},{"key":"17_CR3","first-page":"81","volume":"1","author":"J.R. Quinlan","year":"1986","unstructured":"Quinlan J.R., Induction of Decision Trees, MACH LEARN, 1986, 1, 81\u2013106","journal-title":"MACH LEARN"},{"key":"17_CR4","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 Mateo, California, 1993"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.2307\/2986296","volume":"29","author":"G.V. Kass","year":"1980","unstructured":"Kass G.V., An exploratory technique for investigating large quantities of categorical data, APPL STATIST, 1980, 29, 119\u2013127","journal-title":"APPL STATIST"},{"key":"17_CR6","first-page":"45","volume":"19","author":"C.E. Brodley","year":"1995","unstructured":"Brodley C.E., Utgoff P.E., Multivariate decision trees, MACH LEARN, 1995, 19, 45\u201377","journal-title":"MACH LEARN"},{"key":"17_CR7","first-page":"815","volume":"7","author":"W.-Y. Loh","year":"1997","unstructured":"Loh W.-Y., Shih Y.-S., Split selection methods for classification trees, STAT SINICA, 1997, 7, 815\u2013840","journal-title":"STAT SINICA"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"715","DOI":"10.2307\/2289295","volume":"83","author":"W.-Y. Loh","year":"1988","unstructured":"Loh W.-Y., Vanichsetakul N., Tree-structured classification via generalized discriminant analysis (with discussion), J AM STAT ASSOC, 1988, 83, 715\u2013728","journal-title":"J AM STAT ASSOC"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02032305","volume":"52","author":"W. Muller","year":"1994","unstructured":"Muller W., Wysotzki F., Automatic construction of decision trees for classification, ANN OPER RES, 1994, 52, 231\u2013247","journal-title":"ANN OPER RES"},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1023\/A:1009887311454","volume":"4","author":"R. Rastogi","year":"2000","unstructured":"Rastogi R., Shim K., PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning, DATA MIN KNOWL DISC, 2000, 4, 315\u2013344","journal-title":"DATA MIN KNOWL DISC"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/A:1007608224229","volume":"40","author":"T.-S. Lim","year":"2000","unstructured":"Lim T.-S., Loh W.-Y., Shih Y.-S., A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms, MACH LEARN, 2000, 40, 203\u2013228","journal-title":"MACH LEARN"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Maruf Hossain M., Rafiul Hassan M., Bailey J., ROC-tree: A Novel Decision Tree Induction Algorithm Based on Receiver Operating Characteristics to Classify Gene Expression Data, 8th SIAM International Conference on Data Mining (SDM08) (April 2008 Georgia), 455\u2013465","DOI":"10.1137\/1.9781611972788.41"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/69.991727","volume":"14","author":"S. Ruggieri","year":"2002","unstructured":"Ruggieri S., Efficient C4.5, IEEE T KNOWL DATA EN, 2002, 14, 438\u2013444","journal-title":"IEEE T KNOWL DATA EN"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.ins.2004.12.005","volume":"172","author":"Z. Qin","year":"2005","unstructured":"Qin Z., Lawry J., Decision tree learning with fuzzy labels, INFORM SCIENCES, 2005, 172, 91\u2013129","journal-title":"INFORM SCIENCES"},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.eswa.2006.08.008","volume":"34","author":"M.J. Aitkenhead","year":"2008","unstructured":"Aitkenhead M.J., A co-evolving decision tree classification method, EXPERT SYST APPL, 2008, 34, 18\u201325","journal-title":"EXPERT SYST APPL"},{"key":"17_CR16","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10994-008-5077-3","volume":"73","author":"C. Vens","year":"2008","unstructured":"Vens C., Struyf J., Schietgat L., D\u017eeroski S., Blockeel H., Decision trees for hierarchical multi-label classification, MACH LEARN, 2008, 73, 185\u2013214","journal-title":"MACH LEARN"},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"4838","DOI":"10.1016\/j.eswa.2008.05.044","volume":"36","author":"Y.L. Chen","year":"2009","unstructured":"Chen Y.L., Hu H.W., Tang K., Constructing a decision tree from data with hierarchical class labels, EXPERT SYST APPL, 2009, 36, 4838\u20134847","journal-title":"EXPERT SYST APPL"},{"key":"17_CR18","unstructured":"Hansen S.E., Olsson R., Improving decision tree pruning through automatic programming, Proceedings of the Norwegian Conference on Informatics (NIK-2007) (November 2007, Holmenkollen Park Hotel Rica, Oslo), 2007, 31\u201340"},{"key":"17_CR19","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.jcss.2007.06.014","volume":"74","author":"D. Sieling","year":"2008","unstructured":"Sieling D., Minimization of decision trees is hard to approximate, J COMPUT SYST SCI, 2008, 74, 394\u2013403","journal-title":"J COMPUT SYST SCI"},{"key":"17_CR20","doi-asserted-by":"crossref","first-page":"1678","DOI":"10.1002\/pmic.200300521","volume":"3","author":"M.K. Markey","year":"2003","unstructured":"Markey M.K., Tourassi G.D., Floyd C.E., Decision tree classification of proteins identified by mass spectrometry of blood serum samples from people with and without lung cancer, PROTEOMICS, 2003, 3, 1678\u20131679","journal-title":"PROTEOMICS"},{"key":"17_CR21","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1016\/S0969-8043(03)00094-0","volume":"58","author":"B. Zmazek","year":"2003","unstructured":"Zmazek B., Todorovski L., Dzeroski S., Vaupotic J., Kobal I., Application of decision trees to the analysis of soil radon data for earthquake prediction, APPL RADIAT ISOTOPES, 2003, 58, 697\u2013706","journal-title":"APPL RADIAT ISOTOPES"},{"key":"17_CR22","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/j.ijar.2007.10.004","volume":"48","author":"P. Pulkkinen","year":"2008","unstructured":"Pulkkinen P., Koivisto H., Fuzzy classifier identification using decision tree and multiobjective evolutionary algorithms, INT J APPROX REASON, 2008, 48, 526\u2013543","journal-title":"INT J APPROX REASON"},{"key":"17_CR23","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1109\/TFUZZ.2009.2038712","volume":"18","author":"H.K.P. Pulkkinen","year":"2010","unstructured":"Pulkkinen H.K.P., A Dynamically Constrained Multiobjective Genetic Fuzzy System for Regression Problems, IEEE T FUZZY SYST, 2010, 18, 161\u2013177","journal-title":"IEEE T FUZZY SYST"},{"key":"17_CR24","volume-title":"Machine Learning","author":"T.M. Mitchell","year":"1997","unstructured":"Mitchell T.M., Machine Learning, McGraw-Hill International, New York, 1997"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Mehta M., Agrawal R., Riassnen J., SLIQ: a fast scalable classifier for data mining, Extending Database Technology, (March, Avignon, France), 1996, 18\u201333","DOI":"10.1007\/BFb0014141"},{"key":"17_CR26","doi-asserted-by":"crossref","first-page":"119","DOI":"10.2307\/2986296","volume":"29","author":"G.V. Kass","year":"1980","unstructured":"Kass G.V., An exploratory technique for investigating large quantities of categorical data, APPL STATIST, 1980, 29, 119\u2013127","journal-title":"APPL STATIST"},{"key":"17_CR27","first-page":"39","volume":"38","author":"J. Mingers","year":"1987","unstructured":"Mingers J., Expert systems \u2014 rule induction with statistical data, J OPER RES SOC, 1987, 38, 39\u201347","journal-title":"J OPER RES SOC"},{"key":"17_CR28","first-page":"319","volume":"3","author":"J. Mingers","year":"1989","unstructured":"Mingers J., An Empirical Comparison of Selection Measures for Decision-Tree Induction, MACH LEARN, 1989, 3, 319\u2013342","journal-title":"MACH LEARN"},{"key":"17_CR29","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1023\/A:1008920224518","volume":"9","author":"Y.-S. Shih","year":"1999","unstructured":"Shih Y.-S., Families of splitting criteria for classification trees, STAT COMPUT, 1999, 9, 309\u2013315","journal-title":"STAT COMPUT"},{"key":"17_CR30","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1016\/j.ins.2008.12.006","volume":"179","author":"B. Chandra","year":"2009","unstructured":"Chandra B., Varghese P.P., Moving towards efficient decision tree construction, INFORM SCIENCES, 2009, 179, 1059\u20131069","journal-title":"INFORM SCIENCES"},{"key":"17_CR31","volume-title":"Face membership authentication using SVM classification tree generated by membership-based LLE data partition, vol. 16","author":"S. Pang","year":"2005","unstructured":"Pang S., Sr K.D., Bang S.Y., Face membership authentication using SVM classification tree generated by membership-based LLE data partition, vol. 16, ETATS-UNIS: Institute of Electrical and Electronics Engineers, New York, NY, 2005"},{"key":"17_CR32","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10115-008-0147-1","volume":"19","author":"S. Pang","year":"2009","unstructured":"Pang S., Kasabov N., Encoding and decoding the knowledge of association rules over SVM classification trees, KNOWL INF SYST, 2009, 19, 79\u2013105","journal-title":"KNOWL INF SYST"},{"key":"17_CR33","volume-title":"Correlation and Regression Analysis: A Historian\u2019s Guide","author":"T.J. Archdeacon","year":"1994","unstructured":"Archdeacon T.J., Correlation and Regression Analysis: A Historian\u2019s Guide, University of Wisconsin Press, Madison, 1994"},{"key":"17_CR34","volume-title":"Applying Regression and Correlation: A Guide for Students and Researchers","author":"J. Miles","year":"2000","unstructured":"Miles J., Shevlin M., Applying Regression and Correlation: A Guide for Students and Researchers, Sage Publications Ltd, London, 2000"},{"key":"17_CR35","volume-title":"Applied Multiple Regression\/Correlation Analysis for the Behavioral Sciences","author":"J. Cohen","year":"2002","unstructured":"Cohen J., Cohen P., West S.G., Aiken L.S., Applied Multiple Regression\/Correlation Analysis for the Behavioral Sciences, 3rd ed., Routledge Academic, Mahwah, NJ, 2002","edition":"3rd ed."},{"key":"17_CR36","volume-title":"Applied Linear Regression","author":"S. Weisberg","year":"1980","unstructured":"Weisberg S., Applied Linear Regression, Wiley, New York, 1980"},{"key":"17_CR37","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B. Efron","year":"2004","unstructured":"Efron B., Hastie T., Johnstone I., Tibshirani R., Least angle regression, ANN STAT, 2004, 32, 407\u2013499","journal-title":"ANN STAT"},{"key":"17_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The Nature of Statistical Learning Theory","author":"V.N. Vapnik","year":"1995","unstructured":"Vapnik V.N., The Nature of Statistical Learning Theory, Springer, New York, 1995"},{"key":"17_CR39","first-page":"975","volume":"5","author":"T.-F. Wu","year":"2004","unstructured":"Wu T.-F., Lin C.-J., Weng R.C., Probability Estimates for Multi-class Classification by Pairwise Coupling, J MACH LEARN RES, 2004, 5, 975\u20131005","journal-title":"J MACH LEARN RES"},{"key":"17_CR40","unstructured":"Hastie T., Tibshirani R., Classification by pairwise coupling, Proceedings of the 1997 conference on Advances in neural information processing systems 10 (Mahwah, NJ, Denver, Colorado, United States) MIT Press, 1998, 507\u2013513"},{"key":"17_CR41","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1162\/15324430152733133","volume":"1","author":"E.L. Allwein","year":"2001","unstructured":"Allwein E.L., Schapire R.E., Singer Y., Reducing multiclass to binary: a unifying approach for margin classifiers, J MACH LEARN RES, 2001, 1, 113\u2013141","journal-title":"J MACH LEARN RES"},{"key":"17_CR42","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.patcog.2007.05.020","volume":"41","author":"J. Zhou","year":"2008","unstructured":"Zhou J., Peng H., Suen C.Y., Data-driven decomposition for multi-class classification, PATTERN RECOGN, 2008, 41, 67\u201376","journal-title":"PATTERN RECOGN"},{"key":"17_CR43","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1109\/72.991427","volume":"13","author":"C.-W. Hsu","year":"2002","unstructured":"Hsu C.-W., Lin C.-J., A comparison of methods for multiclass support vector machines, IEEE T NEURAL NETWOR, 2002, 13, 415\u2013425","journal-title":"IEEE T NEURAL NETWOR"},{"key":"17_CR44","first-page":"59","volume":"2","author":"N. Barakat","year":"2005","unstructured":"Barakat N., Diederich J., Eclectic Rule-Extraction from Support Vector Machines, INT J COMPUT INT SYS, 2005, 2, 59\u201362","journal-title":"INT J COMPUT INT SYS"},{"key":"17_CR45","doi-asserted-by":"crossref","unstructured":"Farquad M., Ravi V., Bapi R.S., Rule extraction using Support Vector Machine based hybrid classifier, IEEE Region 10 Conference TENCON 2008 (2008, Masab Tank, Hyderabad) 2008, 1\u20136","DOI":"10.1109\/TENCON.2008.4766534"},{"key":"17_CR46","volume-title":"The Analysis of Cross-Classifications","author":"H.T. Reynolds","year":"1977","unstructured":"Reynolds H.T., The Analysis of Cross-Classifications, Free Press, New York, 1977"},{"key":"17_CR47","volume-title":"Advances in Kernel Methods \u2014 Support Vector Learning","author":"J.C. Platt","year":"1998","unstructured":"Platt J.C., Fast Training of Support Vector Machines using Sequential Minimal Optimization, Advances in Kernel Methods \u2014 Support Vector Learning, MIT Press, Xiamen, China, 1998"},{"key":"17_CR48","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T.M. Cover","year":"1967","unstructured":"Cover T.M., Hart P.E., Nearest Neighbor Pattern Classification, IEEE T INFORM THEORY, 1967, 13, 21\u201327","journal-title":"IEEE T INFORM THEORY"}],"container-title":["Open Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.2478\/s13537-011-0017-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.2478\/s13537-011-0017-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.2478\/s13537-011-0017-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,28]],"date-time":"2021-02-28T16:19:06Z","timestamp":1614529146000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.2478\/s13537-011-0017-x\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":48,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.2478\/s13537-011-0017-x","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}