{"id":"https://openalex.org/W2017580082","doi":"https://doi.org/10.1109/infocom.2014.6848166","title":"Modeling social network relationships via t-cherry junction trees","display_name":"Modeling social network relationships via t-cherry junction trees","publication_year":2014,"publication_date":"2014-04-01","ids":{"openalex":"https://openalex.org/W2017580082","doi":"https://doi.org/10.1109/infocom.2014.6848166","mag":"2017580082"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2014.6848166","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2014.6848166","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications","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/A5064338854","display_name":"Brian Proulx","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian Proulx","raw_affiliation_strings":["Computer and Energy Engineering, Arizona State University, Tempe, AZ","Sch. of Electr., Arizona State Univ., Tempe, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Energy Engineering, Arizona State University, Tempe, AZ","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Sch. of Electr., Arizona State Univ., Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027033026","display_name":"Junshan Zhang","orcid":"https://orcid.org/0000-0002-3840-1753"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Junshan Zhang","raw_affiliation_strings":["Computer and Energy Engineering, Arizona State University, Tempe, AZ","Sch. of Electr., Arizona State Univ., Tempe, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer and Energy Engineering, Arizona State University, Tempe, AZ","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Sch. of Electr., Arizona State Univ., Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2229","last_page":"2237"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9990000128746033,"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.9990000128746033,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9973999857902527,"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/T11106","display_name":"Data Management and Algorithms","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.7084314823150635},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6540424227714539},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5560822486877441},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5465459823608398},{"id":"https://openalex.org/keywords/graphical-model","display_name":"Graphical model","score":0.5378197431564331},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.5357526540756226},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5110224485397339},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5110083818435669},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4661399722099304},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4639233350753784},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.359149694442749},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3399299085140228},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3023267090320587},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1823045015335083},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10646495223045349}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7084314823150635},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6540424227714539},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5560822486877441},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5465459823608398},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.5378197431564331},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5357526540756226},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5110224485397339},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5110083818435669},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4661399722099304},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4639233350753784},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.359149694442749},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3399299085140228},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3023267090320587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1823045015335083},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10646495223045349},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2014.6848166","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2014.6848166","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W19533915","https://openalex.org/W22572007","https://openalex.org/W1530670205","https://openalex.org/W1560512119","https://openalex.org/W1669131436","https://openalex.org/W1942751890","https://openalex.org/W1992032143","https://openalex.org/W2070232376","https://openalex.org/W2083543651","https://openalex.org/W2089295672","https://openalex.org/W2100618668","https://openalex.org/W2131082375","https://openalex.org/W2137813581","https://openalex.org/W2157647850","https://openalex.org/W2163166770","https://openalex.org/W2405938317","https://openalex.org/W2420733993","https://openalex.org/W3103487330","https://openalex.org/W4285719527","https://openalex.org/W6600944653","https://openalex.org/W6633434192","https://openalex.org/W6637339356","https://openalex.org/W6713699806"],"related_works":["https://openalex.org/W2109986081","https://openalex.org/W2417308975","https://openalex.org/W4297589944","https://openalex.org/W4368755698","https://openalex.org/W2964129930","https://openalex.org/W4388627352","https://openalex.org/W2055243143","https://openalex.org/W4286900141","https://openalex.org/W2776613281","https://openalex.org/W2070797946"],"abstract_inverted_index":{"The":[0],"massive":[1],"scale":[2],"of":[3,42,58,75,102,139],"online":[4],"social":[5,52],"networks":[6],"makes":[7],"it":[8,122],"very":[9,27],"challenging":[10],"to":[11,34,72,109,129,142],"characterize":[12],"the":[13,22,64,73,100,137],"underlying":[14],"structure":[15],"therein.":[16],"In":[17],"this":[18,61,127],"paper,":[19],"we":[20,104],"employ":[21],"t-cherry":[23,76,82],"junction":[24,69,77,83],"tree,":[25],"a":[26,36,51,56,81,111],"recent":[28],"advancement":[29],"in":[30,50,60],"probabilistic":[31],"graphical":[32],"models,":[33],"develop":[35],"compact":[37],"representation":[38],"and":[39,89,135],"good":[40],"approximation":[41,66],"an":[43,107,117],"otherwise":[44],"intractable":[45],"model":[46],"for":[47],"users'":[48],"relationships":[49],"network.":[53],"There":[54],"are":[55],"number":[57],"advantages":[59],"approach:":[62],"(1)":[63],"best":[65],"possible":[67],"via":[68],"trees":[70],"belongs":[71],"class":[74],"trees;":[78],"(2)":[79],"constructing":[80,121],"tree":[84,114],"can":[85,92],"be":[86,93],"largely":[87],"parallelized;":[88],"(3)":[90],"inference":[91],"performed":[94],"using":[95],"distributed":[96],"computation.":[97],"To":[98],"improve":[99],"quality":[101],"approximation,":[103],"also":[105],"devise":[106],"algorithm":[108],"build":[110],"higher":[112],"order":[113],"gracefully":[115],"from":[116,123],"existing":[118],"one,":[119],"without":[120],"scratch.":[124],"We":[125],"apply":[126],"approach":[128],"Twitter":[130],"data":[131],"containing":[132],"100,000":[133],"nodes":[134],"study":[136],"problem":[138],"recommending":[140],"connections":[141],"new":[143],"users.":[144]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}