Attribute-Driven Backbone Discovery
暂无分享,去创建一个
Yinghui Wu | Sheng Guan | Hanchao Ma | Yinghui Wu | Hanchao Ma | Sheng Guan
[1] Dániel Marx,et al. Parameterized Complexity and Approximation Algorithms , 2008, Comput. J..
[2] Rushed Kanawati,et al. Community detection in Attributed Network , 2018, WWW.
[3] Christos Faloutsos,et al. Fast discovery of connection subgraphs , 2004, KDD.
[4] Themis Palpanas,et al. X2Q: Your Personal Example-based Graph Explorer , 2018, Proc. VLDB Endow..
[5] Thomas Neumann,et al. Fast approximation of steiner trees in large graphs , 2012, CIKM.
[6] Ulrik Brandes,et al. Simmelian backbones: Amplifying hidden homophily in Facebook networks , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).
[7] Jure Leskovec,et al. Community Detection in Networks with Node Attributes , 2013, 2013 IEEE 13th International Conference on Data Mining.
[8] Shan Wang,et al. Finding Top-k Min-Cost Connected Trees in Databases , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[9] Christos Faloutsos,et al. Center-piece subgraphs: problem definition and fast solutions , 2006, KDD '06.
[10] Carlos Eduardo Ferreira,et al. A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem , 2010, ArXiv.
[11] Tim Roughgarden,et al. Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation , 2001, Math. Program..
[12] Mathias Géry,et al. I-Louvain: An Attributed Graph Clustering Method , 2015, IDA.
[13] M. Newman. Coauthorship networks and patterns of scientific collaboration , 2004, Proceedings of the National Academy of Sciences of the United States of America.
[14] Aijun An,et al. Keyword Search in Graphs: Finding r-cliques , 2011, Proc. VLDB Endow..
[15] Laks V. S. Lakshmanan,et al. Attribute-Driven Community Search , 2016, Proc. VLDB Endow..
[16] H. Vincent Poor,et al. Why Steiner-tree type algorithms work for community detection , 2013, AISTATS.
[17] Jamil Y. Khan,et al. Development of an integrated backbone network for a high capacity PCN network , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).
[18] Barbora Micenková,et al. Clustering attributed graphs: Models, measures and methods , 2015, Network Science.
[19] K. Kumar. Optimization of Minimum Cost Network Flows with Heuristic Algorithms , 2012 .
[20] Toon Calders,et al. Information Propagation in Interaction Networks , 2017, EDBT.
[21] Charu C. Aggarwal,et al. A Survey of Algorithms for Keyword Search on Graph Data , 2010, Managing and Mining Graph Data.
[22] Fan Zhang,et al. When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks , 2016, Proc. VLDB Endow..
[23] Hong-Yuan Mark Liao,et al. Personalized travel recommendation by mining people attributes from community-contributed photos , 2011, ACM Multimedia.
[24] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[25] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[26] Xiaofeng Zhu,et al. Finding dense and connected subgraphs in dual networks , 2015, 2015 IEEE 31st International Conference on Data Engineering.
[27] Christian Borgs,et al. Finding undetected protein associations in cell signaling by belief propagation , 2010, Proceedings of the National Academy of Sciences.
[28] Alex Thomo,et al. K-Core Decomposition of Large Networks on a Single PC , 2015, Proc. VLDB Endow..
[29] Reynold Cheng,et al. Effective Community Search for Large Attributed Graphs , 2016, Proc. VLDB Endow..
[30] Michael H. Böhlen,et al. Similarity Joins in Relational Database Systems , 2013, Similarity Joins in Relational Database Systems.
[31] Jure Leskovec,et al. Modeling Social Networks with Node Attributes using the Multiplicative Attribute Graph Model , 2011, UAI.