{"title":"基于节点相似度的半监督社区发现算法","authors":"Jinghong Wang, Jiateng Yang, S. Shi","doi":"10.1109/ISKE47853.2019.9170279","DOIUrl":null,"url":null,"abstract":"With the advent of the era 01 big data, complex network community detection has become an important research direction. Based on the similarity of the community detection methods attractions GN algorithm fast and accurate but has higher time complexity. In order to overcome the deficiency of GN efficiency, this paper presents a semi-supervised GN algorithm based on node similarity, takes full advantage of the known node, cannot link constraints, a priori information combined with the similarity information between nodes, and validated using artificial and real networks. It is proved that the algorithm proposed in this paper reduces the GN algorithm's time complexity and improve the efficiency.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Semi-Supervised Community Discovery Algorithm Based on Node Similarity\",\"authors\":\"Jinghong Wang, Jiateng Yang, S. Shi\",\"doi\":\"10.1109/ISKE47853.2019.9170279\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the advent of the era 01 big data, complex network community detection has become an important research direction. Based on the similarity of the community detection methods attractions GN algorithm fast and accurate but has higher time complexity. In order to overcome the deficiency of GN efficiency, this paper presents a semi-supervised GN algorithm based on node similarity, takes full advantage of the known node, cannot link constraints, a priori information combined with the similarity information between nodes, and validated using artificial and real networks. It is proved that the algorithm proposed in this paper reduces the GN algorithm's time complexity and improve the efficiency.\",\"PeriodicalId\":399084,\"journal\":{\"name\":\"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISKE47853.2019.9170279\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE47853.2019.9170279","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Semi-Supervised Community Discovery Algorithm Based on Node Similarity
With the advent of the era 01 big data, complex network community detection has become an important research direction. Based on the similarity of the community detection methods attractions GN algorithm fast and accurate but has higher time complexity. In order to overcome the deficiency of GN efficiency, this paper presents a semi-supervised GN algorithm based on node similarity, takes full advantage of the known node, cannot link constraints, a priori information combined with the similarity information between nodes, and validated using artificial and real networks. It is proved that the algorithm proposed in this paper reduces the GN algorithm's time complexity and improve the efficiency.