EDBT 2026 Demo / reviewers in the wild / expert
Rongchang Duan
dblp:199/0127
· DBLP profile ↗
3ranked-venue papers
2as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 2 first-authorDatabases, 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 |
Data mining · 67% Information retrieval · 33% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining
time series analysis |
0.6 | 1 | 2022 | A Linear Time Approach to Computing Time Series Similarity Based on Deep Metric Learning · IEEE Trans. Knowl. Data Eng. 2022 |
Data mining › time series analysis
time series similarity |
0.6 | 1 | 2022 | A Linear Time Approach to Computing Time Series Similarity Based on Deep Metric Learning · IEEE Trans. Knowl. Data Eng. 2022 |
Information retrieval › similarity search › sequence similarity search
time series similarity search |
0.6 | 1 | 2022 | A Linear Time Approach to Computing Time Series Similarity Based on Deep Metric Learning · IEEE Trans. Knowl. Data Eng. 2022 |
Methods — techniques the papers use, named apart from their topics
recurrent neural network · 0.6ranking loss · 0.6neural metric learning · 0.6deep metric learning · 0.6attention mechanism · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | A Linear Time Approach to Computing Time Series Similarity Based on Deep Metric LearningabstractTime series similarity computation is a fundamental primitive that underpins many time series data analysis tasks. However, many existing time series similarity measures have a high computation cost. While there has been much research effort for reducing the computational cost, such effort is usually specific to one similarity measure. We proposeNeuTS(Neural metric learning forTimeSeries) to accelerate time series similarity computation in a generic fashion.NeuTScomputes the similarity of a given time series pair in linear time and generic to handle any existing similarity measures.NeuTSsamples a number of seed time series from the given database, and then uses their pair-wise similarities as guidance to approximate the similarity function with a neural metric learning framework.NeuTSfeatures two novel modules to achieve accurate approximation of the similarity function: (1) a local attention memory module that augments existing recurrent neural networks for time series encoding; and (2) a distance-weighted ranking loss that effectively transcribes information from the seed-based guidance. With these two modules,NeuTScan yield high accuracies and fast convergence rates even if the training data is small. Our experiments with five real-life datasets and four similarity measures (Fréchet, Hausdorff, ERP and DTW) show thatNeuTSoutperforms baselines consistently and significantly. Specifically, it achieves over 80 percent accuracies in most settings, while obtaining 50x-1000x speedup over bruteforce methods and 3x-350x speedup over approximate algorithms for top-k similarity search. Di Yao 0001, Gao Cong, Chao Zhang 0014, Xuying Meng, Rongchang Duan, Jingping Bi |
IEEE Trans. Knowl. Data Eng. | 5 |
| 2019 | PQ-MAC: Exploiting Bidirectional Transmission Opportunities via Leveraging Peers' Queuing Information for Full-Duplex WLANabstractFull-duplex (FD) wireless is an attractive PHY technology with high potential to improve the throughput of WLAN due to bidirectional transmissions. However, existing FD MACs fail to fully take advantage of bidirectional transmissions because of neglecting a feature of FD wireless that whether to build bidirectional transmissions relies on the queuing state of peers. In this paper, we design PQ-MAC, the first FD MAC which exploits more bidirectional transmission opportunities by leveraging peers' queuing information. Since PQ-MAC seizes the neglected but important feature, PQ-MAC can improve the performance with a slight transmission overhead. Simulations show that, in a 1-cell FD WLAN, PQ-MAC can achieve higher throughput than existing MACs when the buffer of AP is relatively small (≤200 frames). When the buffer of AP is relatively large (>200 frames), PQ-MAC can reduce the queuing delay without the loss of throughput. Rongchang Duan, Qinglin Zhao, Hanwen Zhang 0001, Yujun Zhang 0001, Zhongcheng Li |
ISCC | 1 |
| 2017 | Modeling and performance analysis of RI-MAC under a star topology
Rongchang Duan, Qinglin Zhao, Hanwen Zhang 0001, Yujun Zhang 0001, Zhongcheng Li |
Comput. Commun. | 1 |