Decheng Tan

dblp:295/3545 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—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 since 2021

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 · 50% Data stream processing · 50%

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

TopicWeightPapersLastEvidence papers
Web and social media mining › event detection
burst detection
0.512021
BurstSketch: Finding Bursts in Data Streams · SIGMOD Conference 2021
Data stream processing
sketch
0.512021
BurstSketch: Finding Bursts in Data Streams · SIGMOD Conference 2021

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

snapshotting · 0.5running track · 0.5
YearPublicationVenuePosition
2021 BurstSketch: Finding Bursts in Data Streams
abstract
Burst is a common pattern in data streams which is characterized by a sudden increase in terms of arrival rate followed by a sudden decrease. Burst detection has attracted extensive attention from the research community. In this paper, we propose a novel sketch, namely BurstSketch, to detect bursts accurately in real time. BurstSketch first uses the technique Running Track to select potential burst items efficiently, and then monitors the potential burst items and capture the key features of burst pattern by a technique called Snapshotting. Experimental results show that our sketch achieves a 1.75 times higher recall rate than the strawman solution.
Shen Yan 0004, Zikun Li, Decheng Tan, Tong Yang 0003, Bin Cui 0001
SIGMOD Conference4