A New Direct Node Data Splitting Technique in Decision Tree Induction
D. Mabuni
D. Mabuni, Department of Computer Science, Dravidian University, Kuppam, India.
Manuscript received on April 20, 2020. | Revised Manuscript received on April 29, 2020. | Manuscript published on May 10, 2020. | PP: 633-638 | Volume-9 Issue-7, May 2020. | Retrieval Number: G5499059720/2020©BEIESP | DOI: 10.35940/ijitee.G5499.059720
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Learning knowledge from the example data and then applying that knowledge on new applications is the goal of machine learning. Split attribute technique is inseparable and an important means of decision tree construction technique. It is a well known fact and universally accepted truth that a difficult and larger data mining model tends to create less significant generalized performance results. Researchers are being continuously trying to find new and the best split attribute techniques during decision tree induction. In this paper a new direct split attribute technique for decision tree induction is proposed based on the mathematical A implies B tautology principle. The experimental results show that this rule is worthy and useful in many real world applications, particularly in medical field. The resulted association relationships are perfectly matching with the expected results.
Keywords: A implies B, association relationships, direct split attribute technique, tautology
Scope of the Article: Decision Making