{"id":"https://openalex.org/W2892056287","doi":"https://doi.org/10.1109/trustcom/bigdatase.2018.00054","title":"An Improved Monte Carlo Graph Search Algorithm for Optimal Attack Path Analysis","display_name":"An Improved Monte Carlo Graph Search Algorithm for Optimal Attack Path Analysis","publication_year":2018,"publication_date":"2018-08-01","ids":{"openalex":"https://openalex.org/W2892056287","doi":"https://doi.org/10.1109/trustcom/bigdatase.2018.00054","mag":"2892056287"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/trustcom/bigdatase.2018.00054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5100643523","display_name":"Huimin Xie","orcid":"https://orcid.org/0000-0002-5717-5034"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hui Xie","raw_affiliation_strings":["Sch. of Software, Beijing Inst. of Technol., Beijing, China"],"affiliations":[{"raw_affiliation_string":"Sch. of Software, Beijing Inst. of Technol., Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084536121","display_name":"Kun Lv","orcid":"https://orcid.org/0000-0002-5411-5466"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kun Lv","raw_affiliation_strings":["Sch. of Software, Beijing Inst. of Technol., Beijing, China"],"affiliations":[{"raw_affiliation_string":"Sch. of Software, Beijing Inst. of Technol., Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102753688","display_name":"Changzhen Hu","orcid":"https://orcid.org/0000-0002-2711-7060"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Changzhen Hu","raw_affiliation_strings":["Sch. of Software, Beijing Inst. of Technol., Beijing, China"],"affiliations":[{"raw_affiliation_string":"Sch. of Software, Beijing Inst. of Technol., Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":62},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10400","display_name":"Network Intrusion Detection and Defense Mechanisms","score":0.9998,"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 Intrusion Detection and Defense Mechanisms","score":0.9998,"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/T10734","display_name":"Information Security Policy Compliance and Awareness","score":0.9949,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11598","display_name":"Machine Learning for Internet Traffic Classification","score":0.9866,"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/attack-graphs","display_name":"Attack Graphs","score":0.607564},{"id":"https://openalex.org/keywords/traffic-analysis","display_name":"Traffic Analysis","score":0.544773},{"id":"https://openalex.org/keywords/intrusion-detection","display_name":"Intrusion Detection","score":0.530487}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6617775},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5717624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.53069705},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.52893645},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47010845},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4549633},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.4267207},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41719055},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40323338},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21025139},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18518287},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14994335},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/trustcom/bigdatase.2018.00054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":4,"referenced_works":["https://openalex.org/W1530962402","https://openalex.org/W2091673436","https://openalex.org/W2207375515","https://openalex.org/W82848659"],"related_works":["https://openalex.org/W4285338599","https://openalex.org/W4283826969","https://openalex.org/W2767428579","https://openalex.org/W2553274123","https://openalex.org/W2492548042","https://openalex.org/W2377010080","https://openalex.org/W2365800168","https://openalex.org/W2353880500","https://openalex.org/W2182624400","https://openalex.org/W1992807692"],"abstract_inverted_index":{"The":[0,173],"problem":[1,44,78],"of":[2,9,34,45,79,141,160],"optimal":[3,22,68,101,166],"attack":[4,23,69,102,121,167,192],"path":[5,46,80,143],"analysis":[6],"is":[7,88,97,114,125,154],"one":[8,170],"the":[10,43,52,77,129,132,137,145,158,161],"hotspots":[11],"in":[12,71,119,144,169],"network":[13,153],"security.":[14],"Many":[15],"methods":[16,39,50],"are":[17,182],"available":[18],"to":[19,42,66,99,127,156,164],"calculate":[20,67,100,128],"an":[21,58,120],"path,":[24],"such":[25],"as":[26],"Q-learning":[27],"algorithm,":[28],"heuristic":[29],"algorithms,":[30],"etc.":[31],"But":[32],"most":[33],"them":[35],"have":[36],"shortcomings.":[37],"Some":[38],"can":[40,75],"lead":[41],"loss,":[47],"and":[48,82,94,136,181,190],"some":[49],"render":[51],"result":[53],"un-comprehensive.":[54],"This":[55,123],"article":[56],"proposes":[57],"improved":[59],"Monte":[60],"Carlo":[61],"Graph":[62],"Search":[63],"algorithm":[64,163],"(IMCGS)":[65],"paths":[70,168],"target":[72,146],"network.":[73,147],"IMCGS":[74,87,177],"avoid":[76],"loss":[81],"get":[83],"comprehensive":[84],"results":[85,174],"quickly.":[86],"divided":[89],"into":[90],"two":[91],"steps:":[92],"selection":[93],"backpropagation,":[95],"which":[96],"used":[98,126],"paths.":[103],"A":[104],"weight":[105],"vector":[106,124],"containing":[107],"priority,":[108],"host":[109,118],"connection":[110],"number,":[111],"CVSS":[112,134,139],"value":[113,135,140],"proposed":[115,162],"for":[116,149],"every":[117],"path.":[122],"evaluation":[130],"value,":[131],"total":[133],"average":[138],"a":[142,150],"Result":[148],"sample":[151],"test":[152],"presented":[155],"demonstrate":[157],"capabilities":[159],"generate":[165],"single":[171],"run.":[172],"obtained":[175],"by":[176],"show":[178],"good":[179],"performance":[180],"compared":[183],"with":[184],"Ant":[185],"Colony":[186],"Optimization":[187],"Algorithm":[188],"(ACO)":[189],"k-zero":[191],"graph.":[193]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2892056287","counts_by_year":[],"updated_date":"2024-09-30T04:03:49.446777","created_date":"2018-09-27"}
