Database Paper Browser

Back to papers

YADING: Fast Clustering of Large-Scale Time Series Data

Summary: YADING—end-to-end time-series clustering via sampling: cluster a subset and assign the rest, with theory-backed bounds for distributional consistency and robustness to phase perturbation and noise using L1 and multi-density. On 100k×1k data, it is ~40× faster than DENCLUE 2.0 and ~1k× faster than DBSCAN/CLARANS; demonstrated in Microsoft product analyses. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11159
Venue
VLDB
Year
2015
Pagerank
5.8956566e-05
Overall Rank
4,823 | 66.45%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Rank Citing Paper Year Venue Pagerank
4,059 GRAIL: Efficient Time-Series Representation Learning 2019 VLDB 6.4854417e-05
4,853 Debunking Four Long-Standing Misconceptions of Time-Series Distance Measures 2020 SIGMOD 5.8760276e-05
10,331 MS-Index: Fast Top-k Subsequence Search for Multivariate Time Series under Euclidean Distance 2026 VLDB 4.1945683e-05
10,466 A Structured Study of Multivariate Time-Series Distance Measures 2025 SIGMOD 4.1945683e-05
10,674 Improving Time Series Data Compression in Apache IoTDB 2025 VLDB 4.1945683e-05
10,716 Federated and Balanced Clustering for High-dimensional Data 2025 VLDB 4.1945683e-05
10,739 Time-Series Clustering: A Comprehensive Study of Data Mining, Machine Learning, and Deep Learning Methods 2025 VLDB 4.1945683e-05
10,884 Representative Time Series Discovery for Data Exploration 2025 VLDB 4.1945683e-05
11,142 Cache-Efficient Top-k Aggregation over High Cardinality Large Datasets 2024 VLDB 4.1945683e-05
11,235 Accelerating Similarity Search for Elastic Measures: A Study and New Generalization of Lower Bounding Distances 2023 VLDB 4.1945683e-05
11,340 Scalable Time Series Compound Infrastructure 2022 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
6 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0016162015
27 Efficient and Effective Clustering Methods for Spatial Data Mining 1994 VLDB 0.00080736878
129 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.0004429571
243 Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases 2001 SIGMOD 0.00031074984
270 OPTICS: Ordering Points To Identify the Clustering Structure 1999 SIGMOD 0.00029505642
341 CURE: An Efficient Clustering Algorithm for Large Databases 1998 SIGMOD 0.00026810548
539 Fast Time Sequence Indexing for Arbitrary L_p Norms 2000 VLDB 0.00020666392
1,097 STING : A Statistical Information Grid Approach to Spatial Data Mining 1997 VLDB 0.00014119975
3,338 Fast Time-Series Searching with Scaling and Shifting 1999 PODS 7.2040692e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
7,210 Set-based Similarity Search for Time Series 2016 SIGMOD 4.799457e-05
3,794 Identifying Representative Trends in Massive Time Series Data Sets Using Sketches 2000 VLDB 6.7617267e-05
7,480 Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms 2024 SIGMOD 4.7180617e-05
5,245 Fast and Scalable Mining of Time Series Motifs with Probabilistic Guarantees 2022 VLDB 5.6067361e-05
3,323 CRD: Fast Co-clustering on Large Datasets Utilizing Sampling-Based Matrix Decomposition 2008 SIGMOD 7.2224696e-05
5,324 Clustering Stream Data by Exploring the Evolution of Density Mountain 2018 VLDB 5.5691645e-05
10,379 In-Database Time Series Clustering 2025 SIGMOD 4.1945683e-05
1,516 k-Shape: Efficient and Accurate Clustering of Time Series 2015 SIGMOD 0.00011586255
662 A Framework for Clustering Evolving Data Streams 2003 VLDB 0.00018475968
10,739 Time-Series Clustering: A Comprehensive Study of Data Mining, Machine Learning, and Deep Learning Methods 2025 VLDB 4.1945683e-05