Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jinggong Zhang
dblp:206/9080
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 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.
| Computer networks
1 paper |
Cellular and mobile networks · 33% Wireless networking · 33% Network optimization and economics · 33% | |
| Artificial intelligence
1 paper |
Graph learning · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Wireless networking › interference modeling
conflict graph construction |
0.3 | 1 | 2017 | Conflict graph embedding for wireless network optimization · INFOCOM 2017 |
Cellular and mobile networks
interference management |
0.3 | 1 | 2017 | Conflict graph embedding for wireless network optimization · INFOCOM 2017 |
Network optimization and economics
network optimization |
0.3 | 1 | 2017 | Conflict graph embedding for wireless network optimization · INFOCOM 2017 |
Machine learning › Graph learning
network embedding |
0.1 | 1 | 2017 | Conflict graph embedding for wireless network optimization · INFOCOM 2017 |
Methods — techniques the papers use, named apart from their topics
sliding-window sampling · 0.6graph embedding · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Conflict graph embedding for wireless network optimizationabstractWith the dense deployment of wireless infrastructure such as radio towers and WiFi access points, wireless network optimization becomes very important for improving the network capacity and enhancing the communication quality of wireless links. Most optimization algorithms rely on the conflict graph to describe the interference situation. However, building a conflict graph requires exhaustive measurements of the whole network and the existing estimation approaches are static and inaccurate. In this paper, we propose a conflict graph embedding approach to assess network interference situations by representing the wireless nodes with low-dimensional vectors while preserving their conflict relationships. Specifically, our approach introduces a sliding-window based partial measurement method to sample the interference graph in the network, then adopts a learning algorithm to obtain the vector representation of the nodes, and then infers the interference situations by exploring the feature vectors. The proposed approach has been proved to be low measurement overhead, low computational cost, and self-adaptive, which is suitable for large-scale dynamic wireless networks. We illustrate that conflict graph embedding can be used for interference-aware wireless network optimizations. We conduct extensive experiments based on real wireless network datasets, which show the efficiency of the proposed approach. Jinggong Zhang, Yanchao Zhao |
INFOCOM | 2 |