Demo Data from EDBT 2026 / reviewers in the wild / expert
Meesun Song
dblp:12/8399
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
1 paper |
Web and social media mining · 100% | |
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Web and social media mining
social network analysis |
0.1 | 1 | 2010 | Extraction and Visualization of Implicit Social Relations on Social Networking Services · AAAI 2010 |
Visualization and visual analytics › graph visualization
social network visualization |
0.0 | 1 | 2010 | Extraction and Visualization of Implicit Social Relations on Social Networking Services · AAAI 2010 |
Methods — techniques the papers use, named apart from their topics
message thread analysis · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Extraction and Visualization of Implicit Social Relations on Social Networking ServicesabstractToday social network services like blogs, communities, and social networking sites dominate the web. As Web 2.0 has evolved this way, analyzing social networks has become a promising research issue. There have already been several researches on social network analysis based on users' activities in social services. Most of them focus on the links among the users such as citation, trackback, and comment. However, few studies have analyzed the relations within message threads. In general, they considered the one-way relationship from a comment writer to a post writer. Since users communicate with each other primarily by posting comments one after another, the message threads are key to analyzing latent social relationships. In this paper, we propose a novel method to extract the social relations hidden behind message threads. To evaluate our algorithms, we developed an evaluation system and measured the performances. In addition, since the typical node-edge diagram for social network visualization is not intuitive or readable, we also introduce a novel visualization and interaction method suitable for social relation exploration. Further, we expect our work will help enhance social recommendations, advertisements and personalization. Meesun Song, Wonkyu Lee |
AAAI | 1 |