Targeted Influence Maximization Based on Cloud Computing over Big Data in Social Networks

Authors

  • Kavita Joshi Asst.Prof., Dr.D.Y.Patil Institute of Engineering, Management and Research Akurdi Pune, 411035, India
  • Roshani S. Golhar Research Scholar, Sun Rise University Alwar, (Rajasthan ) India
  • Neerajkumar Sathawane Associate Professor, MIMA Institute of Management, Pune, MH, India
  • Ashutosh Mathur Assistant Professor, Symbiosis Centre for Management Studies, Pune Symbiosis International, Pune
  • Pravin Ganpatrao Gawande Savitribai Phule Pune University, Vishwakarma Institute of Information Technology, Pune
  • Milind S. Patil Assistant Professor E&TC Engineering Department, Vishwakarma Institute of Information Technology, Pune
  • Santosh Gore Director, Sai Info Solution, Nashik, Maharashtra, India

Keywords:

Influence Maximization (IM), Maximum Influence Arborescence (MIA), Independent Cascade (IC), Model

Abstract

This research focuses on cloud computing-based targeted impact maximization in social networks. Most influence maximisation operates currently in use to identify the Top-k, which is a node in a network that is recognised or chosen according to specific standards, including the parameter "k." Users are expected to maximise the spread of influence under the assumption that the effect diffusion possibilities on connections are fixed, and these works assume an understanding of the whole networking graph. In practical settings, however, marginal probability tends to vary depending on a range of issues and can be influenced by incoming information. Therefore, the greedy algorithm is used. These approaches aim to detect a seed collection that increases the anticipated impact distribution across users with target audiences who are pertinent for specified subjects. The MIA model is used to locate the subgraph in a network where a certain collection of nodes can have the greatest impact on other nodes, which results in influence coverage and effectiveness. In the meantime, privacy and computational concerns make it challenging to access all network data. Additionally, current impact maximization techniques that take target users into account do not address cloud computing, which results in our algorithm consistently outperforming other scalable heuristics in influence spread across all size ranges, outperforming greedy algorithms by up to 100%-260%. This study suggests a cloud-based targeted influence maximization strategy to achieve this goal.

Downloads

Download data is not yet available.

References

A. Ramlatchan, M. Yang, Q. Liu, M. Li, J. Wang, and Y. Li, “A survey of matrix completion methods for recommendation systems,” Big Data Mining and Analytics, vol. 1, no. 4. pp. 308–323, 2018. doi: 10.26599/BDMA.2018.9020008.

S. Gore, Y. Bhapkar, J. Ghadge, S. Gore, and S. K. Singha, “Evolutionary Programming for Dynamic Resource Management and Energy Optimization in Cloud Computing,” in Proceedings of 3rd International Conference on Advanced Computing Technologies and Applications, ICACTA 2023, Institute of Electrical and Electronics Engineers Inc., 2023. doi: 10.1109/ICACTA58201.2023.10393769.

B. N. Tiwari and R. K. Thakur, “On stability of thermodynamic systems: a fluctuation theory perspective,” Eur. Phys. J. Plus, vol. 138, no. 6, Jun. 2023, doi: 10.1140/epjp/s13360-023-04000-6.

L. Qi, Y. Chen, Y. Yuan, S. Fu, X. Zhang, and X. Xu, “A QoS-aware virtual machine scheduling method for energy conservation in cloud-based cyber-physical systems,” World Wide Web, vol. 23, no. 2, pp. 1275–1297, Mar. 2020, doi: 10.1007/s11280-019-00684-y.

X. Wang, W. Wang, L. T. Yang, S. Liao, D. Yin, and M. J. Deen, “A Distributed HOSVD Method with Its Incremental Computation for Big Data in Cyber-Physical-Social Systems,” IEEE Trans. Comput. Soc. Syst., vol. 5, no. 2, pp. 481–492, 2018, doi: 10.1109/TCSS.2018.2813320.

C. Zhang, M. Yang, J. Lv, and W. Yang, “An improved hybrid collaborative filtering algorithm based on tags and time factor,” Big Data Min. Anal., vol. 1, no. 2, pp. 128–136, 2018, doi: 10.26599/BDMA.2018.9020012.

R. K. Thakur, H. Kumar, S. Gupta, D. Verma, and R. Nigam, “Investigating the Hubble tension: Effect of cepheid calibration,” Phys. Lett. Sect. B Nucl. Elem. Part. High-Energy Phys., vol. 840, 2023, doi: 10.1016/j.physletb.2023.137886.

N. Mahankale, S. Gore, D. Jadhav, G. S. P. S. Dhindsa, P. Kulkarni, and K. G. Kulkarni, “AI-based spatial analysis of crop yield and its relationship with weather variables using satellite agrometeorology,” in Proceedings of 3rd International Conference on Advanced Computing Technologies and Applications, ICACTA 2023, Institute of Electrical and Electronics Engineers Inc., 2023. doi: 10.1109/ICACTA58201.2023.10392944.

W. Yu, G. Cong, G. Song, and K. Xie, “Community-based Greedy algorithm for mining top-K influential nodes in mobile social networks,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2010, pp. 1039–1048. doi: 10.1145/1835804.1835935.

G. Song, Y. Li, X. Chen, X. He, and J. Tang, “Influential Node Tracking on Dynamic Social Network: An Interchange Greedy Approach,” IEEE Trans. Knowl. Data Eng., vol. 29, no. 2, pp. 359–372, 2017, doi: 10.1109/TKDE.2016.2620141.

