{"id":"https://openalex.org/W2493009290","doi":"https://doi.org/10.1109/aiccsa.2015.7507244","title":"Structural-semantic approach for approximate frequent subgraph mining","display_name":"Structural-semantic approach for approximate frequent subgraph mining","publication_year":2015,"publication_date":"2015-11-01","ids":{"openalex":"https://openalex.org/W2493009290","doi":"https://doi.org/10.1109/aiccsa.2015.7507244","mag":"2493009290"},"language":"en","primary_location":{"id":"doi:10.1109/aiccsa.2015.7507244","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aiccsa.2015.7507244","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA)","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/A5008584064","display_name":"Mohamed Moussaoui","orcid":null},"institutions":[{"id":"https://openalex.org/I2800887215","display_name":"Tunisia Polytechnic School","ror":"https://ror.org/00dse3307","country_code":"TN","type":"education","lineage":["https://openalex.org/I2800887215"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Mohamed Moussaoui","raw_affiliation_strings":["BESTMOD Laboratory, Tunisia Central Polytechnic School of Tunis"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BESTMOD Laboratory, Tunisia Central Polytechnic School of Tunis","institution_ids":["https://openalex.org/I2800887215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069589689","display_name":"Montaceur Zaghdoud","orcid":null},"institutions":[{"id":"https://openalex.org/I142608572","display_name":"Prince Sattam Bin Abdulaziz University","ror":"https://ror.org/04jt46d36","country_code":"SA","type":"education","lineage":["https://openalex.org/I142608572"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Montaceur Zaghdoud","raw_affiliation_strings":["Information System Department, Prince Sattam bin Abdulaziz University, KSA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information System Department, Prince Sattam bin Abdulaziz University, KSA","institution_ids":["https://openalex.org/I142608572"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050082020","display_name":"Jalel Akaichi","orcid":"https://orcid.org/0000-0001-8849-8664"},"institutions":[{"id":"https://openalex.org/I82952536","display_name":"King Khalid University","ror":"https://ror.org/052kwzs30","country_code":"SA","type":"education","lineage":["https://openalex.org/I82952536"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Jalel Akaichi","raw_affiliation_strings":["Information System Department, King Khalid University, KSA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information System Department, King Khalid University, KSA","institution_ids":["https://openalex.org/I82952536"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1872,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63823259,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9988999962806702,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9972000122070312,"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/semantic-similarity","display_name":"Semantic similarity","score":0.7139627933502197},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6813632845878601},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4982283115386963},{"id":"https://openalex.org/keywords/semantic-matching","display_name":"Semantic matching","score":0.49034929275512695},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4902380108833313},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.452474981546402},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42935413122177124},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.42052197456359863},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.30993229150772095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23133397102355957},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16685378551483154},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.07642686367034912}],"concepts":[{"id":"https://openalex.org/C130318100","wikidata":"https://www.wikidata.org/wiki/Q2268914","display_name":"Semantic similarity","level":2,"score":0.7139627933502197},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6813632845878601},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4982283115386963},{"id":"https://openalex.org/C2778493491","wikidata":"https://www.wikidata.org/wiki/Q7449072","display_name":"Semantic matching","level":3,"score":0.49034929275512695},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4902380108833313},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.452474981546402},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42935413122177124},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.42052197456359863},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.30993229150772095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23133397102355957},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16685378551483154},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.07642686367034912},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aiccsa.2015.7507244","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aiccsa.2015.7507244","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.41999998688697815,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W69231701","https://openalex.org/W1490870867","https://openalex.org/W1511160855","https://openalex.org/W1573076042","https://openalex.org/W1641749581","https://openalex.org/W1816257748","https://openalex.org/W1964816496","https://openalex.org/W1985644065","https://openalex.org/W2004734764","https://openalex.org/W2009881509","https://openalex.org/W2019950953","https://openalex.org/W2022739485","https://openalex.org/W2053841470","https://openalex.org/W2059489519","https://openalex.org/W2098109165","https://openalex.org/W2100586946","https://openalex.org/W2105649185","https://openalex.org/W2107629766","https://openalex.org/W2108150886","https://openalex.org/W2110034858","https://openalex.org/W2110796598","https://openalex.org/W2121335352","https://openalex.org/W2126359798","https://openalex.org/W2127432713","https://openalex.org/W2136593687","https://openalex.org/W2136761100","https://openalex.org/W2140490872","https://openalex.org/W2142652836","https://openalex.org/W2145388307","https://openalex.org/W2156357380","https://openalex.org/W2161723275","https://openalex.org/W2162481448","https://openalex.org/W2167694177","https://openalex.org/W2170726034","https://openalex.org/W2244152248","https://openalex.org/W2335032481","https://openalex.org/W2737719135","https://openalex.org/W4229680399","https://openalex.org/W4239770359","https://openalex.org/W6602808383","https://openalex.org/W6630631696","https://openalex.org/W6636756987","https://openalex.org/W6665584461","https://openalex.org/W6677705264","https://openalex.org/W6685146747","https://openalex.org/W6741516231","https://openalex.org/W6983353029"],"related_works":["https://openalex.org/W2139549667","https://openalex.org/W1986106996","https://openalex.org/W2315716767","https://openalex.org/W2374902383","https://openalex.org/W4387489691","https://openalex.org/W2375695570","https://openalex.org/W4285012873","https://openalex.org/W2355975607","https://openalex.org/W2792318346","https://openalex.org/W2122517733"],"abstract_inverted_index":{"Frequent":[0],"subgraph":[1,154],"mining":[2,155],"refers":[3],"usually":[4],"to":[5,39,56,102,144,160,163],"graph":[6,31,43,85,100,121],"matching":[7,32,41,86,101],"and":[8,49,63,125,139,170],"it":[9,52],"is":[10,37],"widely":[11],"used":[12],"when":[13,42],"analyzing":[14],"big":[15],"data":[16],"with":[17,26],"large":[18],"graphs.":[19],"A":[20],"lot":[21],"of":[22,79,106],"research":[23],"works":[24],"dealt":[25],"structural":[27,82,98,116,138],"exact":[28],"or":[29],"inexact":[30],"but":[33],"a":[34,74,94,104,126],"little":[35],"attention":[36],"paid":[38],"semantic":[40,76,99,127,140],"vertices":[44,128],"and/or":[45],"edges":[46],"are":[47],"attributed":[48],"typed.":[50],"Therefore,":[51],"seems":[53],"very":[54],"interesting":[55],"integrate":[57],"background":[58],"knowledge":[59],"into":[60],"the":[61],"analysis":[62],"that":[64],"extracted":[65,146],"frequent":[66,107,147,153],"subgraphs":[67],"should":[68],"become":[69],"more":[70],"pruned":[71],"by":[72],"applying":[73],"new":[75,95,150],"filter":[77],"instead":[78],"using":[80],"only":[81],"similarity":[83,112,117,129],"in":[84],"process.":[87],"Consequently,":[88],"this":[89],"paper":[90],"focuses":[91],"on":[92,120,132],"developing":[93],"hybrid":[96,151],"approximate":[97,115],"discover":[103],"set":[105],"subgraphs.":[108],"It":[109],"uses":[110],"both":[111],"measures.":[113],"An":[114],"function":[118,124,130],"based":[119,131],"edit":[122],"distance":[123],"possibilistic":[133],"information":[134],"affinity":[135],"function.":[136],"Both":[137],"filters":[141],"contribute":[142],"together":[143],"prune":[145],"sets.":[148],"Indeed,":[149],"structural-semantic":[152],"approach":[156],"will":[157],"be":[158,161],"suitable":[159],"applied":[162],"several":[164],"applications":[165],"such":[166],"as":[167],"community":[168],"detection":[169],"social":[171],"network":[172],"analysis.":[173]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}