Demo Data from EDBT 2026 / reviewers in the wild / expert
Arneish Prateek
dblp:234/7802
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 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 |
Data mining · 91% Graph data management · 9% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › structured data mining
graph mining |
0.4 | 1 | 2020 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network · Proc. VLDB Endow. 2020 |
Data mining
pattern mining |
0.4 | 1 | 2020 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network · Proc. VLDB Endow. 2020 |
Data mining › pattern mining › interesting pattern mining
top-k pattern mining |
0.4 | 1 | 2020 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network · Proc. VLDB Endow. 2020 |
Methods — techniques the papers use, named apart from their topics
pruning · 0.4best-first exploration · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Mining Top-k Pairs of Correlated Subgraphs in a Large NetworkabstractWe investigate the problem of correlated subgraphs mining (CSM) where the goal is to identify pairs of subgraph patterns that frequently co-occur in proximity within a single graph. Correlated subgraph patterns are different from frequent subgraphs due to the flexibility in connections between constituent subgraph instances and thus, existing frequent subgraphs mining algorithms cannot be directly applied for CSM. Moreover, computing the degree of correlation between two patterns requires enumerating and finding distances between every pair of subgraph instances of both patterns - a task that is both memory-intensive as well as computationally demanding. To this end, we propose two holistic best-first exploration algorithms: CSM-E (an exact method) and CSM-A (a more efficient approximate method with near-optimal quality). To further improve efficiency, we propose a top- k pruning strategy, while to reduce memory footprint, we develop a compressed data structure called R eplica, which stores all instances of a subgraph pattern on demand. Our empirical results demonstrate that the proposed algorithms not only mine interesting correlations, but also achieve good scalability over large networks. Arneish Prateek, Arijit Khan 0001, Akshit Goyal, Sayan Ranu |
Proc. VLDB Endow. | 1 |
| 2019 | Embedded CNN based vehicle classification and counting in non-laned road trafficabstractClassifying and counting vehicles in road traffic has numerous applications in the transportation engineering domain. However, the wide variety of vehicles (two-wheelers, three-wheelers, cars, buses, trucks etc.) plying on roads of developing regions without any lane discipline, makes vehicle classification and counting a hard problem to automate. In this paper, we use state of the art Convolutional Neural Network (CNN) based object detection models and train them for multiple vehicle classes using data from Delhi roads. We get upto 75% MAP on an 80-20 train-test split using 5562 video frames from four different locations. As robust network connectivity is scarce in developing regions for continuous video transmissions from the road to cloud servers, we also evaluate the latency, energy and hardware cost of embedded implementations of our CNN model based inferences. Mayank Singh Chauhan, Arshdeep Singh, Mansi Khemka, Arneish Prateek, Rijurekha Sen |
ICTD | 4 |