WSPI: a wavelet-structured popularity index for stable content ranking via trend–noise separation

Abstract Data popularity estimation ranks items by their share of demand to guide caching. Scores built from raw counts in a short window move with transient spikes; a long window is stable but reacts late and is less accurate. Our main novelty is to score popularity from the trend that a wavelet transform extracts from each item’s demand, not from its raw counts. DWT+AF and DTCWT+AF weight this trend by recency, with the discrete and dual-tree complex wavelet transforms; WSPI multiplies the DTCWT trend by a bounded factor from the spread of energy over the scales. We compare these three training-free methods with six conventional baselines on YouTube, NYC Yellow Taxi (three granularities) and MovieLens (two), over 131,443 windows, with block-bootstrap confidence intervals. With the baselines at their default 7-slot window, a wavelet-based method has the highest ranking stability (RSI@10) in all six scenarios, and WSPI has 2.0–2.8 times lower rank displacement under injected spikes than the best conventional baseline in each scenario, excluding PFRF, whose NDCG@10 is below 0.6. With an equal 64-slot window, a moving average is more stable and WSPI more accurate. WSPI offers an accuracy–stability trade-off and reacts later than short-window baselines to genuine surges.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2026-11-06
DOI
https://doi.org/10.1038/s41598-026-78774-x
Primary Topic
Caching and Content Delivery
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

WSPI: a wavelet-structured popularity index for stable content ranking via trend–noise separation

Leyli Mohammad Khanli, Aryaz Baradarani, Sajjad Pirahesh
Scientific Reports
Caching and Content Delivery
article

WSPI: a wavelet-structured popularity index for stable content ranking via trend–noise separation

Leyli Mohammad Khanli, Aryaz Baradarani, Sajjad Pirahesh
article en

Abstract

Abstract Data popularity estimation ranks items by their share of demand to guide caching. Scores built from raw counts in a short window move with transient spikes; a long window is stable but reacts late and is less accurate. Our main novelty is to score popularity from the trend that a wavelet transform extracts from each item’s demand, not from its raw counts. DWT+AF and DTCWT+AF weight this trend by recency, with the discrete and dual-tree complex wavelet transforms; WSPI multiplies the DTCWT trend by a bounded factor from the spread of energy over the scales. We compare these three training-free methods with six conventional baselines on YouTube, NYC Yellow Taxi (three granularities) and MovieLens (two), over 131,443 windows, with block-bootstrap confidence intervals. With the baselines at their default 7-slot window, a wavelet-based method has the highest ranking stability (RSI@10) in all six scenarios, and WSPI has 2.0–2.8 times lower rank displacement under injected spikes than the best conventional baseline in each scenario, excluding PFRF, whose NDCG@10 is below 0.6. With an equal 64-slot window, a moving average is more stable and WSPI more accurate. WSPI offers an accuracy–stability trade-off and reacts later than short-window baselines to genuine surges.

Scientific Reports
University of Tabriz (IR)
Openalex Percentile: Top 16%
Caching and Content Delivery
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon