The art of characterization in large networks: Finding the critical attributes

Recently, with the development of online social networks, users in social networks are usually associated with attributes such as user preferences, which is of great importance for analyzing the properties of social networks. To identify critical attributes, we propose and investigate a new problem named attribute k-core maximization. Given an attribute graph G and a budget b, we aim to identify a set of b attributes, such that the corresponding attribute k-core is maximized. Due to the NP-hardness of the problem, we resort to the greedy strategy in this paper. In order to handle large graphs, a layer-based structure and novel searching paradigms are developed to accelerate the computation. Finally, experiments over 6 real-world networks are conducted to evaluate the performance of proposed model and techniques.

[1]  Fan Zhang,et al.  Pivotal Relationship Identification: The K-Truss Minimization Problem , 2019, IJCAI.

[2]  Reynold Cheng,et al.  Effective Community Search for Large Attributed Graphs , 2016, Proc. VLDB Endow..

[3]  Jure Leskovec,et al.  Community Detection in Networks with Node Attributes , 2013, 2013 IEEE 13th International Conference on Data Mining.

[4]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[5]  Vladimir Batagelj,et al.  An O(m) Algorithm for Cores Decomposition of Networks , 2003, ArXiv.

[6]  Jennifer Neville,et al.  Attributed graph models: modeling network structure with correlated attributes , 2014, WWW.

[7]  Charu C. Aggarwal,et al.  Community Detection with Edge Content in Social Media Networks , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[8]  Xiaoyang Wang,et al.  Stable Community Detection in Signed Social Networks , 2022, IEEE Transactions on Knowledge and Data Engineering.

[9]  Laks V. S. Lakshmanan,et al.  Attribute-Driven Community Search , 2016, Proc. VLDB Endow..

[10]  Qing Liu,et al.  VAC: Vertex-Centric Attributed Community Search , 2020, 2020 IEEE 36th International Conference on Data Engineering (ICDE).

[11]  Yinghui Wu,et al.  Attribute-Driven Backbone Discovery , 2019, KDD.

[12]  Xuemin Lin,et al.  Efficient Distance-Aware Influence Maximization in Geo-Social Networks , 2017, IEEE Transactions on Knowledge and Data Engineering.

[13]  Sunil Prabhakar,et al.  Mining Statistically Significant Attribute Associations in Attributed Graphs , 2016, 2016 IEEE 16th International Conference on Data Mining (ICDM).

[14]  Hong Cheng,et al.  Graph Clustering Based on Structural/Attribute Similarities , 2009, Proc. VLDB Endow..

[15]  Fan Zhang,et al.  When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks , 2016, Proc. VLDB Endow..

[16]  Jeffrey Xu Yu,et al.  Influential Community Search in Large Networks , 2015, Proc. VLDB Endow..

[17]  Xuemin Lin,et al.  Bring Order into the Samples: A Novel Scalable Method for Influence Maximization (Extended Abstract) , 2017, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).

[18]  Jianzhong Li,et al.  Fast diversified coherent core search on multi-layer graphs , 2019, The VLDB Journal.

[19]  Xun Wang,et al.  Discovering Cliques in Signed Networks Based on Balance Theory , 2020, DASFAA.

[20]  Francesco Bonchi,et al.  Cores matter? An analysis of graph decomposition effects on influence maximization problems , 2020, WebSci.