{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:10Z","timestamp":1750221010197,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"USDA","award":["2018-67007-28797"],"award-info":[{"award-number":["2018-67007-28797"]}]},{"name":"Department of Energy","award":["DE-IA0000025"],"award-info":[{"award-number":["DE-IA0000025"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,25]]},"DOI":"10.1145\/3292500.3330934","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"187-195","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Attribute-Driven Backbone Discovery"],"prefix":"10.1145","author":[{"given":"Sheng","family":"Guan","sequence":"first","affiliation":[{"name":"Washington State University, Pullman, WA, USA"}]},{"given":"Hanchao","family":"Ma","sequence":"additional","affiliation":[{"name":"Washington State University, Pullman, WA, USA"}]},{"given":"Yinghui","family":"Wu","sequence":"additional","affiliation":[{"name":"Washington State University & Pacific Northwest National Laboratory, Pullman, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2601748"},{"key":"e_1_3_2_1_2_1","volume-title":"J-M Francc ois, and Riccardo Zecchina","author":"Bailly-Bechet Marc","year":"2011","unstructured":"Marc Bailly-Bechet , Christian Borgs , Alfredo Braunstein , J Chayes , A Dagkessamanskaia , J-M Francc ois, and Riccardo Zecchina . 2011 . Finding undetected protein associations in cell signaling by belief propagation. PNAS ( 2011). Marc Bailly-Bechet, Christian Borgs, Alfredo Braunstein, J Chayes, A Dagkessamanskaia, J-M Francc ois, and Riccardo Zecchina. 2011. Finding undetected protein associations in cell signaling by belief propagation. PNAS (2011)."},{"key":"e_1_3_2_1_3_1","volume-title":"Matteo Magnani, and Barbora Micenkova.","author":"Bothorel C\u00e9cile","year":"2015","unstructured":"C\u00e9cile Bothorel , Juan David Cruz , Matteo Magnani, and Barbora Micenkova. 2015 . Clustering attributed graphs: models, measures and methods. Network Science ( 2015). C\u00e9cile Bothorel, Juan David Cruz, Matteo Magnani, and Barbora Micenkova. 2015. Clustering attributed graphs: models, measures and methods. Network Science (2015)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2072298.2072311"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1998.776634"},{"key":"e_1_3_2_1_6_1","unstructured":"Mung Chiang Henry Lam Zhenming Liu and Vincent Poor. 2013. Why Steiner-tree type algorithms work for community detection. In AISTATS .  Mung Chiang Henry Lam Zhenming Liu and Vincent Poor. 2013. Why Steiner-tree type algorithms work for community detection. In AISTATS ."},{"key":"e_1_3_2_1_7_1","volume-title":"Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. Mathematical Programming","author":"Chudak Fabi\u00e1n A","year":"2004","unstructured":"Fabi\u00e1n A Chudak , Tim Roughgarden , and David P Williamson . 2004. Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. Mathematical Programming ( 2004 ). Fabi\u00e1n A Chudak, Tim Roughgarden, and David P Williamson. 2004. Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. Mathematical Programming (2004)."},{"key":"e_1_3_2_1_8_1","volume-title":"I-louvain: An attributed graph clustering method. In IDA .","author":"Combe David","year":"2015","unstructured":"David Combe , Christine Largeron , Mathias G\u00e9ry , and ElHo d Egyed-Zsigmond . 2015 . I-louvain: An attributed graph clustering method. In IDA . David Combe, Christine Largeron, Mathias G\u00e9ry, and ElHo d Egyed-Zsigmond. 2015. I-louvain: An attributed graph clustering method. In IDA ."},{"key":"e_1_3_2_1_9_1","volume-title":"Shan Wang, Lu Qin, Xiao Zhang, and Xuemin Lin.","author":"Ding Bolin","year":"2007","unstructured":"Bolin Ding , Jeffrey Xu Yu , Shan Wang, Lu Qin, Xiao Zhang, and Xuemin Lin. 2007 . Finding top-k min-cost connected trees in databases. In ICDE . Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao Zhang, and Xuemin Lin. 2007. Finding top-k min-cost connected trees in databases. In ICDE ."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3191570"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014068"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538"},{"key":"e_1_3_2_1_13_1","volume-title":"A note on Johnson, Minkoff and Phillips' algorithm for the prize-collecting Steiner tree problem. arXiv","author":"Feofiloff Paulo","year":"2010","unstructured":"Paulo Feofiloff , Cristina G Fernandes , Carlos E Ferreira , and Jos\u00e9 Coelho De Pina . 2010. A note on Johnson, Minkoff and Phillips' algorithm for the prize-collecting Steiner tree problem. arXiv ( 2010 ). Paulo Feofiloff, Cristina G Fernandes, Carlos E Ferreira, and Jos\u00e9 Coelho De Pina. 2010. A note on Johnson, Minkoff and Phillips' algorithm for the prize-collecting Steiner tree problem. arXiv (2010)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398460"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099626"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2021017.2021025"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850471"},{"key":"e_1_3_2_1_19_1","volume-title":"Modeling social networks with node attributes using the multiplicative attribute graph model. arXiv","author":"Kim Myunghwan","year":"2011","unstructured":"Myunghwan Kim and Jure Leskovec . 2011. Modeling social networks with node attributes using the multiplicative attribute graph model. arXiv ( 2011 ). Myunghwan Kim and Jure Leskovec. 2011. Modeling social networks with node attributes using the multiplicative attribute graph model. arXiv (2011)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.7763\/IJIET.2012.V2.78"},{"key":"e_1_3_2_1_21_1","unstructured":"Rohit Kumar and Toon Calders. 2017. Information propagation in interaction networks. In EDBT .  Rohit Kumar and Toon Calders. 2017. Information propagation in interaction networks. In EDBT ."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3236251"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxm048"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0307545100"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492569"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150448"},{"volume-title":"Approximation Algorithms","author":"Vazirani Vijay V.","key":"e_1_3_2_1_27_1","unstructured":"Vijay V. Vazirani . 2003. Approximation Algorithms . Springer . Vijay V. Vazirani. 2003. Approximation Algorithms .Springer."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Haixun Wang and Charu C Aggarwal. 2010. A survey of algorithms for keyword search on graph data. In Managing and Mining Graph Data .  Haixun Wang and Charu C Aggarwal. 2010. A survey of algorithms for keyword search on graph data. In Managing and Mining Graph Data .","DOI":"10.1007\/978-1-4419-6045-0_8"},{"key":"e_1_3_2_1_29_1","unstructured":"Yubao Wu Ruoming Jin Xiaofeng Zhu and Xiang Zhang. 2015. Finding dense and connected subgraphs in dual networks. In ICDE .  Yubao Wu Ruoming Jin Xiaofeng Zhu and Xiang Zhang. 2015. Finding dense and connected subgraphs in dual networks. In ICDE ."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Jaewon Yang Julian McAuley and Jure Leskovec. 2013. Community detection in networks with node attributes. In ICDM .  Jaewon Yang Julian McAuley and Jure Leskovec. 2013. Community detection in networks with node attributes. In ICDM .","DOI":"10.1109\/ICDM.2013.167"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3115404.3115406"}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Anchorage AK USA","acronym":"KDD '19"},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330934","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330934","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:03Z","timestamp":1750206363000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330934"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":31,"alternative-id":["10.1145\/3292500.3330934","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3330934","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}