{"id":"https://openalex.org/W4226298527","doi":"https://doi.org/10.34028/iajit/19/3/10","title":"Choosing Decision Tree-Based Boundary Patterns in The Intrusion Detection Systems with Large Data Sets","display_name":"Choosing Decision Tree-Based Boundary Patterns in The Intrusion Detection Systems with Large Data Sets","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4226298527","doi":"https://doi.org/10.34028/iajit/19/3/10"},"language":"en","primary_location":{"id":"doi:10.34028/iajit/19/3/10","is_oa":true,"landing_page_url":"https://doi.org/10.34028/iajit/19/3/10","pdf_url":"https://doi.org/10.34028/iajit/19/3/10","source":{"id":"https://openalex.org/S100666833","display_name":"The International Arab Journal of Information Technology","issn_l":"1683-3198","issn":["1683-3198","2309-4524"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4362726017","host_organization_name":"Zarqa University","host_organization_lineage":["https://openalex.org/P4362726017"],"host_organization_lineage_names":["Zarqa University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Arab Journal of Information Technology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.34028/iajit/19/3/10","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065254755","display_name":"Hamid Reza Ghaffari","orcid":"https://orcid.org/0000-0002-7437-8466"},"institutions":[{"id":"https://openalex.org/I110525433","display_name":"Islamic Azad University, Tehran","ror":"https://ror.org/01kzn7k21","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433"]},{"id":"https://openalex.org/I86958956","display_name":"Ferdowsi University of Mashhad","ror":"https://ror.org/00g6ka752","country_code":"IR","type":"education","lineage":["https://openalex.org/I86958956"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Hamidreza Ghaffari","raw_affiliation_strings":["Department of Computer Engineering, Islamic Azad University of ferdows, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Islamic Azad University of ferdows, Iran","institution_ids":["https://openalex.org/I86958956","https://openalex.org/I110525433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065254755"],"corresponding_institution_ids":["https://openalex.org/I110525433","https://openalex.org/I86958956"],"apc_list":null,"apc_paid":null,"fwci":0.1424,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.46332337,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"19","issue":"3","first_page":null,"last_page":null},"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.9972000122070312,"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.9972000122070312,"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.9660000205039978,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8547471165657043},{"id":"https://openalex.org/keywords/support-vector-machine","display_name":"Support vector machine","score":0.8152938485145569},{"id":"https://openalex.org/keywords/intrusion-detection-system","display_name":"Intrusion detection system","score":0.7563524842262268},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.6267513036727905},{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.6206871867179871},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6133482456207275},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5457271337509155},{"id":"https://openalex.org/keywords/decision-boundary","display_name":"Decision boundary","score":0.5454540848731995},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5213119387626648},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4815542995929718},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4805462956428528},{"id":"https://openalex.org/keywords/sequential-minimal-optimization","display_name":"Sequential minimal optimization","score":0.4720255434513092},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.4404904246330261},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08198165893554688}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8547471165657043},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.8152938485145569},{"id":"https://openalex.org/C35525427","wikidata":"https://www.wikidata.org/wiki/Q745881","display_name":"Intrusion detection system","level":2,"score":0.7563524842262268},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.6267513036727905},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.6206871867179871},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6133482456207275},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5457271337509155},{"id":"https://openalex.org/C42023084","wikidata":"https://www.wikidata.org/wiki/Q5249231","display_name":"Decision boundary","level":3,"score":0.5454540848731995},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5213119387626648},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4815542995929718},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4805462956428528},{"id":"https://openalex.org/C10719679","wikidata":"https://www.wikidata.org/wiki/Q2679145","display_name":"Sequential minimal optimization","level":3,"score":0.4720255434513092},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.4404904246330261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08198165893554688},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.34028/iajit/19/3/10","is_oa":true,"landing_page_url":"https://doi.org/10.34028/iajit/19/3/10","pdf_url":"https://doi.org/10.34028/iajit/19/3/10","source":{"id":"https://openalex.org/S100666833","display_name":"The International Arab Journal of Information Technology","issn_l":"1683-3198","issn":["1683-3198","2309-4524"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4362726017","host_organization_name":"Zarqa University","host_organization_lineage":["https://openalex.org/P4362726017"],"host_organization_lineage_names":["Zarqa University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Arab Journal of Information Technology","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.34028/iajit/19/3/10","is_oa":true,"landing_page_url":"https://doi.org/10.34028/iajit/19/3/10","pdf_url":"https://doi.org/10.34028/iajit/19/3/10","source":{"id":"https://openalex.org/S100666833","display_name":"The International Arab Journal of Information Technology","issn_l":"1683-3198","issn":["1683-3198","2309-4524"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4362726017","host_organization_name":"Zarqa University","host_organization_lineage":["https://openalex.org/P4362726017"],"host_organization_lineage_names":["Zarqa University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Arab Journal of Information Technology","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5899999737739563,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4226298527.pdf","grobid_xml":"https://content.openalex.org/works/W4226298527.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W319032569","https://openalex.org/W1196375415","https://openalex.org/W1454185496","https://openalex.org/W1751962365","https://openalex.org/W1965059296","https://openalex.org/W1966907853","https://openalex.org/W1977366836","https://openalex.org/W2018996716","https://openalex.org/W2047300736","https://openalex.org/W2052387539","https://openalex.org/W2142667375","https://openalex.org/W2191006491","https://openalex.org/W2212753854","https://openalex.org/W2346047936","https://openalex.org/W2346678167","https://openalex.org/W2426032775","https://openalex.org/W2548532227","https://openalex.org/W2564039157","https://openalex.org/W2732383329","https://openalex.org/W2769342702","https://openalex.org/W2794170621","https://openalex.org/W2923628441","https://openalex.org/W3136579230","https://openalex.org/W4255996415","https://openalex.org/W6628496544","https://openalex.org/W6731346351","https://openalex.org/W6761185813"],"related_works":["https://openalex.org/W2622458042","https://openalex.org/W4321636153","https://openalex.org/W4224946860","https://openalex.org/W3210918776","https://openalex.org/W2016647367","https://openalex.org/W16836940","https://openalex.org/W6229082","https://openalex.org/W2798481441","https://openalex.org/W3195168932","https://openalex.org/W4226298527"],"abstract_inverted_index":{"Today,":[0],"due":[1],"to":[2,91,111],"the":[3,9,17,35,49,56,79,82,125,136,157,160,176,179,196],"growing":[4],"use":[5,18],"of":[6,11,13,19,38,43,51,62,81,118,159],"computer":[7],"networks,":[8],"issue":[10],"security":[12],"these":[14,148],"networks":[15],"and":[16,76,124,187,195],"intrusion":[20,31,52],"detection":[21,32,53],"systems":[22,33,54],"has":[23,47],"received":[24],"serious":[25],"attention.":[26],"A":[27],"major":[28],"challenge":[29],"in":[30,55,188],"is":[34,73,99,109,121,128,153],"enormous":[36],"amount":[37],"data.":[39],"The":[40,59,170],"generalization":[41],"capability":[42],"support":[44,64,94,131],"vector":[45,65,95,132],"machine":[46,66,96],"attracted":[48],"attention":[50],"last":[57],"years.":[58],"main":[60],"drawbacks":[61],"a":[63,88,116,189],"occur":[67],"during":[68],"its":[69],"training":[70,97],"phase,":[71],"which":[72],"computationally":[74],"expensive":[75],"dependent":[77],"on":[78,135],"size":[80],"input":[83],"dataset.":[84],"In":[85,101],"this":[86],"study,":[87],"new":[89],"algorithm":[90],"speed":[92],"up":[93],"time":[98],"presented.":[100],"proposed":[102,161,180],"method,":[103,162],"First,":[104],"Ant":[105],"Colony":[106],"Optimization":[107],"(ACO)":[108],"used":[110],"find":[112],"prototype":[113,119],"samples,":[114,150],"then":[115],"number":[117],"samples":[120,141],"randomly":[122],"selected":[123],"approximate":[126,137],"boundary":[127,138,140,149],"determined":[129,143],"using":[130,144],"machine.":[133],"Based":[134],"obtained,":[139],"are":[142],"decision":[145],"tree.":[146],"Using":[147],"final":[151],"model":[152,181],"obtained.":[154],"To":[155],"demonstrate":[156],"effectiveness":[158],"standard":[163],"publicly":[164],"available":[165],"datasets":[166],"have":[167],"been":[168],"used.":[169],"experiment":[171],"results":[172,183],"show":[173],"that":[174],"despite":[175],"data":[177],"reduction,":[178],"produces":[182],"with":[184],"similar":[185],"accuracy":[186],"faster":[190],"way":[191],"than":[192],"state-of-the":[193],"art":[194],"current":[197],"Support":[198],"Vector":[199],"Machine":[200],"(SVM)":[201],"implementations.":[202]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}