{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T04:28:32Z","timestamp":1772252912553,"version":"3.50.1"},"reference-count":40,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2018,11,17]],"date-time":"2018-11-17T00:00:00Z","timestamp":1542412800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Big Data classification has recently received a great deal of attention due to the main properties of Big Data, which are volume, variety, and velocity. The furthest-pair-based binary search tree (FPBST) shows a great potential for Big Data classification. This work attempts to improve the performance the FPBST in terms of computation time, space consumed and accuracy. The major enhancement of the FPBST includes converting the resultant BST to a decision tree, in order to remove the need for the slow K-nearest neighbors (KNN), and to obtain a smaller tree, which is useful for memory usage, speeding both training and testing phases and increasing the classification accuracy. The proposed decision trees are based on calculating the probabilities of each class at each node using various methods; these probabilities are then used by the testing phase to classify an unseen example. The experimental results on some (small, intermediate and big) machine learning datasets show the efficiency of the proposed methods, in terms of space, speed and accuracy compared to the FPBST, which shows a great potential for further enhancements of the proposed methods to be used in practice.<\/jats:p>","DOI":"10.3390\/info9110284","type":"journal-article","created":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T11:23:27Z","timestamp":1542799407000},"page":"284","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Furthest-Pair-Based Decision Trees: Experimental Results on Big Data Classification"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9991-304X","authenticated-orcid":false,"given":"Ahmad B. A.","family":"Hassanat","sequence":"first","affiliation":[{"name":"Information Technology College, Mutah University, Karak 61710, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1016\/j.ipm.2017.10.005","article-title":"Big Data-enabled Customer Relationship Management: A holistic approach","volume":"54","author":"Zerbino","year":"2018","journal-title":"Inf. Process. Manag."},{"key":"ref_2","first-page":"21","article-title":"Big data, analytics and the path from insights to value","volume":"52","author":"LaValle","year":"2011","journal-title":"MIT Sloan Manag. Rev."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.inffus.2017.10.006","article-title":"A survey on deep learning for big data","volume":"42","author":"Zhang","year":"2018","journal-title":"Inf. Fusion"},{"key":"ref_4","unstructured":"Bol\u00f3n-Canedo, V., Remeseiro, B., Sechidis, K., Martinez-Rego, D., and Alonso-Betanzos, A. (2017, January 26\u201328). Algorithmic challenges in Big Data analytics. Proceedings of the European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, Bruges, Belgium."},{"key":"ref_5","unstructured":"Lv, X. (2018). The big data impact and application study on the like ecosystem construction of open internet of things. Clust. Comput., 1\u201310."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Fix, E., and Hodges, J.L. (1951). Discriminatory Analysis-Nonparametric Discrimination: Consistency Properties, USAF School of Aviation Medicine.","DOI":"10.1037\/e471672008-001"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","article-title":"Nearest neighbor pattern classification","volume":"13","author":"Cover","year":"1967","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Hassanat, A. (2018). Norm-Based Binary Search Trees for Speeding Up KNN Big Data Classification. Computers, 7.","DOI":"10.3390\/computers7040054"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1089\/big.2018.0064","article-title":"Furthest-Pair-Based Binary Search Tree for Speeding Big Data Classification Using K-Nearest Neighbors","volume":"6","author":"Hassanat","year":"2018","journal-title":"Big Data"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Hassanat, B. (2018). Two-point-based binary search trees for accelerating big data classification using KNN. PLoS ONE, 13, in press.","DOI":"10.1371\/journal.pone.0207772"},{"key":"ref_11","first-page":"644","article-title":"Fusion of color and statistic features for enhancing content-based image retrieval systems","volume":"88","author":"Hassanat","year":"2016","journal-title":"J. Theor. Appl. Inf. Technol."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Tarawneh, A.S., Chetverikov, D., Verma, C., and Hassanat, A.B. (2018, January 3\u20135). Stability and reduction of statistical features for image classification and retrieval: Preliminary results. Proceedings of the 9th International Conference on Information and Communication Systems, Irbid, Jordan.","DOI":"10.1109\/IACS.2018.8355452"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Hassanat, A.B. (arXiv, 2018). Greedy algorithms for approximating the diameter of machine learning datasets in multidimensional euclidean space, arXiv.","DOI":"10.14201\/ADCAIJ2018731530"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1109\/TNNLS.2017.2673241","article-title":"Efficient knn classification with different numbers of nearest neighbors","volume":"29","author":"Zhang","year":"2018","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_15","unstructured":"Hassanat, A.B., Abbadi, M.A., Altarawneh, G.A., and Alhasanat, A.A. (arXiv, 2014). Solving the problem of the K parameter in the KNN classifier using an ensemble learning approach, arXiv."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.neucom.2017.12.061","article-title":"Efficient tree classifiers for large scale datasets","volume":"284","author":"Wang","year":"2018","journal-title":"Neurocomputing"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Maillo, J., Triguero, I., and Herrera, F. (2015, January 20\u201322). A mapreduce-based k-nearest neighbor approach for big data classification. Proceedings of the 13th IEEE International Symposium on Parallel and Distributed Processing with Application, Helsinki, Finland.","DOI":"10.1109\/Trustcom.2015.577"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.knosys.2016.06.012","article-title":"kNN-IS: An Iterative Spark-based design of the k-Nearest Neighbors classifier for big data","volume":"117","author":"Maillo","year":"2017","journal-title":"Knowl.-Based Syst."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.neucom.2015.08.112","article-title":"Efficient kNN classification algorithm for big data","volume":"195","author":"Deng","year":"2016","journal-title":"Neurocomputing"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/j.patcog.2017.09.038","article-title":"Clustering-based k-nearest neighbor classification for large-scale data with neural codes representation","volume":"74","author":"Gallego","year":"2018","journal-title":"Pattern Recognit."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Commun. ACM"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","article-title":"Satisfying general proximity\/similarity queries with metric trees","volume":"40","author":"Uhlmann","year":"1991","journal-title":"Inf. Process. Lett."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Beygelzimer, A., Kakade, S., and Langford, J. (2006, January 25\u201329). Cover trees for nearest neighbor. Proceedings of the 23rd International Conference on Machine Learning, Pittsburgh, PA, USA.","DOI":"10.1145\/1143844.1143857"},{"key":"ref_24","unstructured":"Kibriya, A.M., and Frank, E. (2007, January 17\u201321). An empirical comparison of exact nearest neighbour algorithms. Proceedings of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Cislak, A., and Grabowski, S. (2014, January 7\u201310). Experimental evaluation of selected tree structures for exact and approximate k-nearest neighbor classification. Proceedings of the Ederated Conference on Computer Science and Information Systems, Warsaw, Poland.","DOI":"10.15439\/2014F194"},{"key":"ref_26","unstructured":"Fan, R.-E. (2018, March 01). LIBSVM Data: Classification, Regression, and Multi-label. Available online: https:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvmtools\/datasets\/."},{"key":"ref_27","unstructured":"Lichman, M. (2018, March 01). University of California, Irvine, School of Information and Computer Sciences,. Available online: http:\/\/archive.ics.uci.edu\/ml."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Nalepa, J., and Kawulok, M. (2018). Selecting training sets for support vector machines: A review. Artif. Intell. Rev., 1\u201344.","DOI":"10.1007\/s10462-017-9611-1"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Fdez, I., Canosa, A., Mucientes, M., and Bugar\u00edn, A. (2015, January 2\u20135). STAC: A web platform for the comparison of algorithms using statistical tests. Proceedings of the 2015 IEEE International Conference on Fuzzy Systems, Istanbul, Turkey.","DOI":"10.1109\/FUZZ-IEEE.2015.7337889"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1093\/biomet\/52.3-4.591","article-title":"An analysis of variance test for normality (complete samples)","volume":"52","author":"Shapiro","year":"1965","journal-title":"Biometrika"},{"key":"ref_31","first-page":"279","article-title":"Robust tests for equality of variances","volume":"69","author":"Levene","year":"1961","journal-title":"Contrib. Probab. Stat."},{"key":"ref_32","unstructured":"Quinlan, J.R. (1993). C4.5: Programs for Machine Learning, Morgan Kaufmann Publishers."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0020-7373(87)80053-6","article-title":"Simplifying decision trees","volume":"27","author":"Quinlan","year":"1987","journal-title":"Int. J. Man-Mach. Stud."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","article-title":"Random forests","volume":"45","author":"Breiman","year":"2001","journal-title":"Mach. Learn."},{"key":"ref_35","unstructured":"Witten, I.H., Frank, E., Hall, M.A., and Pal, C.J. (2016). Data Mining: Practical Machine Learning Tools and Techniques, Morgan Kaufmann Publishers."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"27","DOI":"10.5334\/dsj-2018-027","article-title":"On identifying terrorists using their victory signs","volume":"17","author":"Hassanat","year":"2018","journal-title":"Data Sci. J."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Hassanat, A.B., Prasath, V.S., Al-kasassbeh, M., Tarawneh, A.S., and Al-shamailh, A.J. (2018). Magnetic energy-based feature extraction for low-quality fingerprint images. Signal Image Video Process., 1\u20138.","DOI":"10.1007\/s11760-018-1302-0"},{"key":"ref_38","first-page":"347","article-title":"Classification and gender recognition from veiled-faces","volume":"9","author":"Hassanat","year":"2017","journal-title":"Int. J. Biom."},{"key":"ref_39","unstructured":"Hassanat, A.B. (arXiv, 2014). Dimensionality invariant similarity measure, arXiv."},{"key":"ref_40","unstructured":"Alkasassbeh, M., Altarawneh, G.A., and Hassanat, A. (2015). On enhancing the performance of nearest neighbour classifiers using hassanat distance metric. arXiv."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/11\/284\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:30:20Z","timestamp":1760196620000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/11\/284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,17]]},"references-count":40,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2018,11]]}},"alternative-id":["info9110284"],"URL":"https:\/\/doi.org\/10.3390\/info9110284","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints201810.0595.v1","asserted-by":"object"}]},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,17]]}}}