{"id":"https://openalex.org/W2049045732","doi":"https://doi.org/10.1109/hpcc.2012.256","title":"The Research and Amelioration of Pattern-matching Algorithm in Intrusion Detection System","display_name":"The Research and Amelioration of Pattern-matching Algorithm in Intrusion Detection System","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2049045732","doi":"https://doi.org/10.1109/hpcc.2012.256","mag":"2049045732"},"language":"en","primary_location":{"id":"doi:10.1109/hpcc.2012.256","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcc.2012.256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems","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/A5003250198","display_name":"Pei-fei Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210125098","display_name":"Hangzhou Vocational and Technical College","ror":"https://ror.org/03jjm4b17","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210125098"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Pei-fei Wu","raw_affiliation_strings":["Department of Information Science & Electronic, Hangzhou Vocational and Technical College, Hangzhou, China","Dept. of Inf. Sci. & Electron., Hangzhou Vocational & Tech. Coll., Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"Department of Information Science & Electronic, Hangzhou Vocational and Technical College, Hangzhou, China","institution_ids":["https://openalex.org/I4210125098"]},{"raw_affiliation_string":"Dept. of Inf. Sci. & Electron., Hangzhou Vocational & Tech. Coll., Hangzhou, China","institution_ids":["https://openalex.org/I4210125098"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006999129","display_name":"Hai-juan Shen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210125098","display_name":"Hangzhou Vocational and Technical College","ror":"https://ror.org/03jjm4b17","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210125098"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hai-juan Shen","raw_affiliation_strings":["Department of Information Science & Electronic, Hangzhou Vocational and Technical College, Hangzhou, China","Dept. of Inf. Sci. & Electron., Hangzhou Vocational & Tech. Coll., Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"Department of Information Science & Electronic, Hangzhou Vocational and Technical College, Hangzhou, China","institution_ids":["https://openalex.org/I4210125098"]},{"raw_affiliation_string":"Dept. of Inf. Sci. & Electron., Hangzhou Vocational & Tech. Coll., Hangzhou, China","institution_ids":["https://openalex.org/I4210125098"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003250198"],"corresponding_institution_ids":["https://openalex.org/I4210125098"],"apc_list":null,"apc_paid":null,"fwci":1.1711,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.78473227,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1712","last_page":"1715"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9406999945640564,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9406999945640564,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/algorithm","display_name":"Algorithm","score":0.7376227974891663},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6686081290245056},{"id":"https://openalex.org/keywords/intrusion-detection-system","display_name":"Intrusion detection system","score":0.6556338667869568},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.600886344909668},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.5639439225196838},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.5438677668571472},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.531399130821228},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5236934423446655},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.49753621220588684},{"id":"https://openalex.org/keywords/ramer\u2013douglas\u2013peucker-algorithm","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","score":0.44144207239151},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.43636590242385864},{"id":"https://openalex.org/keywords/dinics-algorithm","display_name":"Dinic's algorithm","score":0.4162095785140991},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18194612860679626},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16336721181869507},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09203794598579407}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7376227974891663},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6686081290245056},{"id":"https://openalex.org/C35525427","wikidata":"https://www.wikidata.org/wiki/Q745881","display_name":"Intrusion detection system","level":2,"score":0.6556338667869568},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.600886344909668},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.5639439225196838},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.5438677668571472},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.531399130821228},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5236934423446655},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.49753621220588684},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.44144207239151},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.43636590242385864},{"id":"https://openalex.org/C109111794","wikidata":"https://www.wikidata.org/wiki/Q730933","display_name":"Dinic's algorithm","level":5,"score":0.4162095785140991},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18194612860679626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16336721181869507},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09203794598579407},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcc.2012.256","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcc.2012.256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2248278495","https://openalex.org/W118527173","https://openalex.org/W2030610338","https://openalex.org/W2365918624","https://openalex.org/W2366381853","https://openalex.org/W2358758729","https://openalex.org/W2585673299","https://openalex.org/W1485468335","https://openalex.org/W2358898466","https://openalex.org/W2365371765"],"abstract_inverted_index":{"This":[0],"paper":[1],"makes":[2],"a":[3,104],"summary":[4],"of":[5,28,75,87],"pattern":[6,55,76],"matching":[7,100],"algorithm":[8,22,44,48,53,70,96],"in":[9],"Intrusion":[10],"Detection":[11],"System:":[12],"KMP":[13],"algorithm,":[14,16,18,20],"BM":[15],"BMH":[17],"BMHS":[19,89],"AC":[21],"and":[23,33,61,102],"AC-BM":[24,47],"algorithm.":[25,90],"The":[26,51],"performances":[27],"various":[29],"algorithms":[30],"are":[31],"analyzed,":[32],"then":[34],"through":[35],"the":[36,65,69,72,79,84,94,99],"experiment":[37],"data":[38],"is":[39,49],"verified.":[40],"Last":[41],"an":[42],"improved":[43,52,88,95],"based":[45,57],"on":[46,58],"proposed.":[50],"constructs":[54],"tree":[56],"binary":[59],"tree,":[60,77],"it":[62],"can":[63,97],"reduce":[64],"time.":[66],"In":[67],"addition,":[68],"increases":[71],"moving":[73],"distance":[74],"reduces":[78],"comparing":[80],"times":[81],"by":[82],"using":[83],"bad-character":[85],"rule":[86],"Experiments":[91],"show":[92],"that":[93],"accelerate":[98],"speed":[101],"has":[103],"good":[105],"time":[106],"performance.":[107]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}