Repository of University of Nova Gorica

Search the repository
A+ | A- | Help | SLO | ENG

Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


1 - 1 / 1
First pagePrevious page1Next pageLast page
1.
Design & analysis of clustering based intrusion detection schemes for e-governance
Saibal K. Pal, Rajan Gupta, Sunil K. Muttoo, 2016, published scientific conference contribution

Abstract: The problem of attacks on various networks and information systems is increasing. And with systems working in public domain like those involved under E-Governance are facing more problems than others. So there is a need to work on either designing an altogether different intrusion detection system or improvement of the existing schemes with better optimization techniques and easy experimental setup. The current study discusses the design of an Intrusion Detection Scheme based on traditional clustering schemes like K-Means and Fuzzy C-Means along with Meta-heuristic scheme like Particle Swarm Optimization. The experimental setup includes comparative analysis of these schemes based on a different metric called Classification Ratio and traditional metric like Detection Rate. The experiment is conducted on a regular Kyoto Data Set used by many researchers in past, however the features extracted from this data are selected based on their relevance to the E-Governance system. The results shows a better and higher classification ratio for the Fuzzy based clustering in conjunction with meta-heuristic schemes. The development and simulations are carried out using MATLAB.
Found in: ključnih besedah
Summary of found: ...particle swarm optimization, intrusion detection, anomaly detection, intrusion detection system, network intrusion detection...
Keywords: particle swarm optimization, intrusion detection, anomaly detection, intrusion detection system, network intrusion detection
Published: 02.04.2021; Views: 796; Downloads: 3
URL Fulltext (0,00 KB)
This document has many files! More...

Search done in 0 sec.
Back to top