Отрывок: 8) was used, where 4 refers to the number of communities, N refers to the number of nodes, 16 refers to the average degree of nodes, and 0.8 refers to the tightness of node connections. (2) Real data sets [15] included YouTube (user and user relationship network), DBLP (author partnership network), Zachary (karate club membership network) and an American university football team network, as shown in Table 1. Table 1. Real data set Data set Number of nodes Numbe...
Полная запись метаданных
Поле DC Значение Язык
dc.contributor.authorCai, Z.M.-
dc.date.accessioned2021-01-06 17:24:43-
dc.date.available2021-01-06 17:24:43-
dc.date.issued2020-12-
dc.identifierDspace\SGAU\20210106\86863ru
dc.identifier.citationCai ZM. Network community partition based on intelligent clustering algorithm. Computer Optics 2020; 44(6): 985-989. DOI: 10.18287/2412-6179-CO-724.ru
dc.identifier.urihttps://dx.doi.org/10.18287/2412-6179-CO-724-
dc.identifier.urihttp://repo.ssau.ru/handle/Zhurnal-Komputernaya-optika/Network-community-partition-based-on-intelligent-clustering-algorithm-86863-
dc.description.abstractThe division of network community is an important part of network research. Based on the clustering algorithm, this study analyzed the partition method of network community. Firstly, the classic Louvain clustering algorithm was introduced, and then it was improved based on the node similarity to get better partition results. Finally, experiments were carried out on the random network and the real network. The results showed that the improved clustering algorithm was faster than GN and KL algorithms, the community had larger modularity, and the purity was closer to 1. The experimental results show the effectiveness of the proposed method and make some contributions to the reliable community division.ru
dc.language.isoen_USru
dc.publisherСамарский национальный исследовательский университетru
dc.relation.ispartofseries44;6-
dc.subjectclustering algorithmru
dc.subjectnetwork communityru
dc.subjectnode similarityru
dc.subjectcommunity divisionru
dc.titleNetwork community partition based on intelligent clustering algorithmru
dc.typeArticleru
dc.textpart8) was used, where 4 refers to the number of communities, N refers to the number of nodes, 16 refers to the average degree of nodes, and 0.8 refers to the tightness of node connections. (2) Real data sets [15] included YouTube (user and user relationship network), DBLP (author partnership network), Zachary (karate club membership network) and an American university football team network, as shown in Table 1. Table 1. Real data set Data set Number of nodes Numbe...-
Располагается в коллекциях: Журнал "Компьютерная оптика"

Файлы этого ресурса:
Файл Описание Размер Формат  
440617.pdfОсновная статья695.18 kBAdobe PDFПросмотреть/Открыть



Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.