Demo Data from EDBT 2026 / reviewers in the wild / expert
Shuye Pan
dblp:323/1196
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2022
—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-author · 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 |
Data mining · 67% Spatial and temporal data management · 33% | |
| Computer networks
1 paper |
Internet of things and sensor networks · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining
pattern mining |
0.6 | 1 | 2022 | NLC: Search Correlated Window Pairs on Long Time Series · Proc. VLDB Endow. 2022 |
Data mining › temporal analysis
temporal correlation |
0.6 | 1 | 2022 | NLC: Search Correlated Window Pairs on Long Time Series · Proc. VLDB Endow. 2022 |
Spatial and temporal data management
temporal databases |
0.6 | 1 | 2022 | NLC: Search Correlated Window Pairs on Long Time Series · Proc. VLDB Endow. 2022 |
Internet of things and sensor networks
sensor data |
0.2 | 1 | 2022 | NLC: Search Correlated Window Pairs on Long Time Series · Proc. VLDB Endow. 2022 |
Methods — techniques the papers use, named apart from their topics
window shrinking · 1.1window extending · 1.1nested one-dimensional search · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | NLC: Search Correlated Window Pairs on Long Time SeriesabstractNowadays, many applications, like Internet of Things and Industrial Internet, collect data points from sensors continuously to form long time series. Finding correlation between time series is a fundamental task for many time series mining problems. However, most existing works in this area are either limited in the type of detected relations, like only the linear correlations, or not handling the complex temporal relations, like not considering the unaligned windows or variable window lengths. In this paper, we propose an efficient approach, Non-Linear Correlation search (NLC), to search the correlated window pairs on two long time series. Firstly, we propose two strategies, window shrinking and window extending, to quickly find the high-quality candidates of correlated window pairs. Then, we refine the candidates by a nested one-dimensional search approach. We conduct a systematic empirical study to verify the efficiency and effectiveness of our approach over both synthetic and real-world datasets. Shuye Pan, Peng Wang 0027, Chen Wang 0018, Wei Wang 0009, Jianmin Wang 0001 |
Proc. VLDB Endow. | 1 |