Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2016
DOI: 10.1145/2939672.2939714
|View full text |Cite
|
Sign up to set email alerts
|

Scalable Time-Decaying Adaptive Prediction Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(21 citation statements)
references
References 21 publications
0
21
0
Order By: Relevance
“…Considering the seasonal patterns in traffic time-series datasets, four types of online seasonal adjustment factors are introduced in the OSAF+AKF algorithm. In addition, Tan et al defined a time-decaying online convex optimization problem and explored a Time-Decaying Adaptive Prediction (TDAP) algorithm for time series prediction [38]. In the biomedical field, time-series forward prediction algorithms were used for real-time brain oscillation detection and phase-locked stimulation in [8].…”
Section: Related Workmentioning
confidence: 99%
“…Considering the seasonal patterns in traffic time-series datasets, four types of online seasonal adjustment factors are introduced in the OSAF+AKF algorithm. In addition, Tan et al defined a time-decaying online convex optimization problem and explored a Time-Decaying Adaptive Prediction (TDAP) algorithm for time series prediction [38]. In the biomedical field, time-series forward prediction algorithms were used for real-time brain oscillation detection and phase-locked stimulation in [8].…”
Section: Related Workmentioning
confidence: 99%
“…in which g 1:t = is the proximal term used to ensure that the current solution does not deviate too much from past solutions with more influence given to most recent ones by using an exponential decaying function σ t,s = γ t−s with 1 > γ > 0 . This is our main difference from the original FTRL-Proximal algorithm [76] and its recently proposed variant [24]. The replacement of the per coordinate learning rate schedule by the decaying function proves to improve the prediction accuracy in the face of concept drift (discussed in Section 5.6).…”
Section: 322mentioning
confidence: 96%
“…Mirror Gradient Descent [20,21,22] Follow the Regularized Leader [23,24,25] In the first contribution, we study the periodic behavior of botnet and RAT toolkits widely found in the wild. We reply on frequency analysis to analyze the periodic patterns in the network traffic.…”
Section: Online Learningmentioning
confidence: 99%
See 2 more Smart Citations