{"title":"Detection of Social Groups in Class by Affinity Propagation","authors":"Yajie Wang, Qiyang Peng, Zhao Pei, Miao Ma, Yuli Chen, Chengcai Leng, Honghong Yang","doi":"10.1109/IUCC/DSCI/SmartCNS.2019.00106","DOIUrl":null,"url":null,"abstract":"The social groups often represent the groups within which are dense connections and between which are sparse connections. The social groups are actually the clusters. In this paper, we propose a simple but powerful method to combine the content and link information of the social network in the class, and analyze the results of different graph clustering algorithms, our experimental result shows that social groups detection by Affinity Propagation algorithm outperforms than the other clustering algorithms. In addition, we analyze the centrality of the detected communities and find the groups detected can significantly help to improve the quality of the teaching and learning.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The social groups often represent the groups within which are dense connections and between which are sparse connections. The social groups are actually the clusters. In this paper, we propose a simple but powerful method to combine the content and link information of the social network in the class, and analyze the results of different graph clustering algorithms, our experimental result shows that social groups detection by Affinity Propagation algorithm outperforms than the other clustering algorithms. In addition, we analyze the centrality of the detected communities and find the groups detected can significantly help to improve the quality of the teaching and learning.