Demo Data from EDBT 2026 / reviewers in the wild / expert
Jessica Su
dblp:178/3646
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 3 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
2 papers |
Web and social media mining · 71% Recommender systems · 29% | |
| Network and information security
1 paper |
Privacy and data protection · 77% Network security · 23% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Web and social media mining
social network analysis |
0.5 | 2 | 2017 | De-anonymizing Web Browsing Data with Social Networks · WWW 2017 The Effect of Recommendations on Network Structure · WWW 2016 |
Privacy and data protection
de-anonymization |
0.3 | 1 | 2017 | De-anonymizing Web Browsing Data with Social Networks · WWW 2017 |
Web and social media mining › social network analysis
network evolution |
0.2 | 1 | 2016 | The Effect of Recommendations on Network Structure · WWW 2016 |
Recommender systems
social recommendation |
0.2 | 1 | 2016 | The Effect of Recommendations on Network Structure · WWW 2016 |
Network security
traffic analysis |
0.1 | 1 | 2017 | De-anonymizing Web Browsing Data with Social Networks · WWW 2017 |
Recommender systems › social recommendation
link recommendation |
0.1 | 1 | 2016 | The Effect of Recommendations on Network Structure · WWW 2016 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.6maximum likelihood estimation · 0.6theoretical modeling · 0.2empirical analysis · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | An Experimental Study of Structural Diversity in Social Networks
Jessica Su, Krishna Kamath, Aneesh Sharma, Johan Ugander, Sharad Goel |
ICWSM | 1 |
| 2017 | De-anonymizing Web Browsing Data with Social NetworksabstractCan online trackers and network adversaries de-anonymize web browsing data readily available to them? We show---theoretically, via simulation, and through experiments on real user data---that de-identified web browsing histories can be linked to social media profiles using only publicly available data. Our approach is based on a simple observation: each person has a distinctive social network, and thus the set of links appearing in one's feed is unique. Assuming users visit links in their feed with higher probability than a random user, browsing histories contain tell-tale marks of identity. We formalize this intuition by specifying a model of web browsing behavior and then deriving the maximum likelihood estimate of a user's social profile. We evaluate this strategy on simulated browsing histories, and show that given a history with 30 links originating from Twitter, we can deduce the corresponding Twitter profile more than 50% of the time.To gauge the real-world effectiveness of this approach, we recruited nearly 400 people to donate their web browsing histories, and we were able to correctly identify more than 70% of them. We further show that several online trackers are embedded on sufficiently many websites to carry out this attack with high accuracy. Our theoretical contribution applies to any type of transactional data and is robust to noisy observations, generalizing a wide range of previous de-anonymization attacks. Finally, since our attack attempts to find the correct Twitter profile out of over 300 million candidates, it is---to our knowledge---the largest-scale demonstrated de-anonymization to date. Jessica Su, Ansh Shukla, Sharad Goel, Arvind Narayanan |
WWW | 1 |
| 2016 | The Effect of Recommendations on Network StructureabstractOnline social networks regularly offer users personalized, algorithmic suggestions of whom to connect to. Here we examine the aggregate effects of such recommendations on network structure, focusing on whether these recommendations increase the popularity of niche users or, conversely, those who are already popular. We investigate this issue by empirically and theoretically analyzing abrupt changes in Twitter's network structure around the mid-2010 introduction of its "Who to Follow" feature. We find that users across the popularity spectrum benefitted from the recommendations; however, the most popular users profited substantially more than average. We trace this "rich get richer" phenomenon to three intertwined factors. First, as is typical of network recommenders, the system relies on a "friend-of-friend"-style algorithm, which we show generally results in users being recommended proportional to their degree. Second, we find that the baseline growth rate of users is sublinear in degree. This mismatch between the recommender and the natural network dynamics thus alters the structural evolution of the network. Finally, we find that people are much more likely to respond positively to recommendations for popular users---perhaps because of their greater name recognition---further amplifying the cumulative advantage of well-known individuals. Jessica Su, Aneesh Sharma, Sharad Goel |
WWW | 1 |