This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: On Flow Authority Discovery in Social Networks Charu C. Aggarwal Arijit Khan Xifeng Yan Abstract A central characteristic of social networks is that it facil- itates rapid dissemination of information between large groups of individuals. This paper will examine the problem of determination of information ow representatives , a small group of authoritative representatives to whom the dissem- ination of a piece of information leads to the maximum spread. Clearly, information ow is affected by a number of different structural factors such as the node degree, connectivity, intensity of information ow interaction and the global structural behavior of the underlying network. We will propose a stochastic information ow model, and use it to determine the authoritative representatives in the underlying social network. We will first design an accurate RankedReplace algorithm, and then use a Bayes probabilistic model in order to approximate the effectiveness of this algorithm with the use of a fast algorithm. We will examine the results on a number of real social network data sets, and show that the method is more effective than state-of-the-art methods. Keywords: Social networks, graph mining 1 Introduction In recent years, social networks have found increasing popularity because of their ability to connect geograph- ically disparate groups of individuals. Social networks are well known to enjoy the benefits of the network ef- fect , wherein the increase in the size of the social net- work also increases the perceived benefits of using it. Much of this benefit is embedded in the information ows in the social network. These information ows arise as a result of the communication between the dif- ferent entities in the social network. The information ow is also impacted by the network topology and the intensity of information ow interactions between differ- ent nodes. Since information ows play such a key role in the popularity of social networks, significant research has been performed in recent years to characterize im- portant characteristics of such ows [13, 14, 22]. A key question which arises in the context of social IBM T.J. Watson Research Center, firstname.lastname@example.org Univ. of California at Santa Barbara, email@example.com University of California at Santa Barbara, firstname.lastname@example.org networks is to determine the information flow authori- ties in the social network. Information ow authorities are defined as a very small group of members at which the dissemination of information leads to the most rapid spread throughout the social network. The concept of information authorities is peripherally related to that of the concept of hubs and authorities in web networks ....
View Full Document
This note was uploaded on 02/10/2012 for the course CSE 5800 taught by Professor Staff during the Fall '09 term at FIT.
- Fall '09