Demo Data from EDBT 2026 / reviewers in the wild / expert
Conrad Lee
dblp:42/9509
· DBLP profile ↗
4ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 4 · 2 first-authorArtificial intelligence and machine learning · 3 · 2 first-authorHuman-computer interaction and ubiquitous computing · 3 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1
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
1 paper |
Web and social media mining · 50% Knowledge graphs · 50% | |
| Theoretical computer science
1 paper |
Distributed computing theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge graphs
link prediction |
0.2 | 1 | 2013 | Link prediction with social vector clocks · KDD 2013 |
Web and social media mining
social network analysis |
0.2 | 1 | 2013 | Link prediction with social vector clocks · KDD 2013 |
Distributed computing theory › logical clocks
vector clocks |
0.2 | 1 | 2013 | Link prediction with social vector clocks · KDD 2013 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Simmelian backbones: amplifying hidden homophily in Facebook networksabstractEmpirical social networks are often aggregate proxies for several heterogeneous relations. In online social networks, for instance, interactions related to friendship, kinship, business, interests, and other relationships may all be represented as catchall "friendships." Because several relations are mingled into one, the resulting networks exhibit relatively high and uniform density. As a consequence, the variation in positional differences and local cohesion may be too small for reliable analysis. Bobo Nick, Conrad Lee, Padraig Cunningham, Ulrik Brandes |
ASONAM | 2 |
| 2013 | Link prediction with social vector clocksabstractState-of-the-art link prediction utilizes combinations of complex features derived from network panel data. We here show that computationally less expensive features can achieve the same performance in the common scenario in which the data is available as a sequence of interactions. Our features are based on social vector clocks, an adaptation of the vector-clock concept introduced in distributed computing to social interaction networks. In fact, our experiments suggest that by taking into account the order and spacing of interactions, social vector clocks exploit different aspects of link formation so that their combination with previous approaches yields the most accurate predictor to date. Conrad Lee, Bobo Nick, Ulrik Brandes, Padraig Cunningham |
KDD | 1 |
| 2012 | The Geographic Flow of MusicabstractThe social media website last.fm provides a detailed snapshot of what its users in hundreds of cities listen to each week. After suitably normalizing this data, we use it to test one hypothesis related to the geographic flow of music: that some cities are consistently early adopters of new music (and early to snub stale music). To test this hypothesis, we adapt a method previously used to detect the leadership networks present in flocks of birds. We find empirical support for the claim that a similar leadership network exists among cities. Conrad Lee, Padraig Cunningham |
ASONAM | 1 |
| 2011 | Identifying Representative Textual Sources in Blog Networks
Karen Wade, Derek Greene, Conrad Lee, Daniel Archambault, Padraig Cunningham |
ICWSM | 3 |