Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Haihua Gao Xingyu Wang |
| Copyright Year | 2006 |
| Description | Author affiliation: Sch. of Inf. Sci. & Eng., East China Univ. of Sci. & Technol., Shanghai (Haihua Gao; Xingyu Wang) |
| Abstract | For least squares support vector machines (LS-SVM) based intrusion detection method, there is a big obstacle that the amount of audit data for modelling is very large even for a small network scale, so it's impractical to directly train LS-SVM using original training datasets. Furthermore, LS-SVM adopts equality constraints and squared functions, which leads to solve an easy-to-compute linear system, however followed is the lack of sparseness, all training data will become the support vector of LS-SVM, which cause the low intrusion detection speed. This paper proposed a novel LS-SVM intrusion detection model using kernel space approximation through greedy searching, thus constructed a subspace basis of original space populated by training data. Through this approximation, the training data was downsized and consequently the number of support vectors of ultimate LS-SVM model were reduced, which greatly helped to improve the response time of intrusion detection. The kernel-target alignment method was utilized to obtain optimal Gaussian kernel parameter and 10-fold cross-validate method to obtain optimal trade-off parameter. The MIT's KDD Cup 99 dataset was used to evaluate our present model, and the results clearly demonstrate that the method can be an effective way for fast intrusion detection |
| Starting Page | 4214 |
| Ending Page | 4218 |
| File Size | 194745 |
| Page Count | 5 |
| File Format | |
| ISBN | 1424403324 |
| DOI | 10.1109/WCICA.2006.1713169 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2006-06-21 |
| Publisher Place | China |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Intrusion detection Kernel Least squares approximation Support vector machines Training data Space technology Quadratic programming Educational technology Linear systems Computer security kernel target Alignment intrusion detection least squares support vector machines kernel space approximation |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|