{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T22:50:12Z","timestamp":1768517412557,"version":"3.49.0"},"reference-count":34,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T00:00:00Z","timestamp":1620518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>Because of the complexity of the actors and the relationships between them, social networks are always represented by graphs. This structure makes it possible to analyze the effectiveness of the network for the social actors who are there. This work presents a social network analysis approach that focused on processing Facebook pages and users who react to posts to infer influential people. In our study, we are particularly interested in studying the relationships between the posts of the page, and the reactions of fans (users) towards these posts. The topics covered include data crawling, graph modeling, and exploratory analysis using statistical tools and machine learning algorithms. We seek to detect influential people in the sense that the influence of a Facebook user lies in their ability to transmit and disseminate information. Once determined, these users have an impact on business for a specific brand. The proposed exploratory analysis has shown that the network structure and its properties have important implications for the outcome of interest.<\/jats:p>","DOI":"10.3390\/computers10050062","type":"journal-article","created":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T21:32:46Z","timestamp":1620595966000},"page":"62","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Towards Inferring Influential Facebook Users"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4699-6432","authenticated-orcid":false,"given":"Suleiman Ali","family":"Alsaif","sequence":"first","affiliation":[{"name":"Computer Department, Deanship of Preparatory Year and Supporting Studies, Imam Abdulrahman Bin Faisal University, P.O. Box 1982, Dammam 31441, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0222-8562","authenticated-orcid":false,"given":"Adel","family":"Hidri","sequence":"additional","affiliation":[{"name":"Computer Department, Deanship of Preparatory Year and Supporting Studies, Imam Abdulrahman Bin Faisal University, P.O. Box 1982, Dammam 31441, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0417-6586","authenticated-orcid":false,"given":"Minyar Sassi","family":"Hidri","sequence":"additional","affiliation":[{"name":"Computer Department, Deanship of Preparatory Year and Supporting Studies, Imam Abdulrahman Bin Faisal University, P.O. Box 1982, Dammam 31441, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,5,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Serrat, O. (2017). Social Network Analysis, Springer.","DOI":"10.1007\/978-981-10-0983-9_9"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"e1256","DOI":"10.1002\/widm.1256","article-title":"Social network analysis: An overview","volume":"8","author":"Tabassum","year":"2018","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/s13278-019-0622-6","article-title":"OMLML: A helpful opinion mining method based on lexicon and machine learning in social networks","volume":"10","author":"Keyvanpour","year":"2020","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"20:1","DOI":"10.1007\/s13278-019-0565-y","article-title":"FCMiner: Mining functional communities in social networks","volume":"9","author":"Tennakoon","year":"2019","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","article-title":"An Information Flow Model for Conflict and Fission in Small Groups","volume":"33","author":"Zachary","year":"1977","journal-title":"J. Anthropol. Res."},{"key":"ref_7","unstructured":"L\u00fc, J., Yu, X., Chen, G., and Yu, W. (2016). Community Detection in Bipartite Networks: Algorithms and Case studies. Complex Systems and Networks: Dynamics, Controls and Applications, Springer."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"18061","DOI":"10.1109\/ACCESS.2018.2818792","article-title":"Characteristics Analysis of Data From News and Social Network Services","volume":"6","author":"Jang","year":"2018","journal-title":"IEEE Access"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"61959","DOI":"10.1109\/ACCESS.2018.2876502","article-title":"Personality Predictions Based on User Behaviour on the Facebook Social Media Platform","volume":"6","author":"Tadesse","year":"2018","journal-title":"IEEE Access"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Cauteruccio, F., Corradini, E., Terracina, G., Ursino, D., and Virgili, L. (2020). Investigating Reddit to detect subreddit and author stereotypes and to evaluate author assortativity. J. Inf. Sci.","DOI":"10.1177\/0165551520979869"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Hansen, D., Shneiderman, B., Smith, M., and Himelboim, I. (2020). Chapter 1\u2014Introduction to social media and social networks. Analyzing Social Media Networks with NodeXL, Morgan Kaufman Publishers. [2nd ed.].","DOI":"10.1016\/B978-0-12-817756-3.09998-2"},{"key":"ref_12","unstructured":"Bonaccorso, G. (2017). Machine Learning Algorithms: A Reference Guide to Popular Algorithms for Data Science and Machine Learning, Packt Publishing."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Vaccaro, L., Sansonetti, G., and Micarelli, A. (2021). An Empirical Review of Automated Machine Learning. Computers, 10.","DOI":"10.3390\/computers10010011"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Panicacci, S., Donati, M., Profili, F., Francesconi, P., and Fanucci, L. (2021). Trading-Off Machine Learning Algorithms towards Data-Driven Administrative-Socio-Economic Population Health Management. Computers, 10.","DOI":"10.3390\/computers10010004"},{"key":"ref_15","unstructured":"Mercorio, F., Mezzanzanica, M., Moscato, V., Picariello, A., and Sperli, G. (2019). DICO: A Graph-DB Framework for Community Detection on Big Scholarly Data. IEEE Trans. Emerg. Top. Comput."},{"key":"ref_16","unstructured":"Jiawei, H., and Micheline, K. (2006). Data Mining: Concepts and Techniques, Morgan Kaufman Publishers."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Wang, C., Pan, S., Hu, R., Long, G., Jiang, J., and Zhang, C. (2019, January 10\u201316). Attributed Graph Clustering: A Deep Attentional Embedding Approach. Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI), Macao, China.","DOI":"10.24963\/ijcai.2019\/509"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Amburg, I., Veldt, N., and Benson, A. (2020, January 20\u201324). Clustering in graphs and hypergraphs with categorical edge labels. Proceedings of the WWW \u201920: The Web Conference, Taipei, Taiwan.","DOI":"10.1145\/3366423.3380152"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","article-title":"Graph clustering","volume":"1","author":"Schaeffer","year":"2007","journal-title":"Comput. Sci. Rev."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s13278-018-0493-2","article-title":"Study on centrality measures in social networks: A survey","volume":"8","author":"Das","year":"2018","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","article-title":"Finding community structure in very large networks","volume":"70","author":"Clauset","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Yolum, P., G\u00fcng\u00f6r, T., G\u00fcrgen, F., and \u00d6zturan, C. (2005, January 26\u201328). Computing Communities in Large Networks Using Random Walks. Proceedings of the Computer and Information Sciences\u2013ISCIS 2005: 20th International Symposium, Istanbul, Turkey.","DOI":"10.1007\/11569596"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","article-title":"Finding community structure in networks using the eigenvectors of matrices","volume":"74","author":"Newman","year":"2006","journal-title":"Phys. Rev. E"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","article-title":"Near linear time algorithm to detect community structures in large-scale networks","volume":"76","author":"Raghavan","year":"2007","journal-title":"Phys. Rev. E"},{"key":"ref_25","unstructured":"Diestel, R. (2006). Graph Theory, Springer."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Agarwal, S. (2006, January 25\u201329). Ranking on Graph Data. Proceedings of the 23rd International Conference on Machine Learning (ICML), Pittsburgh, PA, USA.","DOI":"10.1145\/1143844.1143848"},{"key":"ref_27","unstructured":"Mitchell, R. (2015). Web Scraping with Python: Collecting Data from the Modern Web, O\u2019Reilly Media."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Kozen, D. (1992). Depth-First and Breadth-First Search. The Design and Analysis of Algorithms, Springer.","DOI":"10.1007\/978-1-4612-4400-4"},{"key":"ref_29","unstructured":"Dow, P.A., and Korf, R.E. (2007, January 22\u201326). Best-First Search for Treewidth. Proceedings of the 22nd National Conference on Artificial Intelligence, Vancouver, BC, Canada."},{"key":"ref_30","unstructured":"Sun, X., Koenig, S., and Yeoh, W. (2008). Generalized Adaptive A*. Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems-Volume 1, International Foundation for Autonomous Agents and Multiagent Systems."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Olston, C., and Najork, M. (2010). Web Crawling, Now Publishers. Foundations and Trends in Information Retrieval.","DOI":"10.1561\/9781601983237"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"408","DOI":"10.20965\/jaciii.2010.p0408","article-title":"An Efficient Algorithm for Optimizing Bipartite Modularity in Bipartite Networks","volume":"14","author":"Liu","year":"2010","journal-title":"J. Adv. Comput. Intell. Intell. Inform. (JACIII)"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1978","journal-title":"Soc. Netw."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.socnet.2010.03.006","article-title":"Node centrality in weighted networks: Generalizing degree and shortest paths","volume":"32","author":"Opsahl","year":"2010","journal-title":"Soc. Netw."}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/10\/5\/62\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:58:26Z","timestamp":1760162306000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/10\/5\/62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,9]]},"references-count":34,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2021,5]]}},"alternative-id":["computers10050062"],"URL":"https:\/\/doi.org\/10.3390\/computers10050062","relation":{},"ISSN":["2073-431X"],"issn-type":[{"value":"2073-431X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,9]]}}}