Thesis (Selection of subject)Thesis (Selection of subject)(version: 390)
Thesis details
   Login via CAS
Porovnání efektivity algoritmů řešících problém maximalizace vlivu
Thesis title in Czech: Porovnání efektivity algoritmů řešících problém maximalizace vlivu
Thesis title in English: Comparison of effectiveness of algorithms solving the influence maximization problem
Key words: maximalizace vlivu|nezávislý kaskádový model|DSFLA|IMM|MLIM|CoFIM|DegreeDiscount|sociální sítě
English key words: influence maximization|independent cascade model|DSFLA|IMM|MLIM|CoFIM|DegreeDiscount|social networks
Academic year of topic announcement: 2025/2026
Thesis type: Bachelor's thesis
Thesis language: čeština
Department: Computer Science Institute of Charles University (32-IUUK)
Supervisor: doc. Ing. et Ing. David Hartman, Ph.D. et Ph.D.
Author: Anna Kmentová - assigned and confirmed by the Study Dept.
Date of registration: 18.06.2025
Date of assignment: 07.07.2025
Confirmed by Study dept. on: 07.07.2025
Date and time of defence: 05.09.2025 09:00
Date of electronic submission:17.07.2025
Date of submission of printed version:17.07.2025
Opponents: doc. Mgr. Martin Koutecký, Ph.D.
 
 
 
Guidelines
Influence maximization is a problem of choosing a set of nodes that will have the biggest influence on the network in the sense of information spreading. There have been many algorithms suggested for the past 20 years using many different mechanisms. The purpose of this bachelor thesis is to choose appropriate algorithms and test their effectiveness. There is a challenge because both the main models used in this field and the algorithms are based on probability. So, another part of the bachelor thesis is to come up with an appropriate testing technique and example models to test on.
References
Chen, W., Wang, Y., & Yang, S. (2009, June). Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 199-208).
Kempe, D., Kleinberg, J., & Tardos, É. (2015). Maximizing the spread of influence through a social network. Theory of Computing, 11(3), 105–147. https://doi.org/10.4086/toc.2015.v011a003
Azaouzi, M., Mnasri, W., & Ben Romdhane, L. (2021). New trends in influence maximization models. Computer Science Review, 40, 100393. https://doi.org/10.1016/j.cosrev.2021.100393
Singh, S. S., Muhuri, S., Mishra, S., Srivastava, D., Shakya, H. K., & Kumar, N. (2024). Social network analysis: A survey on process, tools, and application. ACM Computing Surveys, 56(8), 1-39
Jaouadi, M., & Romdhane, L. B. (2024). A survey on influence maximization models. Expert Systems with Applications, 248, 123429.
  • Please note that information collected from descriptive data or files, submitted with the final thesis, cannot be used for profitable purposes or presented as a study, academic or other creative activity of any person other than the author.
Uploaded thesis filesSizeAuthorUploaded byUploaded on
download fileAttachment to the thesis (defended)1385 kBAnna KmentováAnna Kmentová17.07.2025 13:57
download fileText of the thesis (defended)7314 kBAnna KmentováAnna Kmentová17.07.2025 15:18
 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html