From 36eb1fee5492e57368846cbf4e107f1e4cb31589 Mon Sep 17 00:00:00 2001
From: Thibaut Horel <thibaut.horel@gmail.com>
Date: Sat, 22 Nov 2014 21:08:41 -0500
Subject: WWW version

---
 paper/sections/abstract.tex | 7 ++-----
 1 file changed, 2 insertions(+), 5 deletions(-)

(limited to 'paper/sections/abstract.tex')

diff --git a/paper/sections/abstract.tex b/paper/sections/abstract.tex
index b166d6a..f5f5f64 100644
--- a/paper/sections/abstract.tex
+++ b/paper/sections/abstract.tex
@@ -1,6 +1,3 @@
-In recent years social networking platforms have developed into extraordinary channels for spreading and consuming information.
-Along with the rise of such infrastructure, there is continuous progress on techniques for spreading information effectively through influential users.  
-  
-In this paper, we describe scalable algorithms for a new method of information diffusion called adaptive seeding.  In many applications, one is restricted to select influencers from a set of users who engaged with the topic being promoted, and due to the structure of social networks, these users often rank low in terms of their influence potential.  To overcome this hurdle, adaptive seeding aims to select users in a manner which targets their influential neighbors.
+In recent years, social networking platforms have developed into extraordinary channels for spreading and consuming information. Along with the rise of such infrastructure, there is continuous progress on techniques for spreading information effectively through influential users. In many applications, one is restricted to select influencers from a set of users who engaged with the topic being promoted, and due to the structure of social networks, these users often rank low in terms of their influence potential. An alternative approach one can consider is an adaptive method which selects users in a manner which targets their influential neighbors. The advantage of such an approach is that it leverages the friendship paradox in social networks: while users are often not influential, they often know someone who is.  
 
-Despite the various complexities involved with the optimization problem, we show that scalable adaptive seeding is achievable.  In particular, we develop algorithms for linear influence models with provable approximation guarantees that can be gracefully parallelized.  To show the effectiveness of our methods we collected data from various verticals social network users follow.  For each vertical, we collected data on the users who responded to a certain post as well as their neighbors, and applied our methods on this data.  Our experiments show that adaptive seeding is  scalable, and importantly, that it obtains dramatic improvements over standard approaches of information dissemination.
+Despite the various complexities in such optimization problems, we show that scalable adaptive seeding is achievable. In particular, we develop algorithms for linear influence models with provable approximation guarantees that can be gracefully parallelized. To show the effectiveness of our methods we collected data from various verticals social network users follow. For each vertical, we collected data on the users who responded to a certain post as well as their neighbors, and applied our methods on this data. Our experiments show that adaptive seeding is  scalable, and importantly, that it obtains dramatic improvements over standard approaches of information dissemination.
-- 
cgit v1.2.3-70-g09d2

