Intrusion Detection based on Grid

Published 1 August 2006

Fang-Yie Leu, Mingchang Li, Jia‐Chun Lin

DOI10.1109/iccgi.2006.41

Citations14

TL;DR

The proposed method can successfully discover the target decision trees, which have no cycle and have the accurate classification results, and a method to derive acyclic decision trees from the FDN is proposed.

Abstract

In this article, we propose a fault-tolerant and grid-based IDS, named fault-tolerant grid intrusion detection system (FGIDS) which exploits grid's dynamic and abundant computing resources to detect malicious behaviors from a massive amount of network packets. In FGIDS, a detector can dynamically leave or join FGIDS anytime. A newly joined one is tested to obtain its key features' performance curves, which are used to balance detection workload among detectors. When a detector due to some reasons can not continue its detection leaving an unfinished task, FGIDS allocates another available one to take over. Therefore the drawbacks ordinary security systems have experienced can be then eliminated

Keywords

Computer Science

C4.5: Programs for Machine Learning

23,665 Citations1992J. R. Quinlan

A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.

Artificial intelligenceGenetic Algorithms + Data Structures = Evolution Programs

11,598 Citations1992Zbigniew Michalewicz

The Grid 2: Blueprint for a New Computing Infrastructure

7,622 Citations1998Ian Foster, Carl Kesselman

This chapter discusses grids in context, distributed supercomputing applications, and testbed Bridges from Research to Infrastructure.

Programs for Machine Learning

5,794 Citations1994Steven L. Salzberg, Alberto M. Segre

In his new book, C4.5: Programs for Machine Learning, Quinlan has put together a definitive, much needed description of his complete system, including the latest developments, which will be a welcome addition to the library of many researchers and students.

Intelligent Data AnalysisLinear tree

52 Citations1999João Gama

Emphasizing extinction in evolutionary programming

43 Citations2003G.W. Greewood, Gary B. Fogel +1 more

A new evolutionary algorithm that emphasizes extinction to conduct search operations over a fitness landscape is presented.

A Performance-Based Grid Intrusion Detection System

29 Citations2006Fang‐Yie Leu, Jia‐Chun Lin +2 more

A grid-based IDS, called performance-based grid intrusion detection system (PGIDS), which exploits grid's abundant computing resources to detect enormous intrusion packets and improve the drawbacks of traditional IDSs which suffer from losing their detection effectiveness and capability when processing massive network traffic.

Fuzzy decision forest

27 Citations2002Cezary Z. Janikow, M. Faifer

This work investigates the extension of fuzzy decision trees into fuzzy forests, which are an extension of hybrid systems in which multiple choices are allowed at the level of the global search space, but which use more elaborate alternatives specific to local partitioning of the space.

IEEE Transactions on Systems Man and Cybernetics - Part A Systems and HumansAn Efficient Algorithm for Generating Generalized Decision Forests

20 Citations2005Huimin Zhao, A.P. Sinha

The authors propose an efficient algorithm that uses an extended decision tree data structure and constructs any node that is common to multiple decision trees only once and reports on results demonstrating the efficiency of the algorithm in this paper.

Learning Functional Dependency Networks Based on Genetic Programming

3 Citations2006Wing-Ho Shum, Kwong-Sak Leung +1 more

A novel dependency network which can handle discrete, continuous, interval and ordinal values through functions, which has lower network complexity and stronger expressive power; it can represent any kind of relationships; and it can incorporate a-priori knowledge though user-defined functions is presented.