Demo Data from VLDB 2026 / reviewers in the wild / expert
Nishchal Devanur
dblp:83/9023
· DBLP profile ↗
1ranked-venue papers
0as 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 · 1Databases, data management, data science and information retrieval · 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.
| Theoretical computer science
1 paper |
Combinatorics and discrete mathematics · 100% | |
| Computer networks
1 paper |
Network measurement and analytics · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Combinatorics and discrete mathematics
discrepancy theory |
0.1 | 1 | 2010 | Detecting Novel Discrepancies in Communication Networks · ICDM 2010 |
Combinatorics and discrete mathematics › discrepancy theory
set system discrepancy |
0.1 | 1 | 2010 | Detecting Novel Discrepancies in Communication Networks · ICDM 2010 |
Methods — techniques the papers use, named apart from their topics
combinatorial discrepancy · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Detecting Novel Discrepancies in Communication NetworksabstractWe address the problem of detecting characteristic patterns in communication networks. We introduce a scalable approach based on set-system discrepancy. By implicitly labeling each network edge with the sequence of times in which its two endpoints communicate, we view an entire communication network as a set-system. This view allows us to use combinatorial discrepancy as a mechanism to "observe" system behavior at different time scales. We illustrate our approach, called Discrepancy-based Novelty Detector (DND), on networks obtained from emails, blue tooth connections, IP traffic, and tweets. DND has almost linear runtime complexity and linear storage complexity in the number of communications. Examples of novel discrepancies that it detects are (i) asynchronous communications and (ii) disagreements in the firing rates of nodes and edges relative to the communication network as a whole. James Abello, Tina Eliassi-Rad, Nishchal Devanur |
ICDM | 3 |