Compressive Analysis on Price-Performance Rank: Economically Selecting Initial Users for Influence Maximization in Social Networks
Journal: International Journal of Engineering and Techniques (Vol.4, No. 2)Publication Date: 2018-04-25
Authors : K Hari Krishna Pathan Nageena Parveen;
Page : 754-768
Keywords : Influence maximization; price-performance ratio (PC-IP ratio); social networks.;
Abstract
This paper centers around looking for another heuristic plan for an influence maximization issue in social networks: how to monetarily choose a subset of people (supposed seeds) to trigger an extensive course of further receptions of another conduct in light of a virus procedure. Most existing deals with determination of seeds accepted that the steady number k seeds could be chosen, regardless of the characteristic property of every individual's distinctive helplessness of being influenced (e.g., it might be expensive to induce a few seeds to receive another conduct). In this paper, a price-performance-ratio propelled heuristic plan, PPRank, is proposed, which examines how to financially choose seeds inside a given spending plan and then attempt to expand the diffusion process. Our paper's commitments are triple. In the first place, we expressly portray every client with two particular factors: the weakness of being influenced (SI) and compelling force (IP) speaking to the capacity to effectively influence others and figure clients' SIs and IPs as per their social relations, and after that, a raised price-request bend based model is used to appropriately change over every client's SI into influence cost (PC) speaking to the cost used to effectively influence the person to receive another conduct. Moreover, a novel practical determination plot is proposed, which embraces both the price performance ratio (PC-IP ratio) and client's IP as an incorporated choice foundation and in the interim unequivocally considers the covering impact;
at last, reenactments utilizing both misleadingly produced and genuine follow arrange information show that, under similar spending plans, PPRank can accomplish bigger dispersion run than other heuristic and animal power insatiable plans without considering clients' influence costs.
Other Latest Articles
- Avoiding Duplication Data in HDFS Based on Supervised Learning
- An Effective and Robustive on Cache-Supported Path Planning on Roads
- Security Enhancement by Achieving Flatness in Selecting the Honey words from Existing User Passwords
- An Efficient Recommendation and Suggestion System for Travel Route Using Places of Interest Implementation
- Secure Privacy Data Collection, Storage and Access in Cloud-Assisted Internet of Things
Last modified: 2018-07-06 19:47:26