{"id":"https://openalex.org/W2240671915","doi":"https://doi.org/10.1109/icnc.2015.7377989","title":"An evolutionary computing approach for mining most frequent subgraph by using size value evaluation","display_name":"An evolutionary computing approach for mining most frequent subgraph by using size value evaluation","publication_year":2015,"publication_date":"2015-08-01","ids":{"openalex":"https://openalex.org/W2240671915","doi":"https://doi.org/10.1109/icnc.2015.7377989","mag":"2240671915"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2015.7377989","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2015.7377989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 11th International Conference on Natural Computation (ICNC)","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/A5030766899","display_name":"Abdullah Almethen","orcid":null},"institutions":[{"id":"https://openalex.org/I79060951","display_name":"East Stroudsburg University","ror":"https://ror.org/05atz9219","country_code":"US","type":"education","lineage":["https://openalex.org/I79060951"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abdullah Almethen","raw_affiliation_strings":["Department of Computer Science, East Stroudsburg University, East Stroudsburg, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, East Stroudsburg University, East Stroudsburg, PA, USA","institution_ids":["https://openalex.org/I79060951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101612165","display_name":"Dongsheng Che","orcid":"https://orcid.org/0000-0002-3086-6513"},"institutions":[{"id":"https://openalex.org/I79060951","display_name":"East Stroudsburg University","ror":"https://ror.org/05atz9219","country_code":"US","type":"education","lineage":["https://openalex.org/I79060951"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dongsheng Che","raw_affiliation_strings":["Department of Computer Science, East Stroudsburg University, East Stroudsburg, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, East Stroudsburg University, East Stroudsburg, PA, USA","institution_ids":["https://openalex.org/I79060951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I79060951"],"apc_list":null,"apc_paid":null,"fwci":0.824,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.82793534,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"31","issue":null,"first_page":"194","last_page":"199"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9998000264167786,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9941999912261963,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9876999855041504,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.6473755240440369},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5899002552032471},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5127783417701721},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.48639777302742004},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.45740464329719543},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4200814366340637},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33454084396362305},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2920476198196411},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23891764879226685}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6473755240440369},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5899002552032471},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5127783417701721},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.48639777302742004},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.45740464329719543},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4200814366340637},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33454084396362305},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2920476198196411},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23891764879226685},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2015.7377989","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2015.7377989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 11th International Conference on Natural Computation (ICNC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W146846153","https://openalex.org/W272982077","https://openalex.org/W1493919779","https://openalex.org/W1512383952","https://openalex.org/W1513522676","https://openalex.org/W1519958746","https://openalex.org/W1533610215","https://openalex.org/W1586764809","https://openalex.org/W1962172852","https://openalex.org/W1970259423","https://openalex.org/W1986354332","https://openalex.org/W2011039300","https://openalex.org/W2028260614","https://openalex.org/W2067695335","https://openalex.org/W2108150886","https://openalex.org/W2115902930","https://openalex.org/W2119148238","https://openalex.org/W2124297777","https://openalex.org/W2124996875","https://openalex.org/W2136593687","https://openalex.org/W2154847327","https://openalex.org/W2166591770","https://openalex.org/W2168209541","https://openalex.org/W2170726034","https://openalex.org/W2402933174","https://openalex.org/W2952769273","https://openalex.org/W4246472677","https://openalex.org/W6605950029","https://openalex.org/W6635126959","https://openalex.org/W6678773695","https://openalex.org/W6685146747"],"related_works":["https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W85101999","https://openalex.org/W2391924736","https://openalex.org/W3133779647","https://openalex.org/W4291270682","https://openalex.org/W1560122427","https://openalex.org/W2593449396","https://openalex.org/W2780789525","https://openalex.org/W2787833928"],"abstract_inverted_index":{"Graph":[0],"databases":[1],"have":[2,31],"become":[3],"one":[4,20,114],"of":[5,21,56,92,97,105,110,126,145],"the":[6,22,36,54,90,108,124,142],"most":[7,23,37,75],"attractive":[8],"areas":[9],"for":[10,73],"researchers,":[11],"especially":[12],"in":[13,26],"data":[14],"mining":[15,74],"field.":[16],"Frequent":[17],"subgraphs":[18,77,137],"are":[19],"actively":[24],"researched":[25],"this":[27],"area.":[28],"Numerous":[29],"algorithms":[30],"been":[32],"developed":[33],"to":[34,63,88,100],"find":[35],"frequent":[38,76,136],"subgraphs,":[39],"such":[40],"as":[41],"SUBDUE":[42],"algorithm,":[43],"which":[44],"uses":[45],"a":[46,93],"computationally":[47],"constrained":[48],"beam.":[49],"Consequently,":[50],"it":[51],"will":[52],"lose":[53],"chance":[55],"producing":[57],"suboptimal":[58],"subgraphs.":[59],"This":[60],"approach":[61],"aims":[62],"provide":[64],"another":[65],"method":[66],"by":[67],"employing":[68],"an":[69],"evolutionary":[70,98],"computing":[71],"algorithm":[72,112,133],"using":[78],"subgraph":[79],"size":[80],"value":[81],"based":[82],"on":[83,113],"SUBDUE.":[84,127],"The":[85],"purpose":[86],"is":[87],"take":[89],"advantage":[91],"global":[94],"search":[95],"feature":[96],"programming":[99],"discover":[101,135],"different":[102],"space":[103],"solutions":[104],"subgraphs.We":[106],"tested":[107],"performance":[109,125],"our":[111,132,146],"artificial":[115],"generated":[116],"dataset,":[117],"and":[118,122],"two":[119],"real":[120],"datasets,":[121],"compared":[123],"Our":[128],"results":[129],"show":[130],"that":[131],"could":[134],"faster":[138],"than":[139],"SUBDUE,":[140],"indicating":[141],"potential":[143],"usefulness":[144],"algorithm.":[147]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}