Efficiently reinforcing social networks over user engagement and tie strength
- Publication Type:
- Conference Proceeding
- Proceedings - IEEE 34th International Conference on Data Engineering, ICDE 2018, 2018, pp. 557 - 568
- Issue Date:
|[2018 ICDE] Efficiently Reinforcing Social Networks over User Engagement and Tie Strength.pdf||Accepted Manuscript version||570.9 kB|
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is currently unavailable due to the publisher's embargo.
The embargo period expires on 24 Oct 2020
© 2018 IEEE. User engagement and tie strength are fundamental and important components in social networks. The model of k-Truss not only captures actively engaged users, but also ensures strong tie strength among these users. It motivates us to utilize the model of k-Truss in preventing network unraveling, which simultaneously considers both of the basic components. In this paper, we propose and investigate the anchored k-Truss problem to reinforce a network by anchoring critical users who can significantly stop the unraveling. We prove the problem is NP-hard for k ≥ 4. A fast edge deletion order based algorithm, named AKT, is proposed with efficient candidate exploration and pruning techniques based on the order. Comprehensive experiments on 10 real-life graphs demonstrate the effectiveness of our model and the efficiency of our methods.
Please use this identifier to cite or link to this item: