{"title":"维基百科中Sockpuppet帐户的自动检测","authors":"M. Sakib, Francesca Spezzano","doi":"10.1109/ASONAM55673.2022.10068604","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of identifying sockpuppet accounts on Wikipedia. We formulate the problem as a binary classification task and propose a set of features based on user activity and the semantics of their contributions to separate sockpuppets from benign users. We tested our system on a dataset we built (and released to the research community) containing 17K accounts validated as sockpuppets. Experimental results show that our approach achieves an F1-score of 0.82 and outperforms other systems proposed in the literature. Moreover, our proposed approach is able to achieve an F1-score of 0.73 at detecting sockpuppet accounts by just considering their first edit.","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Automated Detection of Sockpuppet Accounts in Wikipedia\",\"authors\":\"M. Sakib, Francesca Spezzano\",\"doi\":\"10.1109/ASONAM55673.2022.10068604\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the problem of identifying sockpuppet accounts on Wikipedia. We formulate the problem as a binary classification task and propose a set of features based on user activity and the semantics of their contributions to separate sockpuppets from benign users. We tested our system on a dataset we built (and released to the research community) containing 17K accounts validated as sockpuppets. Experimental results show that our approach achieves an F1-score of 0.82 and outperforms other systems proposed in the literature. Moreover, our proposed approach is able to achieve an F1-score of 0.73 at detecting sockpuppet accounts by just considering their first edit.\",\"PeriodicalId\":423113,\"journal\":{\"name\":\"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASONAM55673.2022.10068604\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASONAM55673.2022.10068604","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Automated Detection of Sockpuppet Accounts in Wikipedia
This paper addresses the problem of identifying sockpuppet accounts on Wikipedia. We formulate the problem as a binary classification task and propose a set of features based on user activity and the semantics of their contributions to separate sockpuppets from benign users. We tested our system on a dataset we built (and released to the research community) containing 17K accounts validated as sockpuppets. Experimental results show that our approach achieves an F1-score of 0.82 and outperforms other systems proposed in the literature. Moreover, our proposed approach is able to achieve an F1-score of 0.73 at detecting sockpuppet accounts by just considering their first edit.