{"title":"在社交网络中识别垃圾邮件发送者的无监督方法","authors":"M. Bouguessa","doi":"10.1109/ICTAI.2011.130","DOIUrl":null,"url":null,"abstract":"This paper proposes an unsupervised method for automatic identification of spammers in a social network. In our approach, we first investigate the link structure of the network in order to derive a legitimacy score for each node. Then we model these scores as a mixture of beta distributions. The number of components in the mixture is determined by the integrated classification likelihood Bayesian information criterion, while the parameters of each component are estimated using the expectation-maximization algorithm. This method allows us to automatically discriminate between spam senders and legitimate users. Experimental results show the suitability of the proposed approach and compare its performance to that of a previous fully-supervised method. We also illustrate our approach through a test application to Yahoo! Answers, a large question-answering web service that is particularly rich in the amount and types of content and social interactions represented.","PeriodicalId":332661,"journal":{"name":"2011 IEEE 23rd International Conference on Tools with Artificial Intelligence","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"An Unsupervised Approach for Identifying Spammers in Social Networks\",\"authors\":\"M. Bouguessa\",\"doi\":\"10.1109/ICTAI.2011.130\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an unsupervised method for automatic identification of spammers in a social network. In our approach, we first investigate the link structure of the network in order to derive a legitimacy score for each node. Then we model these scores as a mixture of beta distributions. The number of components in the mixture is determined by the integrated classification likelihood Bayesian information criterion, while the parameters of each component are estimated using the expectation-maximization algorithm. This method allows us to automatically discriminate between spam senders and legitimate users. Experimental results show the suitability of the proposed approach and compare its performance to that of a previous fully-supervised method. We also illustrate our approach through a test application to Yahoo! Answers, a large question-answering web service that is particularly rich in the amount and types of content and social interactions represented.\",\"PeriodicalId\":332661,\"journal\":{\"name\":\"2011 IEEE 23rd International Conference on Tools with Artificial Intelligence\",\"volume\":\"107 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 23rd International Conference on Tools with Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTAI.2011.130\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 23rd International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2011.130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Unsupervised Approach for Identifying Spammers in Social Networks
This paper proposes an unsupervised method for automatic identification of spammers in a social network. In our approach, we first investigate the link structure of the network in order to derive a legitimacy score for each node. Then we model these scores as a mixture of beta distributions. The number of components in the mixture is determined by the integrated classification likelihood Bayesian information criterion, while the parameters of each component are estimated using the expectation-maximization algorithm. This method allows us to automatically discriminate between spam senders and legitimate users. Experimental results show the suitability of the proposed approach and compare its performance to that of a previous fully-supervised method. We also illustrate our approach through a test application to Yahoo! Answers, a large question-answering web service that is particularly rich in the amount and types of content and social interactions represented.