Pushing Visualization Effects into Pushed Schema Enumerated Tree-Based Support Constraints

Abstract:

Based on the datasets from UCI and Obstructive Sleep Apnea, a disparate methodology of uncovering the visualization effects into the pushed support constraints of schema enumerated tree-based classification techniques is proposed and presented in this paper. This is to actively ‘wipe out’ the redundant growing effects of decision trees through itemset generation when visualization techniques are applied using Principal Component Analysis (PCA) and/or Principal Component Variable Grouping (PCVG) algorithms. Enumeration specification is based on the schema enumerated tree (SET) drawn after sorting out the features and characteristics on each dataset applied. The linchpin is to streamline the pre-tree classification effects for post-tree classification by using visualization techniques, i.e. PCA and/or PCVG, which are applied during the SET development. The over-fitting effects done during the SET development by the pushed support constraints can be counter-corrected by fewer PCA and/or PCVG imposed during visualization processes. The under-fitting effects done by the imprecise ‘early stopping’ of the SET development can be counter-corrected by greater PCA and/or PCVG imposed during the post-tree classification techniques through pushed SET support constraint learning. Research outcome on all the investigated datasets showed that the prediction accuracies have been profoundly improved after applying visualization of PCA and/or PCVG algorithms into the pushed SET-based or SET-based support constraints.

• Periodical: Applied Mechanics and Materials (Volume 892)
• Pages: 219-227
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.892.219
• Online since: June 2019
• Authors: Doreen Ying Ying Sim*, Chee Siong Teh, Ahmad Izuanuddin Ismail
• Keywords: Error-Sensitive Learning, Principal Component Analysis (PCA) Algorithms, Principal Component Variable Grouping (PCVG), Pushed Support Constraints, Schema Enumerated Tree (SET), Visualization Effects

References

[1] D. Y. Y. Sim, C. S. Teh, A. I. Izuanuddin, Improved boosting algorithms by pre-pruning and associative rule mining on decision trees for predicting obstructive sleep apnea, Adv. Sci. Lett. 23(11) (2017) 11593-11598.

DOI: 10.1166/asl.2017.10335

[2] D. Y. Y. Sim, C. S. Teh, P. K. Banerjee, Prediction model by using Bayesian and cognition-driven techniques: a study in the context of obstructive sleep apnea, Proceeding of the 9th International Conference on Cognitive Sciences, Malaysia, Procedia – Social and Behavioral Sciences. 97 (2013) 528-537.

DOI: 10.1016/j.sbspro.2013.10.269

[3] D. Y. Y. Sim, C. S. Teh, A. I. Izuanuddin, Adaptive apriori and weighted association rule mining on visual inspected variables for predicting Obstructive Sleep Apnea (OSA), Aus. J. Intelligent Inform. Process. Sys. 14(2) (2014) 39-45.

[4] D. Y. Y. Sim, C. S. Teh, A. I. Izuanuddin, Improved boosted decision tree algorithms by adaptive apriori and post-pruning for predicting obstructive sleep apnea, Adv. Sci. Lett. 24(3) (2018) 1680-1684.

DOI: 10.1166/asl.2018.11136

[5] D.Y.Y. Sim, C.S. Teh, A.I. Izuanuddin, Pushing constraints by rule-driven pruning techniques in non-uniform minimum support for predicting obstructive sleep apnea, Material Sci Forum J 24(1), 401-406 (2018).

DOI: 10.4028/www.scientific.net/amm.892.210

[6] D. Y. Y. Sim, Emerging convergences of HCI techniques for graphical scalable visualization: efficient filtration and location transparency of visual transformation, Proceeding of the 7th International Conference on IT in Asia, Kuching, Malaysia, (2011) 1-8.

DOI: 10.1109/cita.2011.5999517

[7] K. Shihab, D.Y.Y. Sim, A.M. Shahi, Angur: A visualization system for XML documents, Proceeding of the 9th WSEAS International Conference on Telecommunications and Informatics, Catania, Italy, (2010) 159 – 165.

[8] K. Shihab, D.Y.Y. Sim, Development of a visualization tool for XML documents, Int J Computers. 4(04) (2010) 153 – 160.

[9] J. Han, M. Kamber, J. Pei, Data mining concepts and techniques, third ed., Elsevier, Morgan Kaufmann, USA (2012) 17-27, 248-273, 461-488.

[10] J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, Proceeding of the 2000 ACM SIGMOD International Conference on Data Mining, New York, USA, (2000) 1-12.

DOI: 10.1145/342009.335372

[11] S. K. Pal, P. Mitra, Pattern recognition algorithms for data mining, Chapman & Hall, Florida, USA, CRC Press LLC, 2004, pp.165-168, 170-174.

[12] G. Hari Prasad, J. Nagamuneiah, A strategy for initiate support check into frequent itemset mining, Int. J. Adv. Res. Comp. Sci. Software Eng. 2(7) (2012) 43-48.

[13] L. Breiman, Population theory for boosting ensembles, Annals of Statistics. 32(1) (2004) 1-11.

[14] L. Breiman, J. H. Friedman, R. A. Olshen, C. J. Stone, Classification and regression trees, Wadsworth, Belmont, USA, 1984, pp.5-12, 22-39.

[15] F. Zhu, M. Tang, L. Xie, H. Zhu, A classification algorithm of CART decision tree based on MapReduce attribute weights, Int J Performability Eng. 14(1) (2018) 17 – 25.

DOI: 10.23940/ijpe.18.01.p3.1725

[16] M. Jaworski, P. Duda, L. Rutkowski, New splitting criteria for decision trees in stationary data streams, IEEE Trans Neural Netw Learn Syst. 29(6) (2018) 2516 – 2529.

DOI: 10.1109/tnnls.2017.2698204