We lifted 5 functions out of this paper's own repositories and ran 1 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| kevaldoshi17/TiSAT | canonical | 1 of 5 |
| Function | Status | Where it lives |
|---|---|---|
| CORR | Ran | kevaldoshi17/TiSAT/utils/metrics.py code served (permissive licence) · get_code("03d63d172032b256") |
| MAE | Not yet run | kevaldoshi17/TiSAT/utils/metrics.py code served (permissive licence) · get_code("75f44993b096bf76") |
| RSE | Not yet run | kevaldoshi17/TiSAT/utils/metrics.py code served (permissive licence) · get_code("b40a11875ebd0cd2") |
| time_features | Not yet run | kevaldoshi17/TiSAT/utils/timefeatures.py code served (permissive licence) · get_code("fd33e580236536b7") |
| time_features_from_frequency_str | Not yet run | kevaldoshi17/TiSAT/utils/timefeatures.py code served (permissive licence) · get_code("f8544563682146e5") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
While anomaly detection in time series has been an active area of research for several years, most recent approaches employ an inadequate evaluation criterion leading to an inflated F1 score. We show that a rudimentary Random Guess method can outperform state-of-the-art detectors in terms of this popular but faulty evaluation criterion. In this work, we propose a proper evaluation metric that measures the timeliness and precision of detecting sequential anomalies. Moreover, most existing approaches are unable to capture temporal features from long sequences. Self-attention based approaches, such as transformers, have been demonstrated to be particularly efficient in capturing long-range dependencies while being computationally efficient during training and inference. We also propose an efficient transformer approach for anomaly detection in time series and extensively evaluate our proposed approach on several popular benchmark datasets.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2203.05167")
get_code_for_paper("2203.05167")
have("2203.05167")
Connect an agent — have() is free.