{"title":"利用传播信息发现有影响力的用户","authors":"Saptaditya Maiti, D. Mandal, Pabitra Mitra","doi":"10.1109/RAICS.2013.6745489","DOIUrl":null,"url":null,"abstract":"This article discusses about detecting the most influential users in an online social network. We observe that a communication of an influential user is likely to reach many more users than the same made by a user having lesser influence in the network. Based on this observation, We have formulated a method using the spread of communications (i.e., the number of users the communication reaches). We have verified the method on three datasets downloaded from `Twitter' and results are found to be the best among existing methods on the said datasets.","PeriodicalId":184155,"journal":{"name":"2013 IEEE Recent Advances in Intelligent Computational Systems (RAICS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Detecting influential users using spread of communications\",\"authors\":\"Saptaditya Maiti, D. Mandal, Pabitra Mitra\",\"doi\":\"10.1109/RAICS.2013.6745489\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article discusses about detecting the most influential users in an online social network. We observe that a communication of an influential user is likely to reach many more users than the same made by a user having lesser influence in the network. Based on this observation, We have formulated a method using the spread of communications (i.e., the number of users the communication reaches). We have verified the method on three datasets downloaded from `Twitter' and results are found to be the best among existing methods on the said datasets.\",\"PeriodicalId\":184155,\"journal\":{\"name\":\"2013 IEEE Recent Advances in Intelligent Computational Systems (RAICS)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE Recent Advances in Intelligent Computational Systems (RAICS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RAICS.2013.6745489\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Recent Advances in Intelligent Computational Systems (RAICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAICS.2013.6745489","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Detecting influential users using spread of communications
This article discusses about detecting the most influential users in an online social network. We observe that a communication of an influential user is likely to reach many more users than the same made by a user having lesser influence in the network. Based on this observation, We have formulated a method using the spread of communications (i.e., the number of users the communication reaches). We have verified the method on three datasets downloaded from `Twitter' and results are found to be the best among existing methods on the said datasets.