IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v4y2018i2idhcseit184170.html

A Novel Approach for Dynamic Rumor Influence Minimization in Social Networks

Author

Listed:
  • K. Mounica
  • K. Jayakrishna

Abstract

With the quick advancement of big scale on-line social networks, on-line information sharing is getting to be inescapable day by day. Various information is proliferating through on-line social networks also as each the constructive and antagonistic. All through this paper, we have a tendency to tend to center around the negative information issues simply like the on-line rumor tidbits. Rumor square may well be a big disadvantage in substantial scale social networks. Vindictive bits of rumor may make disorder in the public eye and so ought to be hindered when potential once being recognized. amid this paper, we have a tendency to propose a model of dynamic rumor influence reduction with user expertise (DRIMUX).Our objective is to curtail the influence of the rumor (i.e., the quantity of clients that have acknowledged and sent the talk) by obstruct a correct arrangement of hubs. A dynamic Ising spread model considering each the overall quality and individual fascination of the talk is given bolstered sensible situation. To boot, inside and out totally not quite the same as existing issues with influence decrease, we have a tendency to have a tendency to require into thought the imperative of client encounter utility. In particular, every hub is allocated a resilience time limit. In the event that the piece time of every client surpasses that edge, the utility of the system will diminish. Underneath this imperative, we have a tendency to keep an eye on then define step back as a system dynamic idea downside with survival hypothesis, and propose arrangements upheld most likelihood standard. Tests territory unit executed bolstered extensive scale world systems and approve the adequacy of our philosophy.

Suggested Citation

  • K. Mounica & K. Jayakrishna, 2018. "A Novel Approach for Dynamic Rumor Influence Minimization in Social Networks," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 4(2), pages 370-374, April.
  • Handle: RePEc:jbh:ijsrcs:v4:y2018:i2:id:hcseit184170
    Note: Article URL: https://ijsrcseit.com/CSEIT184170
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT184170
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT184170.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v4:y2018:i2:id:hcseit184170. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.