A LOCALLY AND GLOBALLY TUNED METAHEURISTIC OPTIMIZATION FOR OVERLAPPING COMMUNITY DETECTION

IF 1.1 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Malaysian Journal of Computer Science Pub Date : 2023-04-30 DOI:10.22452/mjcs.vol36no2.4
C. Mallick, Parimal Kumar Giri (Corresponding Author), Sarojananda Mishra
{"title":"A LOCALLY AND GLOBALLY TUNED METAHEURISTIC OPTIMIZATION FOR OVERLAPPING COMMUNITY DETECTION","authors":"C. Mallick, Parimal Kumar Giri (Corresponding Author), Sarojananda Mishra","doi":"10.22452/mjcs.vol36no2.4","DOIUrl":null,"url":null,"abstract":"Many people use online social networks to share their opinions and information in this digital age. The number of people engaged and their dynamic nature pose a major challenge for social network analysis (SNA). Community detection is one of the most critical and fascinating issues in social network analysis. Researchers frequently employ node features and topological structures to recognize important and meaningful performance in order to locate non-overlapping communities. We introduce a locally and globally tuned multi-objective biogeography-based optimization (LGMBBO) technique in this research for detecting overlapping communities based on the number of connections and node similarity. Four real- world online social network datasets were used in the experiment to assess the quality of both overlapping and non-overlapping partitions. As a result, the model generates a set of solutions that have the best topological structure of a network with node properties. The suggested model will increase their productivity and enhance their abilities to identify significant and pertinent communities.","PeriodicalId":49894,"journal":{"name":"Malaysian Journal of Computer Science","volume":" ","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2023-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Malaysian Journal of Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.22452/mjcs.vol36no2.4","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Many people use online social networks to share their opinions and information in this digital age. The number of people engaged and their dynamic nature pose a major challenge for social network analysis (SNA). Community detection is one of the most critical and fascinating issues in social network analysis. Researchers frequently employ node features and topological structures to recognize important and meaningful performance in order to locate non-overlapping communities. We introduce a locally and globally tuned multi-objective biogeography-based optimization (LGMBBO) technique in this research for detecting overlapping communities based on the number of connections and node similarity. Four real- world online social network datasets were used in the experiment to assess the quality of both overlapping and non-overlapping partitions. As a result, the model generates a set of solutions that have the best topological structure of a network with node properties. The suggested model will increase their productivity and enhance their abilities to identify significant and pertinent communities.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于重叠社区检测的局部和全局优化元启发式算法
在这个数字时代,许多人使用在线社交网络来分享他们的观点和信息。参与的人数及其动态性质对社会网络分析构成了重大挑战。社区检测是社会网络分析中最关键和最吸引人的问题之一。研究人员经常利用节点特征和拓扑结构来识别重要和有意义的性能,以定位不重叠的社区。在本研究中,我们引入了一种基于局部和全局调整的多目标生物地理学优化(LGMBBO)技术,用于基于连接数和节点相似性检测重叠群落。实验中使用了四个真实世界的在线社交网络数据集来评估重叠和非重叠分区的质量。因此,该模型生成了一组具有节点特性的网络最佳拓扑结构的解决方案。建议的模式将提高他们的生产力,并提高他们识别重要和相关社区的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Malaysian Journal of Computer Science
Malaysian Journal of Computer Science COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
2.20
自引率
33.30%
发文量
35
审稿时长
7.5 months
期刊介绍: The Malaysian Journal of Computer Science (ISSN 0127-9084) is published four times a year in January, April, July and October by the Faculty of Computer Science and Information Technology, University of Malaya, since 1985. Over the years, the journal has gained popularity and the number of paper submissions has increased steadily. The rigorous reviews from the referees have helped in ensuring that the high standard of the journal is maintained. The objectives are to promote exchange of information and knowledge in research work, new inventions/developments of Computer Science and on the use of Information Technology towards the structuring of an information-rich society and to assist the academic staff from local and foreign universities, business and industrial sectors, government departments and academic institutions on publishing research results and studies in Computer Science and Information Technology through a scholarly publication.  The journal is being indexed and abstracted by Clarivate Analytics'' Web of Science and Elsevier''s Scopus
期刊最新文献
METHODICAL EVALUATION OF HEALTHCARE INTELLIGENCE FOR HUMAN LIFE DISEASE DETECTION DISINFORMATION DETECTION ABOUT ISLAMIC ISSUES ON SOCIAL MEDIA USING DEEP LEARNING TECHNIQUES ENHANCING SECURITY OF RFID-ENABLED IOT SUPPLY CHAIN A TRACE CLUSTERING FRAMEWORK FOR IMPROVING THE BEHAVIORAL AND STRUCTURAL QUALITY OF PROCESS MODELS IN PROCESS MINING IMPROVING COVERAGE AND NOVELTY OF ABSTRACTIVE TEXT SUMMARIZATION USING TRANSFER LEARNING AND DIVIDE AND CONQUER APPROACHES
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1