{"id":"https://openalex.org/W1968500033","doi":"https://doi.org/10.1109/socpar.2014.7007990","title":"Complex systems approximate matching approach for large graphs classification optimized by NSGA-II","display_name":"Complex systems approximate matching approach for large graphs classification optimized by NSGA-II","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W1968500033","doi":"https://doi.org/10.1109/socpar.2014.7007990","mag":"1968500033"},"language":"en","primary_location":{"id":"doi:10.1109/socpar.2014.7007990","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2014.7007990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 6th International Conference of Soft Computing and Pattern Recognition (SoCPaR)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5090064057","display_name":"Abir M\u05f3Baya","orcid":"https://orcid.org/0000-0002-2531-1978"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Abir M'baya","raw_affiliation_strings":["Universit\u00e9 de Sfax","Universite de Sfax"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Sfax","institution_ids":["https://openalex.org/I142899784"]},{"raw_affiliation_string":"Universite de Sfax","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113650812","display_name":"Omar Hammami","orcid":null},"institutions":[{"id":"https://openalex.org/I201181511","display_name":"\u00c9cole Nationale Sup\u00e9rieure de Techniques Avanc\u00e9es","ror":"https://ror.org/0309cs235","country_code":"FR","type":"education","lineage":["https://openalex.org/I201181511","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4405258625","display_name":"\u00c9cole Nationale Sup\u00e9rieure de Techniques Avanc\u00e9es Paris","ror":"https://ror.org/0106ccb15","country_code":"FR","type":"education","lineage":["https://openalex.org/I201181511","https://openalex.org/I4210145102","https://openalex.org/I4405258625"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Omar Hammami","raw_affiliation_strings":["ENSTA ParisTech","ENSTA-ParisTech#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ENSTA ParisTech","institution_ids":["https://openalex.org/I201181511"]},{"raw_affiliation_string":"ENSTA-ParisTech#TAB#","institution_ids":["https://openalex.org/I201181511","https://openalex.org/I4405258625"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":null,"first_page":"112","last_page":"117"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9872999787330627,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9847999811172485,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.645878255367279},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6412690281867981},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3375137150287628},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24116024374961853},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07278132438659668}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.645878255367279},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6412690281867981},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3375137150287628},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24116024374961853},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07278132438659668}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/socpar.2014.7007990","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2014.7007990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 6th International Conference of Soft Computing and Pattern Recognition (SoCPaR)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01762579v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01762579","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"6th International Conference of Soft Computing and Pattern Recognition (SoCPaR), 2014, Unknown, Unknown Region. pp.112--117, ⟨10.1109/SOCPAR.2014.7007990⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6000000238418579,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W90018616","https://openalex.org/W1502274520","https://openalex.org/W1567601724","https://openalex.org/W1965224643","https://openalex.org/W1975844474","https://openalex.org/W1995293461","https://openalex.org/W2013934077","https://openalex.org/W2019030165","https://openalex.org/W2032338144","https://openalex.org/W2037012153","https://openalex.org/W2061701011","https://openalex.org/W2064844864","https://openalex.org/W2065065169","https://openalex.org/W2116341502","https://openalex.org/W2126105956","https://openalex.org/W2157251480","https://openalex.org/W2158614393","https://openalex.org/W2170321395","https://openalex.org/W2222512263","https://openalex.org/W2500297254","https://openalex.org/W4235965783","https://openalex.org/W4255179379","https://openalex.org/W6666974618","https://openalex.org/W6675475866","https://openalex.org/W6724204988"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W4402327032","https://openalex.org/W2382290278"],"abstract_inverted_index":{"Complex":[0],"systems":[1,29,75],"are":[2,30,147],"strongly":[3],"emerging":[4],"in":[5,35,52,76,120],"various":[6],"domains":[7],"from":[8],"defense/space":[9],"to":[10,19,48,110,122,144],"network":[11],"of":[12,26,45,68,71,81,106,131,159],"enterprises.":[13],"Graph":[14],"modeling":[15],"is":[16,44,109,134],"extensively":[17],"used":[18],"represent":[20],"these":[21,27,54,72],"complex":[22,28,82,163],"systems.":[23,55,64,83,164],"The":[24,56,103,127,142],"design":[25,36],"increasingly":[31],"under":[32],"stringent":[33],"constraints":[34],"cost":[37],"and":[38,74,100,151],"Time":[39],"To":[40],"Market":[41],"(T.T.M.).":[42],"It":[43],"paramount":[46],"importance":[47],"exploit":[49],"\u201cdesign-and-reuse\u201d":[50],"approaches":[51],"building":[53],"reuse":[57],"can":[58],"be":[59,145],"based":[60,94],"on":[61,95,114],"subsystems":[62,73],"or":[63],"Reuse":[65],"requires":[66],"identification":[67],"graph":[69,79,91],"representations":[70],"the":[77,112,124,132,148,152,157],"large":[78,90],"representation":[80],"We":[84],"propose":[85],"a":[86],"combined":[87],"approach":[88,93,161],"for":[89,162],"classification":[92,133],"an":[96],"approximate":[97],"matching":[98],"method":[99,108],"genetic":[101],"algorithm.":[102],"first":[104],"stage":[105,129],"this":[107],"perform":[111],"comparison":[113],"simpler":[115],"graphs":[116,119],"called":[117],"prime":[118],"order":[121],"refine":[123],"time":[125],"complexity.":[126],"second":[128],"quality":[130],"improved":[135],"through":[136],"multiobjective":[137],"optimization":[138],"with":[139],"NSGA":[140],"II.":[141],"values":[143],"optimized":[146],"recognition":[149],"rate":[150],"confusion":[153],"rate.":[154],"Experiment":[155],"demonstrate":[156],"validity":[158],"our":[160]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}