
Then, this new and one-dimensional distance based mark is used to represent each data sample for interruption detection by a k-Nearest Neighbour (k-NN) classifier. The experimental results based on the KDD-Cup 99 dataset show that the CANN classifier not only performs better than or similar to k-NN and support vector machines trained and tested by the original feature representation in terms of classification correctness, discovery rates, and false alarms. I also provides high computational competence for the time of classifier training and testing (i.e., detection).
By V. Ravi Kishore | Dr. V. Venkata Krishna" An Interruption Discovery Structure Depend on Cluster Centres and Adjacent Neighbours"
Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-5 , August 2017,
Paper URL: http://www.ijtsrd.com/papers/ijtsrd2423.pdf
Direct URL: http://www.ijtsrd.com/computer-science/computer-network/2423/an-interruption-discovery-structure-depend-on--cluster-centres-and-adjacent-neighbours/vravi-kishore
No comments:
Post a Comment