S. Gore, D. D. Jadhav, M. E. Ingale, S. Gore, and U. Nanavare, “Leveraging BERT for Next-Generation Spoken Language Understanding with Joint Intent Classification and Slot Filling,” in Proceedings of 3rd International Conference on Advanced Computing Technologies and Applications, ICACTA 2023, Institute of Electrical and Electronics Engineers Inc., 2023. doi: 10.1109/ICACTA58201.2023.10393437.

S. Gore, A. S. Deshpande, N. Mahankale, S. Singha, and D. B. Lokhande, “A Machine Learning-Based Detection of IoT Cyberattacks in Smart City Application,” 2023, pp. 73–81. doi: 10.1007/978-981-99-6568-7_8.

C. C. Aggarwal, S. Lin, and P. S. Yu, “On influential node discovery in dynamic social networks,” in Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012, Society for Industrial and Applied Mathematics Publications, 2012, pp. 636–647. doi: 10.1137/1.9781611972825.55.

L. Sun, W. Huang, P. S. Yu, and W. Chen, “Multi-round influence maximization,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Association for Computing Machinery, Jul. 2018, pp. 2249–2258. doi: 10.1145/3219819.3220101.

P. Domingos and M. Richardson, “Mining the network value of customers,” in Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Association for Computing Machinery (ACM), 2001, pp. 57–66. doi: 10.1145/502512.502525.

L. C. Freeman, “Centrality in social networks conceptual clarification,” Soc. Networks, vol. 1, no. 3, pp. 215–239, 1978, doi: 10.1016/0378-8733(78)90021-7.

M. Richardson and P. Domingos, “Mining knowledge-sharing sites for viral marketing,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Association for Computing Machinery (ACM), 2002, pp. 61–70. doi: 10.1145/775047.775057.

D. Kempe, J. Kleinberg, and É. Tardos, “Maximizing the spread of influence through a social network,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003, pp. 137–146. doi: 10.1145/956750.956769.

J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. Vanbriesen, and N. Glance, “Cost-effective outbreak detection in networks,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007, pp. 420–429. doi: 10.1145/1281192.1281239.

W. Chen, Y. Wang, and S. Yang, “Efficient influence maximization in social networks,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2009, pp. 199–207. doi: 10.1145/1557019.1557047.

R. K. Thakur, S. Gupta, R. Nigam, and P. K. Thiruvikraman, “Investigating the Hubble Tension Through Hubble Parameter Data,” Res. Astron. Astrophys., vol. 23, no. 6, 2023, doi: 10.1088/1674-4527/acd0e8.

M. Kimura and K. Saito, “Tractable models for information diffusion in social networks,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Verlag, 2006, pp. 259–271. doi: 10.1007/11871637_27.

S. Pangaonkar, R. Gunjan, and V. Shete, “Recognition of Human Emotion through effective estimations of Features and Classification Model,” in 2021 International Conference on Computing, Communication and Green Engineering, CCGE 2021, 2021. doi: 10.1109/CCGE50943.2021.9776405.

A. Suman, P. Suman, V. Jaiswal, and S. Padhy, “Intelligent Hardware for Preventing Road Accidents Through the Use of Image Processing,” in ACM International Conference Proceeding Series, 2023, pp. 313–321. doi: 10.1145/3607947.3608012.

P. Sahane, S. Pangaonkar, and S. Khandekar, “Dysarthric Speech Recognition using Multi-Taper Mel Frequency Cepstrum Coefficients,” in 2021 International Conference on Computing, Communication and Green Engineering, CCGE 2021, 2021. doi: 10.1109/CCGE50943.2021.9776318.

M. Streeter and D. Golovin, “An online algorithm for maximizing submodular functions,” in Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference, 2009, pp. 1577–1584. Accessed: Feb. 22, 2024. [Online]. Available: https://proceedings.neurips.cc/paper/2008/hash/5751ec3e9a4feab575962e78e006250d-Abstract.html

V. Jaiswal, V. Sharma, and D. Bisen, “Modified Deep-Convolution Neural Network Model for Flower Images Segmentation and Predictions,” Multimed. Tools Appl., 2023, doi: 10.1007/s11042-023-16530-3.

S. Pangaonkar and R. Gunjan, “A consolidative evaluation of extracted EGG speech signal for pathology identification,” Int. J. Simul. Process Model., vol. 16, no. 4, pp. 300–314, 2021, doi: 10.1504/IJSPM.2021.118846.

L. G. Valiant, “The Complexity of Enumeration and Reliability Problems,” SIAM J. Comput., vol. 8, no. 3, pp. 410–421, Aug. 1979, doi: 10.1137/0208032.

K. Jain and V. V. Vazirani, “An approximation algorithm for the fault tolerant metric facility location problem,” Algorithmica (New York), vol. 38, no. 3, pp. 433–439, Dec. 2003, doi: 10.1007/s00453-003-1070-1.

J. Tang, J. Sun, C. Wang, and Z. Yang, “Social influence analysis in large-scale networks,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2009, pp. 807–815. doi: 10.1145/1557019.1557108.

S. Brin and L. Page, “Reprint of: The anatomy of a large-scale hypertextual web search engine,” Comput. Networks, vol. 56, no. 18, pp. 3825–3833, 2012, doi: 10.1016/j.comnet.2012.10.007.

Downloads

Published

24.03.2024

How to Cite

Joshi, K. ., Golhar, R. S. ., Sathawane, N. ., Mathur, A. ., Gawande, P. G. ., Patil, M. S. ., & Gore, S. . (2024). Targeted Influence Maximization Based on Cloud Computing over Big Data in Social Networks. International Journal of Intelligent Systems and Applications in Engineering, 12(20s), 253–261. Retrieved from https://ijisae.org/index.php/IJISAE/article/view/5136

Issue

Vol. 12 No. 20s (2024)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.

IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.

Most read articles by the same author(s)