ارائه روشی جهت شبکه‌های اجتماعی چند لایه‌ای پویا جهت کشف گروه‌های تاثیرگذار مبتنی بر ترکیبب الگوریتم تکاملی جهش قورباغه و خوشه‌بندی C-means
محورهای موضوعی : سامانه های پردازشی و ارتباطی چند رسانه ای هوشمند
لیدا ندرلو
1
(دانشگاه روزبه- دانشکده کامپیوتر- زنجان- ایران)
محمد تحقیقی شربیان
2
(استادیار، دانشکده مهندسی برق و کامپیوتر، واحد زنجان، دانشگاه آزاد اسلامی، زنجان، ایران)
کلید واژه: گروه‌های تاثیرگذار, الگوریتم تکاملی جهش قورباغه و خوشه‌بندی C-means, شبکه‌های اجتماعی چند لایه‌ای پویا,
چکیده مقاله :
امروزه علم و فن آوری با آهنگی شتابناک در حال رشد است و شبکه های اجتماعی پیچیده به بخشی ضروری از زندگی تبدیل شده اند، آن گونه که بحث جدایی مردم از شبکه های درهم پیچیده ای که مبتنی بر نیازهای اساسی زندگی است بحث ناگزیری در زندگی روزمره و عرصه دانش است. در پژوهش پیش رو مدلی برای شبکه های اجتماعی چندلایه ای پویا برای کشف گروه های تأثیرگذار، مبتنی بر ترکیبب الگوریتم تکاملی جهش قورباغه و خوشه بندی C-means ارائه شده است. بدین ترتیب که پس از جمع‌آوری داده‌ها به پاک سازی و نرمال سازی آن ها پرداخته شد تا داده‌های مطلوب منجر به شناسایی افراد و گروه‌های مؤثر شود که در ادامه کار ماتریس تصمیم شکل گرفت و از روی آن شناسایی و خوشه‌بندی(مبتنی بر خوشه‌بندی فازی) انجام شد و اهمیت گروه‌ها نیز مشخص گردید. برای دستیابی به افراد و گروه‌های تأثیرگذار در شبکه‌های اجتماعی، از الگوریتم قورباغه جهنده برای بهبود تشخیص پارامترهای تأثیرگذار استفاده شد که باعث بهبود اهمیت گره ها شده است. در ارزیابی و شبیه سازی بخش خوشه‌بندی، روش پیشنهادی با روش K-means مقایسه و نتیجه مقدار تعادل روش در انتخاب خوشه برابر 5 شد. گفتنی است که روش پیشنهادی به نسبت روشهای مورد مقایسه، بهبود مناسب تری را نشان داد. همچنین ارزیابی معیار صحت روش پیشنهادی به نسبت روشهای همسان بهبود 3.3 داشته و نسبت به روش پایه M-ALCD بهبود 3.8 را به ثبت رسانده است.
Introduction: The current research examines a more complex social network called a multi-layered social network. Recently, the concept of the multilayer network has emerged from the area of complex networks, under the domain of complex systems. In the field of big data, simple and multi-layered social networks can be found everywhere and in all fields. The estimation of the importance of each node in these two types of networks is not the same, and weighting the nodes is very necessary to control the network. For this purpose, the relationship between the characteristics of the nodes and the relationship with the network structure should be examined. To find the degree of each node in the system function, parameters like reliability, controllability, and power should be considered. In this paper, a model for dynamic multi-layer social networks to discover influential groups, based on the combination of evolutionary frog jump algorithm and C-means clustering, has been presented.Method: Once data are collected, they were cleaned and normalized so that the desired data leads to the identification of effective individuals and groups. The decision matrix is constructed based on these data. Using this matrix, identification, and clustering (based on fuzzy clustering) were conducted, and the importance of the groups was also determined to determine influential people and groups in social networks. The Jumping frog algorithm was used to improve the detection of influential parameters.Results: In the evaluation and simulation of the clustering part, the proposed method was compared with the K-means method and the balance value of the method in cluster selection was 5. It should be noted that the proposed method showed better improvement compared to the compared methods. Also, the evaluation of the accuracy criterion of the proposed method has improved by 3.3 compared to similar methods and recorded an improvement of 3.3 compared to the basic M-ALCD method.Discussion: In this paper, a multi-layer local community detection model is proposed, which is based on structure and feature information. This model can use the information of the characteristics of the nodes and the information of the strength of similarity that is revealed by social exchanges and improves the accuracy of community detection in Improve multilayer networks. Due to its modularity and computational efficiency, this algorithm performs better on most data sets, unlike the classic multi-layer and global community detection algorithms
[1] S, Prakash. Ch, (2016), “Intelligent Detection of Influential Nodes in Networks”, IEEE, International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT), pp. 2626-2628.
[2] Y, Xie. G, (2016),“Efficient identification of node importance in social networks”, Science Direct, Information Processing and Management, Vol. 52, pp. 911-922.
[3] [Zhou. J, Zhang. Y, Cheng. J, (2014) , ”Preference-based mining of top-K influential nodes in social networks “, Science Direct, Future Generation Computer System, Vol. 31, pp. 41-47.
[4] Xiaoming Li, Guagquan Xu, Litao Jiao, Yinan Zhou, Wei Yu.(2019).“ Multi-layer network community detection model based on attributes and social interaction intensity”. 0045-7906/© 2019 Elsevier Ltd. All rights reserved.
[5] Lokesh Jain , Rahul Katarya , Shelly Sachdeva.(2019). “Opinion Leader detection using Whale Optimization Algorithm in Online Social Network”, https://doi.org/10.1016/j.eswa.2019.113016.
[6] Yu Lei, Ying Zhou, Jiao Shi.(2019). “Overlapping Communities Detection of Social Network based on Hybrid C-means Clustering Algorithm ” https://doi.org/10.1016/j.scs.2019.101436.
[7] Aftab Farooq, Usman Akram, Gulraiz Javaid Joyia, and Chaudhry Naeem Akbar.(2018). “A Technique to Identify Key Players that Helps to Improve Businesses Using Multilayer Social Network Analysis” International Journal of Future Computer and Communication, Vol. 7, No. 4, December 2018
[8] Ruchi Mittal and M.P.S Bhatia,.(2019). “Classifying the Influential Individuals in Multi-Layer Social Networks” International Journal of Electronics, Communications, and Measurement Engineering Volume 8 Issue 1 January-June.
[9] Mohammed Ali Al-garadi, Kasturi Dewi Varathan, Sri Devi Ravana, Ejaz Ahmed, Victor Chang .(2016). “Identifying the influential spreadersin multilayer interactions ofonline socialnetworks” Published in Journal of Intelligent and fuzzy system.
[10] Weiyi Liu, Pin-Yu Chen, Sailung Yeung, Toyotaro Suzumura and Lingli Chen .(2017). “Principled Multilayer Network Embedding” arXiv:1709.03551v3 [cs.SI] 15 Sep 2017.
[11] Interdonato R, Tagarelli A, Ienco D, et al. Local community detection in multilayer networks. Data Min Knowl Discov 2017;31(5):14 4 4–79. https: //doi.org/10.1007/s10618- 017- 0525- y .
[12] T. Hoang Huynh, “A modified shuffled frog leaping algorithm for optimal tuning of multivariable PID controllers” IEEE international conference, 2008.
[13] Bezdek J C, Ehrlich R, Full W. FCM: The fuzzy c-means clustering algorithm[J]. Computers & Geosciences, 1984, 10(2-3): 191-203.
[14] Mogelmose, A.; Trivedi, M.M..(2012). Moeslund, T.B. Vision-based traffic sign detection and analysis for intelligent driver assistance systems: Perspectives and survey. IEEE Trans. Intell. Transp. Syst.2012, 13, 484–1497
[15] Rachmawanto, Eko Hari, Galang Rambu Anarqi, and Christy Atika Sari. "Handwriting Recognition Using Eccentricity and Metric Feature Extraction Based on K-Nearest Neighbors." In 2018 International Seminar on Application for Technology of Information and Communication, pp. 411-416. IEEE, 2018.
[16] Sa’di, Sadri, Amanj Maleki, Ramin Hashemi, Zahra Panbechi, and Kamal Chalabi. "Comparison of data mining algorithms in the diagnosis of type II diabetes" International Journal on Computational Science & Applications (IJCSA) 5, no. 5 (2015): 1-12.
[17] Chen D, Zhao W, Wang D, et al. Similarity-based local community detection for bipartite networks. Filomat 2018;32(5):1559–70 .
_||_