{"id":"https://openalex.org/W3204364879","doi":"https://doi.org/10.1145/3478905.3478986","title":"Algorithm for Mining Structural Holes in Weighted Networks","display_name":"Algorithm for Mining Structural Holes in Weighted Networks","publication_year":2021,"publication_date":"2021-07-23","ids":{"openalex":"https://openalex.org/W3204364879","doi":"https://doi.org/10.1145/3478905.3478986","mag":"3204364879"},"language":"en","primary_location":{"id":"doi:10.1145/3478905.3478986","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3478905.3478986","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 4th International Conference on Data Science and Information Technology","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/A5109045763","display_name":"Biao Ning","orcid":null},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Biao Ning","raw_affiliation_strings":["Yunnan University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yunnan University, China","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104122533","display_name":"Bing Kong","orcid":null},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bing Kong","raw_affiliation_strings":["Yunnan University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yunnan University, China","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100653521","display_name":"Lihua Zhou","orcid":"https://orcid.org/0000-0002-8940-1155"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"LiHua Zhou","raw_affiliation_strings":["Yunnan University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yunnan University, China","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111184572","display_name":"Chongming Bao","orcid":null},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"ChongMing Bao","raw_affiliation_strings":["Yunnan University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yunnan University, China","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084429086","display_name":"Chongyun Wang","orcid":"https://orcid.org/0000-0002-3947-7370"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"ChongYun Wang","raw_affiliation_strings":["Yunnan University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yunnan University, China","institution_ids":["https://openalex.org/I189210763"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I189210763"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19565217,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"420","last_page":"426"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9993000030517578,"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.9993000030517578,"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.9807999730110168,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9032999873161316,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7693870067596436},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7628811597824097},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6710109114646912},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6570995450019836},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.631657063961029},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5828295946121216},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5672075152397156},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5359609127044678},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.519575834274292},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5157414078712463},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.49970102310180664},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.48950231075286865},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.4855642020702362},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.41701966524124146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26199015974998474},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15754130482673645},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08530429005622864}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7693870067596436},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7628811597824097},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6710109114646912},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6570995450019836},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.631657063961029},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5828295946121216},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5672075152397156},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5359609127044678},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.519575834274292},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5157414078712463},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.49970102310180664},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.48950231075286865},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.4855642020702362},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.41701966524124146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26199015974998474},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15754130482673645},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08530429005622864},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3478905.3478986","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3478905.3478986","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 4th International Conference on Data Science and Information Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1537224004","https://openalex.org/W1993213860","https://openalex.org/W2050386036","https://openalex.org/W2056944867","https://openalex.org/W2103015038","https://openalex.org/W2109469951","https://openalex.org/W2308925639","https://openalex.org/W2907674958","https://openalex.org/W2916735102","https://openalex.org/W4244387885"],"related_works":["https://openalex.org/W651485002","https://openalex.org/W2597144308","https://openalex.org/W2136320479","https://openalex.org/W2352589493","https://openalex.org/W2348287729","https://openalex.org/W2810620529","https://openalex.org/W2358661218","https://openalex.org/W2537573442","https://openalex.org/W2161960576","https://openalex.org/W1970736992"],"abstract_inverted_index":{"In":[0,70],"social":[1],"networks,":[2],"structural":[3,15,33,153,183],"holes":[4,16,184],"are":[5,37,96],"at":[6,39],"the":[7,31,47,55,58,65,71,78,81,94,121,127,135,138,143,148,152,158,160,164,189,194,203,206],"critical":[8],"position":[9],"of":[10,30,57,67,93,142,157,175,205],"information":[11],"dissemination.":[12],"Accurately":[13],"finding":[14],"plays":[17],"an":[18],"important":[19,27],"role":[20],"in":[21,43,126,137],"blocking":[22],"public":[23,176],"opinion":[24],"and":[25,90,98,130,133,167,179,185,198,201],"disseminating":[26],"knowledge.":[28],"Most":[29],"existing":[32,82],"hole":[34,154],"mining":[35],"algorithms":[36,169],"aimed":[38],"unweighted":[40],"graphs.":[41],"However,":[42],"a":[44,50,99,173],"real":[45],"network,":[46,129],"weight":[48],"has":[49],"very":[51],"large":[52],"impact":[53],"on":[54,64,109,172,188],"performance":[56],"entire":[59],"network.":[60],"This":[61],"paper":[62],"focuses":[63],"study":[66],"weighted":[68,110,128,144],"networks.":[69],"shortest":[72,83,111,122,139],"path":[73,84,112,123,140],"increment":[74,85],"index":[75],"introduced":[76],"by":[77,146],"side":[79],"weight,":[80],"algorithm":[86,95,107,115,166],"SNV":[87],"is":[88,102],"weighted,":[89],"some":[91],"probabilities":[92],"redefined,":[97],"new":[100,105],"method":[101],"proposed.":[103],"A":[104],"incremental":[106],"based":[108],"(SNV-W).":[113],"The":[114],"first":[116],"uses":[117],"Dijkstra":[118],"to":[119,150,192],"calculate":[120],"between":[124],"nodes":[125,149],"then":[131],"compares":[132],"calculates":[134],"change":[136],"value":[141,156],"network":[145],"deleting":[147],"determine":[151],"attribute":[155],"node":[159],"size":[161],"of.":[162],"Finally,":[163],"SNV-W":[165],"other":[168],"were":[170],"tested":[171],"number":[174],"data":[177],"sets,":[178],"they":[180],"dig":[181],"out":[182],"spread":[186],"them":[187],"SIR":[190],"model":[191],"observe":[193],"experimental":[195],"effects,":[196],"compare":[197],"analyze":[199],"them,":[200],"verify":[202],"effectiveness":[204],"algorithm.":[207]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}