Loading…

Intrusion detection using k-Nearest Neighbor

Data mining is the use of algorithms to extract the information and patterns derived by the knowledge discovery in databases process. Classification maps data into predefined groups or classes. It is often referred to as supervised learning because the classes are determined before examining the dat...

Full description

Saved in:
Bibliographic Details
Main Authors: Govindarajan, M., Chandrasekaran, R.M.
Format: Conference Proceeding
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 20
container_issue
container_start_page 13
container_title
container_volume
creator Govindarajan, M.
Chandrasekaran, R.M.
description Data mining is the use of algorithms to extract the information and patterns derived by the knowledge discovery in databases process. Classification maps data into predefined groups or classes. It is often referred to as supervised learning because the classes are determined before examining the data. In many data mining applications that address classification problems, feature and model selection are considered as key tasks. That is, appropriate input features of the classifier must be selected from a given set of possible features and structure parameters of the classifier must be adapted with respect to these features and a given data set. This paper describes feature selection and model selection simultaneously for k-nearest neighbor (k-NN) classifiers. In order to reduce the optimization effort, various techniques are integrated that accelerate and improve the classifier significantly: hybrid k-NN, comparative cross validation. The feasibility and the benefits of the proposed approach are demonstrated by means of data mining problem: intrusion detection in computer networks. It is shown that, compared to earlier k-NN technique, the run time is reduced by up to 0.01 % and 0.06 % while error rates are lowered by up to 0.002 % and 0.03 % for normal and abnormal behaviour respectively. The algorithm is independent of specific applications so that many ideas and solutions can be transferred to other classifier paradigms.
doi_str_mv 10.1109/ICADVC.2009.5377998
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5377998</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5377998</ieee_id><sourcerecordid>5377998</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-b7e338a7ecf1a928cb1b041dad4854c2f3b911401da34baca7fa81766f1436383</originalsourceid><addsrcrecordid>eNpVT8tOwzAQNIJKtCVf0Es-gIRdr5P1HlGgUKlqL8C1shOnhEeKknDg70lFL5zmoZnVjlILhBQR5GZV3N69FKkGkDQjZhF7piJhi0YbY9iynP_Tub5QUz0mk1w0T9TsWBXICOhSRX3_BgAoGVjmqbpetUP33TeHNq7CEMrhyEbd7uP3ZBNcF_oh3oRm_-oP3ZWa1O6jD9EJ5-p5ef9UPCbr7cP45jppkLMh8RyIrONQ1uhE29KjB4OVq4zNTKlr8oJoYHTIeFc6rp1FzvMaDeVkaa4Wf3ebEMLuq2s-XfezO42nX_sESHQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Intrusion detection using k-Nearest Neighbor</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Govindarajan, M. ; Chandrasekaran, R.M.</creator><creatorcontrib>Govindarajan, M. ; Chandrasekaran, R.M.</creatorcontrib><description>Data mining is the use of algorithms to extract the information and patterns derived by the knowledge discovery in databases process. Classification maps data into predefined groups or classes. It is often referred to as supervised learning because the classes are determined before examining the data. In many data mining applications that address classification problems, feature and model selection are considered as key tasks. That is, appropriate input features of the classifier must be selected from a given set of possible features and structure parameters of the classifier must be adapted with respect to these features and a given data set. This paper describes feature selection and model selection simultaneously for k-nearest neighbor (k-NN) classifiers. In order to reduce the optimization effort, various techniques are integrated that accelerate and improve the classifier significantly: hybrid k-NN, comparative cross validation. The feasibility and the benefits of the proposed approach are demonstrated by means of data mining problem: intrusion detection in computer networks. It is shown that, compared to earlier k-NN technique, the run time is reduced by up to 0.01 % and 0.06 % while error rates are lowered by up to 0.002 % and 0.03 % for normal and abnormal behaviour respectively. The algorithm is independent of specific applications so that many ideas and solutions can be transferred to other classifier paradigms.</description><identifier>ISSN: 2377-6927</identifier><identifier>ISBN: 9781424447862</identifier><identifier>ISBN: 1424447860</identifier><identifier>EISBN: 9781424447879</identifier><identifier>EISBN: 1424447879</identifier><identifier>DOI: 10.1109/ICADVC.2009.5377998</identifier><identifier>LCCN: 2009905303</identifier><language>eng</language><publisher>IEEE</publisher><subject>Application software ; Control systems ; Energy consumption ; Humanoid robots ; Hydraulic actuators ; Induction motors ; Intrusion detection ; Legged locomotion ; Robot control ; Testing</subject><ispartof>2009 First International Conference on Advanced Computing, 2009, p.13-20</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5377998$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,27906,54536,54901,54913</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5377998$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Govindarajan, M.</creatorcontrib><creatorcontrib>Chandrasekaran, R.M.</creatorcontrib><title>Intrusion detection using k-Nearest Neighbor</title><title>2009 First International Conference on Advanced Computing</title><addtitle>ICADVC</addtitle><description>Data mining is the use of algorithms to extract the information and patterns derived by the knowledge discovery in databases process. Classification maps data into predefined groups or classes. It is often referred to as supervised learning because the classes are determined before examining the data. In many data mining applications that address classification problems, feature and model selection are considered as key tasks. That is, appropriate input features of the classifier must be selected from a given set of possible features and structure parameters of the classifier must be adapted with respect to these features and a given data set. This paper describes feature selection and model selection simultaneously for k-nearest neighbor (k-NN) classifiers. In order to reduce the optimization effort, various techniques are integrated that accelerate and improve the classifier significantly: hybrid k-NN, comparative cross validation. The feasibility and the benefits of the proposed approach are demonstrated by means of data mining problem: intrusion detection in computer networks. It is shown that, compared to earlier k-NN technique, the run time is reduced by up to 0.01 % and 0.06 % while error rates are lowered by up to 0.002 % and 0.03 % for normal and abnormal behaviour respectively. The algorithm is independent of specific applications so that many ideas and solutions can be transferred to other classifier paradigms.</description><subject>Application software</subject><subject>Control systems</subject><subject>Energy consumption</subject><subject>Humanoid robots</subject><subject>Hydraulic actuators</subject><subject>Induction motors</subject><subject>Intrusion detection</subject><subject>Legged locomotion</subject><subject>Robot control</subject><subject>Testing</subject><issn>2377-6927</issn><isbn>9781424447862</isbn><isbn>1424447860</isbn><isbn>9781424447879</isbn><isbn>1424447879</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpVT8tOwzAQNIJKtCVf0Es-gIRdr5P1HlGgUKlqL8C1shOnhEeKknDg70lFL5zmoZnVjlILhBQR5GZV3N69FKkGkDQjZhF7piJhi0YbY9iynP_Tub5QUz0mk1w0T9TsWBXICOhSRX3_BgAoGVjmqbpetUP33TeHNq7CEMrhyEbd7uP3ZBNcF_oh3oRm_-oP3ZWa1O6jD9EJ5-p5ef9UPCbr7cP45jppkLMh8RyIrONQ1uhE29KjB4OVq4zNTKlr8oJoYHTIeFc6rp1FzvMaDeVkaa4Wf3ebEMLuq2s-XfezO42nX_sESHQ</recordid><startdate>200912</startdate><enddate>200912</enddate><creator>Govindarajan, M.</creator><creator>Chandrasekaran, R.M.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200912</creationdate><title>Intrusion detection using k-Nearest Neighbor</title><author>Govindarajan, M. ; Chandrasekaran, R.M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-b7e338a7ecf1a928cb1b041dad4854c2f3b911401da34baca7fa81766f1436383</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Application software</topic><topic>Control systems</topic><topic>Energy consumption</topic><topic>Humanoid robots</topic><topic>Hydraulic actuators</topic><topic>Induction motors</topic><topic>Intrusion detection</topic><topic>Legged locomotion</topic><topic>Robot control</topic><topic>Testing</topic><toplevel>online_resources</toplevel><creatorcontrib>Govindarajan, M.</creatorcontrib><creatorcontrib>Chandrasekaran, R.M.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Govindarajan, M.</au><au>Chandrasekaran, R.M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Intrusion detection using k-Nearest Neighbor</atitle><btitle>2009 First International Conference on Advanced Computing</btitle><stitle>ICADVC</stitle><date>2009-12</date><risdate>2009</risdate><spage>13</spage><epage>20</epage><pages>13-20</pages><issn>2377-6927</issn><isbn>9781424447862</isbn><isbn>1424447860</isbn><eisbn>9781424447879</eisbn><eisbn>1424447879</eisbn><abstract>Data mining is the use of algorithms to extract the information and patterns derived by the knowledge discovery in databases process. Classification maps data into predefined groups or classes. It is often referred to as supervised learning because the classes are determined before examining the data. In many data mining applications that address classification problems, feature and model selection are considered as key tasks. That is, appropriate input features of the classifier must be selected from a given set of possible features and structure parameters of the classifier must be adapted with respect to these features and a given data set. This paper describes feature selection and model selection simultaneously for k-nearest neighbor (k-NN) classifiers. In order to reduce the optimization effort, various techniques are integrated that accelerate and improve the classifier significantly: hybrid k-NN, comparative cross validation. The feasibility and the benefits of the proposed approach are demonstrated by means of data mining problem: intrusion detection in computer networks. It is shown that, compared to earlier k-NN technique, the run time is reduced by up to 0.01 % and 0.06 % while error rates are lowered by up to 0.002 % and 0.03 % for normal and abnormal behaviour respectively. The algorithm is independent of specific applications so that many ideas and solutions can be transferred to other classifier paradigms.</abstract><pub>IEEE</pub><doi>10.1109/ICADVC.2009.5377998</doi><tpages>8</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2377-6927
ispartof 2009 First International Conference on Advanced Computing, 2009, p.13-20
issn 2377-6927
language eng
recordid cdi_ieee_primary_5377998
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Application software
Control systems
Energy consumption
Humanoid robots
Hydraulic actuators
Induction motors
Intrusion detection
Legged locomotion
Robot control
Testing
title Intrusion detection using k-Nearest Neighbor
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T19%3A08%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Intrusion%20detection%20using%20k-Nearest%20Neighbor&rft.btitle=2009%20First%20International%20Conference%20on%20Advanced%20Computing&rft.au=Govindarajan,%20M.&rft.date=2009-12&rft.spage=13&rft.epage=20&rft.pages=13-20&rft.issn=2377-6927&rft.isbn=9781424447862&rft.isbn_list=1424447860&rft_id=info:doi/10.1109/ICADVC.2009.5377998&rft.eisbn=9781424447879&rft.eisbn_list=1424447879&rft_dat=%3Cieee_6IE%3E5377998%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-b7e338a7ecf1a928cb1b041dad4854c2f3b911401da34baca7fa81766f1436383%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5377998&rfr_iscdi=true