Efficiently reinforcing social networks over user engagement and tie strength

Zhang, F; Zhang, Y; Qin, L; Zhang, W; Lin, X

Efficiently reinforcing social networks over user engagement and tie strength

Zhang, F Zhang, Y

Qin, L

Zhang, W Lin, X

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings - IEEE 34th International Conference on Data Engineering, ICDE 2018, 2018, pp. 557 - 568
Issue Date:: 2018-10-24

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted Manuscript versionAdobe PDF (570.9 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Zhang, F	en_US
dc.contributor.author	Zhang, Y https://orcid.org/0000-0002-2674-1638	en_US
dc.contributor.author	Qin, L https://orcid.org/0000-0001-6068-5062	en_US
dc.contributor.author	Zhang, W	en_US
dc.contributor.author	Lin, X	en_US
dc.date.available	2020-10-24T18:04:03Z
dc.date.issued	2018-10-24	en_US
dc.identifier.citation	Proceedings - IEEE 34th International Conference on Data Engineering, ICDE 2018, 2018, pp. 557 - 568	en_US
dc.identifier.isbn	9781538655207	en_US
dc.identifier.uri	http://hdl.handle.net/10453/131179
dc.description.abstract	© 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.	en_US
dc.relation.ispartof	Proceedings - IEEE 34th International Conference on Data Engineering, ICDE 2018	en_US
dc.relation.isbasedon	10.1109/ICDE.2018.00057	en_US
dc.rights	info:eu-repo/semantics/openAccess
dc.title	Efficiently reinforcing social networks over user engagement and tie strength	en_US
dc.type	Conference Proceeding
utslib.for	0805 Distributed Computing	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	open_access	*
pubs.publication-status	Published	en_US

Abstract:

© 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:

http://hdl.handle.net/10453/131179