{"title":"复杂网络代数图聚类算法的评价","authors":"K. Erciyes","doi":"10.1109/iisec54230.2021.9672390","DOIUrl":null,"url":null,"abstract":"We review main graph clustering algorithms which are MST-based, Shared Nearest Neighbor and Edge-Betweenness algorithms and show novel algebraic graph implementations using Python. We compare them using randomly generated scale-free graphs and provide pointers for parallel processing","PeriodicalId":344273,"journal":{"name":"2021 2nd International Informatics and Software Engineering Conference (IISEC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Evaluation of algebraic graph clustering algorithms for complex networks\",\"authors\":\"K. Erciyes\",\"doi\":\"10.1109/iisec54230.2021.9672390\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We review main graph clustering algorithms which are MST-based, Shared Nearest Neighbor and Edge-Betweenness algorithms and show novel algebraic graph implementations using Python. We compare them using randomly generated scale-free graphs and provide pointers for parallel processing\",\"PeriodicalId\":344273,\"journal\":{\"name\":\"2021 2nd International Informatics and Software Engineering Conference (IISEC)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 2nd International Informatics and Software Engineering Conference (IISEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iisec54230.2021.9672390\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 2nd International Informatics and Software Engineering Conference (IISEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iisec54230.2021.9672390","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Evaluation of algebraic graph clustering algorithms for complex networks
We review main graph clustering algorithms which are MST-based, Shared Nearest Neighbor and Edge-Betweenness algorithms and show novel algebraic graph implementations using Python. We compare them using randomly generated scale-free graphs and provide pointers for parallel processing
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
