Abstract
As the increase of requirements of accessing and sharing information of people, large social networks have appeared. The influence maximization over social network has been a popular research topic, whose goal is to maximize the expected range of influence by selecting seed nodes to sending information and encouraging nodes in social network to report the messages. On the other side, privacy concerns have became more and more important, both automated and manual efforts are utilized to protection privacy of users. Under the mechanisms of privacy protection, the nodes in social network will not act as they did in the setting of no privacy protection. As far as we know, there are no previous works considering this problem. In this paper, we consider the influence maximization problem with privacy protection mechanisms in social networks.One challenge is that how to abstract the relations between users and information to identify which kinds of information should be protected by the privacy-related mechanisms. A context-based solution is proposed in the paper to face the challenge above and solve the influence maximization problem. First, a context-based information diffusion model (IDC for short) is proposed. Then, the corresponding influence maximization problem (IM-IDC for short) under IDC model is formally defined. Then, the methods about context extraction, influence estimation, and redundant contexts identification are introduced. The IM-IDC problem is shown to be NP-hard, and an efficient approximation algorithm based on greedy strategy is proposed and analyzed theoretically. Finally, experimental results show that our method is efficient.
Highlights
As the increase of requirements of accessing, sharing, and sending information of people, social networks have appeared
We propose new information diffusion models to support context-based privacy description and formulate the new influence maximization problem-based on new model
One key parameter of the APPROIM-Context-based information diffusion model (IDC) algorithm is the context set C, which can be treated to be a constant set in the experiments, since in real applications (e.g., DBLP) the number of contexts is limited
Summary
As the increase of requirements of accessing, sharing, and sending information of people, social networks have appeared. The developments of techniques of social network have huge increase and rapid popularization in the whole world. They have changed the communication ways of people. As the used of mobile cell phones increase, more and more people are involved in the social network. Until 2015, the size of mobile phones users in the world has reached 4.45 billion and 42.9% of them are using smart phones (about 2 billion). With the reports from China, the size of mobile smart phone users has reached 0.5 billion in 2014.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
