 | Note that although this bot or a prototype of it has not been developed yet, information on this page will assume it has been developed. |
 | This user account is a bot operated by Esquivalience (talk). It is used to make repetitive automated or semi-automated edits that would be extremely tedious to do manually, in accordance with the bot policy. This bot does not yet have the approval of the community, or approval has been withdrawn or expired, and therefore shouldn't be making edits that appear to be unassisted except in the operator's or its own user and user talk space. Administrators: if this bot is making edits that appear to be unassisted to pages not in the operator's or its own userspace, please block it. |
| This user is a bot | |
|---|---|
| (talk · contribs) | |
 LambdaBot in action (artist's conception) | |
| Operator | Esquivalience (talk · contribs) |
| Approved? | Not yet |
| Flagged? | No |
| Task(s) | Detect promotional editing and page creation and respond appropriately |
| Edit rate | ~200 edits per hour, speed limit is 300 edits per hour |
| Automatic or manual? | Automatic |
| Programming language(s) | Python |
| Exclusion compliant? | Yes |
LambdaBot (λBot or ΛBot for short) is a work-in-progress bot that detects sockpuppetry.
Algorithms edit
LambdaBot α: General edit
Stylometry edit
We will use the Writeprints framework of Zhang et al. (2003) for feature extraction. A feature matrix is a -by-270 matrix, where is the number of authors.
Centrality edit
Centrality measures the importance of one vertex to a network.[a] A vertex that has high centrality is a vital part of a network; removal would affect many vertices in terms of graph-theoric measures. We will use eigenvector centrality. Let be an adjacency matrix of our graph. Then we calculate the centrality vector as the corresponding vector for the maximum eigenvalue of .
Notes edit
- ^ The terms "network" and "graph" are used interchangeably.
Source edit
The source code is available at User:LambdaBot/Source.
References edit
- Brandes, Ulrik (2001). "A faster algorithm for betweenness centrality". The Journal of Mathematical Sociology. 25 (2): 163–177. doi:10.1080/0022250X.2001.9990249.
- Zhang, Rong; Li, Jiexun; Chen, Hsinchun; Huang, Zan (2006). "A framework for authorship identification of online messages: Writing-style features and classification techniques". Journal of the American Society for Information Science and Technology. 57 (3): 378–393. doi:10.1002/asi.v57:3.