Bilkent University
Department of Computer Engineering
CS 690 SEMINAR
Promoting Information Diffusion Between Disjoint Subsets of Users in Large Scale Social Networks
Gündüz Vehbi Demirci
PhD Student
Computer Engineering Department
Bilkent University
Social networks enable content sharing, information spread, and social interaction at very large scale. The problem of maximization of information di ffusion over the whole network has been extensively studied in the literature. However, a relevant and practical problem of increasing influence and information di ffusion between speci fic subsets of users has not been addressed yet. We formally introduce the problem of link recommendation that improves information diff usion between disjoint subsets of users in the network. We defi ne the quality measures for this new problem and propose a solution based on an adoption of the Max-Flow Min-Cut theorem. We per- form experiments on real data sets using a widely used information di ffusion model for the coverage computation. Experimental results o er insights on the problem and illustrate how the proposed solution achieves the stated objectives.
DATE: 05 October, 2015, Monday @ 16:15
PLACE: EA-409