Abstract
This paper describes a comparative study of the use of Shannon, Renyi and Tsallis entropies for designing Decision Tree, with goal to find more efficient alternatives applied to Intrusion Tolerant Systems. Decision Tree has been used in classification model problems related to intrusion detection in networks, presenting good results. A very used decision tree is the C4.5 one that applies the Shannon entropy in order to choose the attributes that better divide data intoclasses. However, other ways to measure entropy, e.g., Tsallis and Renyi entropy, may be applied aiming at guaranteeing better generalization related to split criteria. Experimental results demonstrate that Tsallis and Renyi entropy can be used to construct more compact and efficient decision trees compared with Shannon entropy and these models can to provide more accurate intrusion tolerante systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
