Name
Abstract | ||
|---|---|---|
In this paper we address the problem of quick detection of high-degree entities in large online social networks. Practical importance of this problem is attested by a large number of companies that continuously collect and update statistics about popular entities, usually using the degree of an entity as an approximation of its popularity. We suggest a simple, efficient, and easy to implement two-stage randomized algorithm that provides highly accurate solutions to this problem. For instance, our algorithm needs only one thousand API requests in order to find the top-100 most followed users, with more than 90% precision, in the online social network Twitter with approximately a billion of registered users. Our algorithm significantly outperforms existing methods and serves many different purposes such as finding the most popular users or the most popular interest groups in social networks. An important contribution of this work is the analysis of the proposed algorithm using Extreme Value Theory - a branch of probability that studies extreme events and properties of largest order statistics in random samples. Using this theory we derive an accurate prediction for the algorithm's performance and show that the number of API requests for finding the top-k most popular entities is sub linear in the number of entities. Moreover, we formally show that the high variability of the entities, expressed through heavy-tailed distributions, is the reason for the algorithm's efficiency. We quantify this phenomenon in a rigorous mathematical way. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ICDM.2014.95 | Data Mining |
Keywords | DocType | Volume |
application program interfaces,randomised algorithms,social networking (online),API requests,approximation,extreme value theory,high-degree entities,large directed networks,online social network Twitter,online social networks,quick detection,randomized algorithm,statistics,top-k most popular entities,high-degree entities,randomized algorithm,social networks,sublinear complexity | Journal | abs/1410.0571 |
ISSN | Citations | PageRank |
1550-4786 | 9 | 0.59 |
References | Authors | |
16 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Konstantin Avrachenkov | 1 | 1250 | 126.17 |
| Nelly Litvak | 2 | 259 | 25.53 |
| Liudmila Ostroumova Prokhorenkova | 3 | 12 | 2.05 |
| Eugenia Suyargulova | 4 | 9 | 0.59 |