Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

VenuMadhav Cheedella

dblp:34/45 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › structured data mining › graph mining
approximate graph mining		 0.112007
Monkey: Approximate Graph Mining Based on Spanning Trees · ICDE 2007
Data mining › pattern mining
frequent pattern mining		 0.112007
Monkey: Approximate Graph Mining Based on Spanning Trees · ICDE 2007
Data mining › structured data mining
graph mining		 0.112007
Monkey: Approximate Graph Mining Based on Spanning Trees · ICDE 2007
Graph algorithms and graph theory
spanning tree		 0.012007
Monkey: Approximate Graph Mining Based on Spanning Trees · ICDE 2007

Methods — techniques the papers use, named apart from their topics

spanning tree pre-verification · 0.1frequent tree mining · 0.1
YearPublicationVenuePosition
2007 Monkey: Approximate Graph Mining Based on Spanning Trees
abstract
In the recent past, many exact graph mining algorithms have been developed to find frequent patterns in a graph database. However, many networks or graphs generated from biological data and other applications may be incomplete or inaccurate. Hence, it is necessary to design approximate graph mining techniques. In this paper, we will study the problem of approximate graph mining and propose an optimized solution which uses frequent trees and a spanning tree based pre-verification check in the mining process.
Jiong Yang 0001, VenuMadhav Cheedella
 ICDE3