{"id":"https://openalex.org/W1998846421","doi":"https://doi.org/10.1109/isda.2011.6121657","title":"A new ensemble-feature-selection framework for intrusion detection","display_name":"A new ensemble-feature-selection framework for intrusion detection","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W1998846421","doi":"https://doi.org/10.1109/isda.2011.6121657","mag":"1998846421"},"language":"en","primary_location":{"id":"doi:10.1109/isda.2011.6121657","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isda.2011.6121657","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 11th International Conference on Intelligent Systems Design and Applications","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000245484","display_name":"Nguy\u1ec5n Thanh H\u1ea3i","orcid":"https://orcid.org/0000-0003-3270-6975"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hai Thanh Nguyen","raw_affiliation_strings":["Norwegian Information Security Laboratory, Gj\u00f8vik University College, Norway","Norwegian Information Security Laboratory, Gj\u2298vik University College, Norway"],"affiliations":[{"raw_affiliation_string":"Norwegian Information Security Laboratory, Gj\u00f8vik University College, Norway","institution_ids":[]},{"raw_affiliation_string":"Norwegian Information Security Laboratory, Gj\u2298vik University College, Norway","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028698767","display_name":"Katrin Franke","orcid":"https://orcid.org/0000-0002-4899-9410"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Katrin Franke","raw_affiliation_strings":["Norwegian Information Security Laboratory, Gj\u00f8vik University College, Norway","Norwegian Information Security Laboratory, Gj\u2298vik University College, Norway"],"affiliations":[{"raw_affiliation_string":"Norwegian Information Security Laboratory, Gj\u00f8vik University College, Norway","institution_ids":[]},{"raw_affiliation_string":"Norwegian Information Security Laboratory, Gj\u2298vik University College, Norway","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070972527","display_name":"Slobodan Petrovi\u0107","orcid":"https://orcid.org/0000-0002-4435-2716"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Slobodan Petrovic","raw_affiliation_strings":["Norwegian Information Security Laboratory, Gj\u00f8vik University College, Norway","Norwegian Information Security Laboratory, Gj\u2298vik University College, Norway"],"affiliations":[{"raw_affiliation_string":"Norwegian Information Security Laboratory, Gj\u00f8vik University College, Norway","institution_ids":[]},{"raw_affiliation_string":"Norwegian Information Security Laboratory, Gj\u2298vik University College, Norway","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000245484"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3501,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.60662861,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"213","last_page":"218"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11512","display_name":"Anomaly Detection Techniques and Applications","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12391","display_name":"Artificial Immune Systems Applications","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7021097540855408},{"id":"https://openalex.org/keywords/feature-selection","display_name":"Feature selection","score":0.692929744720459},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6177680492401123},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.5972973108291626},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5364201068878174},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5306752324104309},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4914778470993042},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.4825979471206665},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.42570340633392334},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4233749210834503},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4145854115486145},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4119284451007843},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2344042956829071}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7021097540855408},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.692929744720459},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6177680492401123},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.5972973108291626},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5364201068878174},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5306752324104309},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4914778470993042},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.4825979471206665},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.42570340633392334},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4233749210834503},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4145854115486145},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4119284451007843},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2344042956829071},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isda.2011.6121657","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isda.2011.6121657","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 11th International Conference on Intelligent Systems Design and Applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W140777655","https://openalex.org/W1495061682","https://openalex.org/W1866355538","https://openalex.org/W1922017469","https://openalex.org/W1988918299","https://openalex.org/W2019633452","https://openalex.org/W2050130693","https://openalex.org/W2113122507","https://openalex.org/W2125055259","https://openalex.org/W2132549764","https://openalex.org/W2154053567","https://openalex.org/W2165250079","https://openalex.org/W2799061466","https://openalex.org/W4205687621","https://openalex.org/W6629652716","https://openalex.org/W6640061767","https://openalex.org/W6683942726"],"related_works":["https://openalex.org/W4255837520","https://openalex.org/W2387011115","https://openalex.org/W4234808182","https://openalex.org/W2382043075","https://openalex.org/W2809151339","https://openalex.org/W2360673138","https://openalex.org/W2809370583","https://openalex.org/W2333722679","https://openalex.org/W4255628145","https://openalex.org/W2093320919"],"abstract_inverted_index":{"Feature":[0,137],"selection":[1,13,82,160,171],"is":[2,15,57,177,203,230,280],"an":[3,254],"important":[4],"part":[5],"of":[6,53,63,70,73,87,100,108,121,128,147,195,216,226,235,245,253,282],"a":[7,114,148,173,182,207,260],"pattern":[8],"recognition":[9],"system.":[10],"A":[11],"feature":[12,81,159,170,191],"method":[14],"required":[16],"to":[17,21,117,142,241],"be":[18],"general":[19],"enough":[20],"find":[22],"representative":[23,51],"features":[24,40,52],"from":[25,42,49],"training":[26,44,75],"data,":[27,76],"which":[28],"are":[29,46],"then":[30],"used":[31,162],"for":[32,80,91,273],"classifying":[33],"test":[34],"patterns.":[35],"The":[36,60,199],"situation":[37],"where":[38],"the":[39,43,50,54,64,74,88,98,101,105,126,153,164,168,188,196,217,224,233,243,251,267],"selected":[41],"data":[45,56,89,150,271],"quite":[47],"different":[48],"testing":[55],"called":[58],"over-selecting.":[59,287],"main":[61],"causes":[62,120],"over-selecting":[65,102,122],"phenomenon":[66,103,107],"are:":[67],"non-comprehensive":[68],"consideration":[69],"statistical":[71,145],"properties":[72,146],"heuristic":[77],"search":[78,184,201],"strategies":[79],"and":[83,123,228],"small":[84],"sample":[85],"size":[86],"set":[90,151,237,272],"training.":[92],"In":[93,220,239],"this":[94,221],"paper,":[95],"we":[96,134,249],"show":[97,275],"influence":[99],"on":[104,205],"over-fitting":[106,284],"machine":[109],"learning":[110],"algorithms.":[111],"We":[112,179],"propose":[113,181],"new":[115,131,174,183,200],"framework":[116,132],"address":[118],"principal":[119],"thus":[124],"reduce":[125],"chance":[127],"over-fitting.":[129],"Our":[130],"that":[133,186,276],"call":[135],"Ensemble":[136],"Selection":[138],"measure":[139,176,279],"(EnFS),":[140],"allows":[141],"consider":[143],"many":[144,158],"given":[149],"at":[152],"same":[154],"time":[155],"by":[156,193,214,285],"combining":[157],"methods":[161],"in":[163,232],"filter":[165],"model.":[166],"From":[167],"chosen":[169],"measures,":[172],"combined":[175],"constructed.":[178],"also":[180],"algorithm":[185],"ensures":[187],"globally":[189],"optimal":[190],"subsets":[192],"means":[194,215],"constructed":[197],"measure.":[198],"approach":[202],"based":[204],"solving":[206],"mixed":[208],"0\u20131":[209],"linear":[210,231],"programming":[211],"(M01LP)":[212],"problem":[213],"branch-and-bound":[218],"algorithm.":[219],"M01LP":[222],"problem,":[223],"number":[225,234],"constraints":[227],"variables":[229],"full":[236],"features.":[238],"order":[240],"evaluate":[242],"quality":[244],"our":[246,277],"EnFS":[247,278],"measure,":[248],"chose":[250],"design":[252],"intrusion":[255],"detection":[256],"system":[257],"(IDS)":[258],"as":[259],"possible":[261],"application.":[262],"Experimental":[263],"results":[264],"obtained":[265],"over":[266],"KDD":[268],"CUP'99":[269],"benchmarking":[270],"IDS":[274],"capable":[281],"reducing":[283],"addressing":[286]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}