Demo Data from EDBT 2026 / reviewers in the wild / expert
Kaan Bingöl
dblp:213/7541
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0002-3437-1411ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 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 · 56% Data mining · 36% Knowledge graphs · 8% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › network analysis
dynamic network inference |
0.4 | 1 | 2019 | Topic-Based Influence Computation in Social Networks Under Resource Constraints · IEEE Trans. Serv. Comput. 2019 |
Web and social media mining
social network analysis |
0.4 | 1 | 2019 | Topic-Based Influence Computation in Social Networks Under Resource Constraints · IEEE Trans. Serv. Comput. 2019 |
Web and social media mining › social influence analysis
topic-aware influence maximization |
0.4 | 1 | 2019 | Topic-Based Influence Computation in Social Networks Under Resource Constraints · IEEE Trans. Serv. Comput. 2019 |
Knowledge graphs
link prediction |
0.1 | 1 | 2019 | Topic-Based Influence Computation in Social Networks Under Resource Constraints · IEEE Trans. Serv. Comput. 2019 |
Data mining
network inference |
0.1 | 1 | 2019 | Topic-Based Influence Computation in Social Networks Under Resource Constraints · IEEE Trans. Serv. Comput. 2019 |
Methods — techniques the papers use, named apart from their topics
semantic analysis · 0.4pagerank · 0.4link prediction · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Topic-Based Influence Computation in Social Networks Under Resource ConstraintsabstractAs social networks are constantly changing and evolving, methods to analyze dynamic social networks are becoming more important in understanding social trends. However, due to the restrictions imposed by the social network service providers, the resources available to fetch the entire contents of a social network are typically very limited. As a result, analysis of dynamic social network data requires maintaining an approximate copy of the social network for each time period, locally. In this paper, we study the problem of dynamic network and text fetching with limited probing capacities, for identifying and maintaining influential users as the social network evolves. We propose an algorithm to probe the relationships (required for global influence computation) as well as posts (required for topic-based influence computation) of a limited number of users during each probing period, based on the influence trends and activities of the users. We infer the current network based on the newly probed user data and the last known version of the network maintained locally. Additionally, we propose to use link prediction methods to further increase the accuracy of our network inference. We employ PageRank as the metric for influence computation. We illustrate how the proposed solution maintains accurate PageRank scores for computing global influence, and topic-sensitive weighted PageRank scores for topic-based influence. The latter relies on a topic-based network constructed via weights determined by semantic analysis of posts and their sharing statistics. We evaluate the effectiveness of our algorithms by comparing them with the true influence scores of the full and up-to-date version of the network, using data from the micro-blogging service Twitter. Results show that our techniques significantly outperform baseline methods (80 percent higher accuracy for network fetching and 77 percent for text fetching) and are superior to state-of-the-art techniques from the literature (21 percent higher accuracy). Kaan Bingöl, Bahaeddin Eravci, Çagri Özgenc Etemoglu, Hakan Ferhatosmanoglu, Bugra Gedik |
IEEE Trans. Serv. Comput. | 1 |