1 / 28

Minimum Sized Positive Influential Node Set Selection for Social Network

Minimum Sized Positive Influential Node Set Selection for Social Network. by Atharva. Social Network. Social Network. The Graph of relationships and interactions within a group of individuals. Social network plays a fundamental role as a medium for the spread of INFLUENCE among its members.

adara
Télécharger la présentation

Minimum Sized Positive Influential Node Set Selection for Social Network

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Minimum Sized Positive Influential Node Set Selection for Social Network by Atharva

  2. Social Network

  3. Social Network • The Graph of relationships and interactions within a group of individuals. • Social network plays a fundamental role as a medium for the spread of INFLUENCE among its members

  4. Ingredient Network

  5. Political Blogs

  6. My Facebook Network

  7. The Matrix Movie

  8. Problem Definition

  9. Network Model

  10. Graph 0.99 0.01 0.75 0.6 0.9

  11. Some Terminologies

  12. Some Terminologies

  13. Example

  14. Anti Smoking Campaign

  15. 0.7 0.45 0.9 0.55 0.6 0.4 0.5 0.8 0.78 0.62

  16. Find the node with maximum contribution function

  17. 0.7 0.45 0.9 0.55 0.6 0.4 0.5 0.8 0.78 0.62

  18. Selection of Maximal Independent Set(MIS) using Breadth First Search • In graph theory, an independent set(IS) is a subset of vertices in a graph, such that no two vertex in IS are adjacent. • A maximal independent set is an independent set such that adding any other vertex to the set forces the set to contain an edge. • Select a MIS induced by a BFS ordering with respect to root node

  19. 0.7 0.45 0.9 0.55 0.6 0.4 0.5 0.8 0.78 0.62

  20. 0.7 0.45 0.9 0.55 0.6 0.4 0.5 0.8 0.78 0.62

  21. 0.7 0.45 0.9 0.55 0.6 0.4 0.5 0.8 0.78 0.62

  22. 0.7 0.45 0.9 0.55 0.6 0.4 0.5 0.8 0.78 0.62

  23. Performance • Simulation Settings • Generate random graph • The weighs on edges are randomly generated • Simulation Results • Very close to Optimal solution • No existing state of the art that’s finds MPINS • Comparison with PIDS (Positive Influential Dominating Set)

  24. SimulationResults – small scale

  25. SimulationResults – Large scale

  26. References • D. Kempe, J.Kleinberg, and E.Tardos, "Maximizing the Spread of Influence through a Social Network", KDD'03 • A.Goyal, F.Bonchi, L. Laskhmanan, "Learning Inuence Probabilities in Social Networks", WSDM'10 • Jing (Selena) He, ShoulingJi, Xiaojing Liao, Hisham M. Haddad and RaheemBeyah,"Minimum-sized Positive Inuential Node Set Selection for Social Networks:Considering Both Positive and Negative Inuences",IPCCC(IEEE),2013. • F.Wang, H.Du, E.Camacho, K.Xu, W.Lee, Yan, Shi and S.Shan,"On Positive InuenceDomiating Sets in Social Networks", TCS,2011.

  27. Questions

More Related