In: Publication1 Aug 2010
Conference Paper, Proceedings of the 2010 IEEE International Conference on Social Computing, Symposium Section
Authors: Matthias Broecheler, Paulo Shakarian, and V.S. Subrahmanian
Direct link to paper
Multiple phenomena often diffuse through a social network, sometimes in competition with one another. Product adoption and political elections are two examples where network diffusion is inherently competitive in nature. For example, individuals may choose to only select one product from a set of competing products (i.e. most people will need only one cell-phone provider) or can only vote for one person in a slate of political candidate (in most electoral systems). We introduce the weighted generalized annotated program (wGAP) framework for expressing competitive diffusion models. Applications are interested in the eventual results from multiple competing diffusion models (e.g. what is the likely number of sales of a given product, or how many people will support a particular candidate). We define the â€œmost probable interpretationâ€ (MPI) problem which technically formalizes this need. We develop algorithms to efficiently solve MPI and show experimentally that our algorithms work on graphs with millions of vertices.
Where is the knowledge we have lost in information?
- T.S. Elliot, The Rock
We are drowning in data - exabytes of it. My research explores technologies that can help us organize, structure, and efficiently search huge amounts of information as well as automatically deduce actionable pieces of knowledge from it. Learn more
I was a PhD student at the University of Maryland with research interests in databases, artificial intelligence, and machine learning. Learn more