A novel approach for influence maximization in social networking
Arshdeep Brar, Rajbhupinder Kaur
Abstract
Arshdeep Brar, Rajbhupinder Kaur
Abstract
The social networking sites today are becoming important platforms for effective viral marketing practice. They are now becoming a huge dissemination and marketing platform, allowing information and ideas to influence a large population in a short period of time. In this paper, a modified improved and novel technique based on Greedy algorithm is implemented. Two methods, namely modified Greedy algorithm and modified weighted Greedy algorithm, for influence maximization in social networking are proposed. The result of proposed implementation are validated and compared with the existing algorithms. Keywords- Influence maximization, social networking, greedy algorithm
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The social networking sites today are becoming important platforms for effective viral marketing practice. They are now becoming a huge dissemination and marketing platform, allowing information and ideas to influence a large population in a short period of time. In this paper, a modified improved and novel technique based on Greedy algorithm is implemented. Two methods, namely modified Greedy algorithm and modified weighted Greedy algorithm, for influence maximization in social networking are proposed. The result of proposed implementation are validated and compared with the existing algorithms. Keywords- Influence maximization, social networking, greedy algorithm
Key concepts: Greedy algorithm, Maximization, Computer science, Viral marketing, Mathematical optimization, Algorithm, World Wide Web, Social media