TRA CỨU
thông tin biểu ghi
  • Bài trích
  • Ký hiệu PL/XG: 512
    Nhan đề: A fast overlapping community detection. Algorithm based on label propagation and socialNetwork graph clustering coefficient /
DDC 512
Tác giả CN Nguyen, Hien Trinh
Nhan đề A fast overlapping community detection. Algorithm based on label propagation and socialNetwork graph clustering coefficient / Nguyen Hien Trinh, Vu Vinh Quang, Doan Van Ban..[and others]
Tóm tắt Many networks possess a community structure, such that nodes form densely 3; unified groups are more sparsely linked to other groups. In many cases, these groups overlap. with some nodes rat; between two or more communities. Overlapping node plays a role of interface between cormm. , and it is really interesting to study the community establishment of these it reflect the. dynamic behavior of participants. Nowadays, community identification a mining are the main directions in social network analysis. 111 this paper, we present an algorithm to find overlapping communities in “erg: Large social networks. The algorithm is based on the label propagation technique, and we find the overlapping communities in the network by improving the clustering coefficient. Tests on a set of popular- standard social networks and certain real networks have shown the high speed and high efficiency in finding overlapping cormnunities.
Từ khóa tự do Clustering coeffi
Từ khóa tự do Label propagation
Từ khóa tự do Overlapping communities
Từ khóa tự do Social network graph
Tác giả(bs) CN Doan, Van Ban
Tác giả(bs) CN Vu, Vinh Quang
Nguồn trích Tạp chí Tin học và Điều khiển học = Journal of Computer Science And Cybernetics 2022tr. 63-83 Số: 01
000 00000nab#a2200000ui#4500
00152447
0029
0045FF20F67-0BAE-4C2B-B0F3-A3FB9FA7E559
005202409261138
008081223s VN| vie
0091 0
039|y20240926114236|ztainguyendientu
040 |aACTVN
041 |avie
044 |avm
082 |a512
10010|aNguyen, Hien Trinh
245 |aA fast overlapping community detection. Algorithm based on label propagation and socialNetwork graph clustering coefficient / |cNguyen Hien Trinh, Vu Vinh Quang, Doan Van Ban..[and others]
520 |aMany networks possess a community structure, such that nodes form densely 3; unified groups are more sparsely linked to other groups. In many cases, these groups overlap. with some nodes rat; between two or more communities. Overlapping node plays a role of interface between cormm. , and it is really interesting to study the community establishment of these it reflect the. dynamic behavior of participants. Nowadays, community identification a mining are the main directions in social network analysis. 111 this paper, we present an algorithm to find overlapping communities in “erg: Large social networks. The algorithm is based on the label propagation technique, and we find the overlapping communities in the network by improving the clustering coefficient. Tests on a set of popular- standard social networks and certain real networks have shown the high speed and high efficiency in finding overlapping cormnunities.
653 |aClustering coeffi
653 |aLabel propagation
653 |aOverlapping communities
653 |aSocial network graph
700 |aDoan, Van Ban
700 |aVu, Vinh Quang
7730 |tTạp chí Tin học và Điều khiển học = Journal of Computer Science And Cybernetics |d2022|gtr. 63-83|x1813-9663|i01
890|a0|b0|c1|d0
Không tìm thấy biểu ghi nào