{"id":"https://openalex.org/W7126463351","doi":"https://doi.org/10.3390/computers15020083","title":"Spider Community Detection: Seeded Geodesic Expansion with Modularity-Guided Refinement and Greedy Merge Matching","display_name":"Spider Community Detection: Seeded Geodesic Expansion with Modularity-Guided Refinement and Greedy Merge Matching","publication_year":2026,"publication_date":"2026-02-01","ids":{"openalex":"https://openalex.org/W7126463351","doi":"https://doi.org/10.3390/computers15020083"},"language":"en","primary_location":{"id":"doi:10.3390/computers15020083","is_oa":true,"landing_page_url":"https://doi.org/10.3390/computers15020083","pdf_url":"https://www.mdpi.com/2073-431X/15/2/83/pdf","source":{"id":"https://openalex.org/S4210228075","display_name":"Computers","issn_l":"2073-431X","issn":["2073-431X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/2073-431X/15/2/83/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090172873","display_name":"Hovhannes A. Harutyunyan","orcid":"https://orcid.org/0000-0001-7260-4186"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Hovhannes A. Harutyunyan","raw_affiliation_strings":["Department of Computer Science and Software Engineering, Concordia University, Montreal, QC H3G 1M8, Canada"],"raw_orcid":"https://orcid.org/0000-0001-7260-4186","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Concordia University, Montreal, QC H3G 1M8, Canada","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049075047","display_name":"Parsa Kamalipour","orcid":"https://orcid.org/0000-0003-2546-9676"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Parsa Kamalipour","raw_affiliation_strings":["Department of Computer Science and Software Engineering, Concordia University, Montreal, QC H3G 1M8, Canada"],"raw_orcid":"https://orcid.org/0000-0003-2546-9676","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, Concordia University, Montreal, QC H3G 1M8, Canada","institution_ids":["https://openalex.org/I60158472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049075047","https://openalex.org/A5090172873"],"corresponding_institution_ids":["https://openalex.org/I60158472"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1732},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1732},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18953545,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"2","first_page":"83","last_page":"83"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.7439000010490417,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.7439000010490417,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.06790000200271606,"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/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.019700000062584877,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.6175000071525574},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.5268999934196472},{"id":"https://openalex.org/keywords/spider","display_name":"Spider","score":0.4997999966144562},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.4083999991416931},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.38179999589920044},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.374099999666214},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.32739999890327454},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.3156999945640564}],"concepts":[{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.6175000071525574},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.5268999934196472},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5202999711036682},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5123999714851379},{"id":"https://openalex.org/C2780181586","wikidata":"https://www.wikidata.org/wiki/Q3966705","display_name":"Spider","level":2,"score":0.4997999966144562},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44909998774528503},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.4083999991416931},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.38179999589920044},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.374099999666214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37310001254081726},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.329800009727478},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.32739999890327454},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.3156999945640564},{"id":"https://openalex.org/C65185188","wikidata":"https://www.wikidata.org/wiki/Q107775","display_name":"Streak","level":2,"score":0.30820000171661377},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.290800005197525},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.28999999165534973},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2825999855995178},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2689000070095062},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2628999948501587},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.260699987411499}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/computers15020083","is_oa":true,"landing_page_url":"https://doi.org/10.3390/computers15020083","pdf_url":"https://www.mdpi.com/2073-431X/15/2/83/pdf","source":{"id":"https://openalex.org/S4210228075","display_name":"Computers","issn_l":"2073-431X","issn":["2073-431X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:95a8db0996df466c9fdd61dc237b19ab","is_oa":false,"landing_page_url":"https://doaj.org/article/95a8db0996df466c9fdd61dc237b19ab","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computers, Vol 15, Iss 2, p 83 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/computers15020083","is_oa":true,"landing_page_url":"https://doi.org/10.3390/computers15020083","pdf_url":"https://www.mdpi.com/2073-431X/15/2/83/pdf","source":{"id":"https://openalex.org/S4210228075","display_name":"Computers","issn_l":"2073-431X","issn":["2073-431X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7126463351.pdf","grobid_xml":"https://content.openalex.org/works/W7126463351.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Community":[0,18],"detection":[1],"plays":[2],"a":[3,20,28,37,44,61,80],"central":[4],"role":[5],"in":[6,144],"understanding":[7],"the":[8,58,84,88,94,141],"modular":[9],"structure":[10,110],"of":[11,93,146],"complex":[12],"networks.":[13],"This":[14],"work":[15],"introduces":[16],"Spider":[17,134],"Detection,":[19],"hybrid":[21],"local\u2013global":[22],"algorithm":[23,59],"that":[24,133,137],"constructs":[25],"communities":[26,154],"through":[27,65],"depth-bounded":[29],"geodesic":[30],"expansion":[31],"process.":[32],"Each":[33],"spider":[34,86],"originates":[35],"from":[36],"structurally":[38],"strong":[39],"seed":[40],"node":[41],"selected":[42],"using":[43,74],"composite":[45],"score":[46],"based":[47],"on":[48,117],"degree,":[49],"triangle":[50],"participation,":[51],"and":[52,100,119,130,149],"local":[53,98,109],"clustering.":[54],"From":[55],"each":[56],"seed,":[57],"grows":[60],"localized":[62],"spider-shaped":[63],"subgraph":[64],"bounded":[66],"breadth-first":[67],"exploration,":[68],"where":[69],"candidate":[70],"nodes":[71],"are":[72,138],"evaluated":[73],"true":[75],"modularity":[76],"gain":[77],"together":[78],"with":[79,111,140,155],"triangle-closure":[81],"signal.":[82],"After":[83],"initial":[85],"construction,":[87],"method":[89],"applies":[90],"modularity-guided":[91],"attachment":[92],"remaining":[95],"vertices,":[96],"Louvain-style":[97],"refinement,":[99],"greedy":[101],"merge":[102],"matching":[103],"under":[104,158],"conductance":[105],"constraints":[106],"to":[107],"reconcile":[108],"global":[112],"partition":[113],"coherence.":[114],"Experimental":[115],"evaluations":[116],"real":[118],"benchmark":[120],"datasets,":[121],"including":[122],"Karate":[123],"Club,":[124],"High":[125],"School,":[126],"Political":[127],"Blogs,":[128],"Cora,":[129],"DBLP,":[131],"show":[132],"produces":[135],"partitions":[136],"competitive":[139],"established":[142],"methods":[143],"terms":[145],"ground-truth":[147],"recovery":[148],"structural":[150],"quality,":[151],"while":[152],"yielding":[153],"sharp":[156],"boundaries":[157],"conductance-sensitive":[159],"evaluation.":[160]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-02-02T00:00:00"}