شناسایی گره تأثیرگذار در شبکه های پیچیده
ترجمه نشده

شناسایی گره تأثیرگذار در شبکه های پیچیده

عنوان فارسی مقاله: تشخیص اجتماع و شناسایی گره تأثیرگذار در شبکه های پیچیده با استفاده از برنامه نویسی ریاضی
عنوان انگلیسی مقاله: Community Detection and Influential Node Identification in Complex Networks using Mathematical Programming
مجله/کنفرانس: سیستم های خبره با کابردهای مربوطه – Expert Systems with Applications
رشته های تحصیلی مرتبط: مهندسی کامپیوتر، مهندسی فناوری اطلاعات
گرایش های تحصیلی مرتبط: مهندسی الگوریتم و محاسبات، برنامه نویسی کامپیوتر، شبکه های کامپیوتری
کلمات کلیدی فارسی: خوشه بندی، شبکه ها، تشخیص اجتماع، گره های تاثیرگذار، برنامه نویس خطی عدد صحیح
کلمات کلیدی انگلیسی: Clustering، Networks، Community detection، Influential nodes، Integer linear programming
نوع نگارش مقاله: مقاله کوتاه (Short communication)
نمایه: Scopus – Master Journals List – JCR
شناسه دیجیتال (DOI): https://doi.org/10.1016/j.eswa.2019.05.059
دانشگاه: Department of Industrial and Manufacturing Systems Engineering, College of Engineering, and Department of Marketing, Trulaske College of Business, University of Missouri, Columbia, MO 65211, United States
ناشر: الزویر - Elsevier
نوع ارائه مقاله: ژورنال
نوع مقاله: ISI
سال انتشار مقاله: 2019
ایمپکت فاکتور: 5.891 در سال 2018
شاخص H_index: 162 در سال 2019
شاخص SJR: 1.190 در سال 2018
شناسه ISSN: 0957-4174
شاخص Quartile (چارک): Q1 در سال 2018
فرمت مقاله انگلیسی: PDF
تعداد صفحات مقاله انگلیسی: 43
وضعیت ترجمه: ترجمه نشده است
قیمت مقاله انگلیسی: رایگان
آیا این مقاله بیس است: خیر
آیا این مقاله مدل مفهومی دارد: ندارد
آیا این مقاله پرسشنامه دارد: ندارد
آیا این مقاله متغیر دارد: دارد
کد محصول: E13572
رفرنس: دارای رفرنس در داخل متن و انتهای مقاله
فهرست انگلیسی مطالب

Abstract


1. Introduction


2. Literature review


3. Problem statement


4. Proposed model for detecting communities and locating influential nodes


5. Computational experiments: results and discussion


6. Discussion on potential real-life applications of our model


7. Conclusions


CRediT authorship contribution statement


Declaration of Competing Interest


Acknowledgments


Appendix A. Algorithms for solving 0–1 Integer Programs


Appendix B. Formulation of the Benchmark Model


Appendix C. Visualization of Community Partition for Selected Networks


Appendix D. Supplementary materials


Research Data


References

نمونه متن انگلیسی مقاله

Abstract


Integer programming models for community detection in relational networks have diverse applications in different fields. From making our lives easier by improving search engine optimization to saving our lives by aiding in threat detection and disaster management, researches in this niche have added value to human experience and knowledge. Besides the community structure, the influential nodes or members in a complex network are highly effective at diffusing information quickly to others in the community. Prior research dealing with the use of optimization models for clustering networks has independently focused on detecting communities. In this research, we propose a new integer linear programming model to detect community structure in real-life networks and also identify the most influential node within each community. We validate the proposed model by testing it on a well-established community network. Further, the performance of the proposed model are evaluated by comparing it with the existing best performing optimization model as well as three heuristic approaches for community detection. The experimental results indicate that in most cases the proposed integer programming model performs better than the existing optimization model with respect to modularity, Silhouette coefficient and computational time. Besides, our model yields superior Silhouette and competitive modularity values compared to the heuristic approaches in many cases.


Introduction


A large number of complex systems can be expressed through networks, which is a group of nodes associated through edges or links (Raghavan et al., 2007). Social networks such as Facebook and Twitter are such examples, where the users are represented by the nodes and the ties/friendship between them is indicated by edges. Similarly, in supply chain logistics, nodes represent the supplier and customer locations, while edges denote the paths connecting the nodes. Due to its theoretical importance and practical applications, research on social, technological, physical and biological networks has gained importance in different branches of sciences. Representing the complex systems through relational networks provides an insight into the intricacy and the dynamic behavior of such systems (Pan et al., 2014). A network is said to exhibit a community structure if its nodes can be grouped into different clusters such that the nodes within the clusters are densely connected compared to the nodes outside the cluster (Radicchi et al., 2004). Finding communities in relational networks takes us one step further to better understanding complex systems, which in turn results in numerous benefits and applications (Girvan and Newman, 2002). Communities are formed by clustering the nodes in a relational network, where the nodes (or objects) are placed into groups such that the objects in the same group have maximum similarities, while the ones in different groups have the least in common.

  • اشتراک گذاری در

دیدگاه خود را بنویسید:

تاکنون دیدگاهی برای این نوشته ارسال نشده است

شناسایی گره تأثیرگذار در شبکه های پیچیده
نوشته های مرتبط
مقالات جدید
لوگوی رسانه های برخط

logo-samandehi

پیوندها