{"url":"/method/nearestadvocate","slug":"nearestadvocate","name":"NearestAdvocate","full_name":"Nearest Advocate","full_name_withheld":false,"description_markdown":"This package focuses on the time delay estimation between two event-based time-series that are relatively shifted by an unknown time offset. An event-based time-series is given by a set of timestamps of certain events. If you want to guarantee synchronous measurements in advance or estimate the time delay of continuous measurements sampled at a constant rate, you might want to use other methods. However, in some use cases, performing an event detection and then estimating the relative time delay has advantages. **The Nearest Advocate method provides a precise time delay estimation in event-based time-series that is robust against imprecise timestamps, a high fraction of missing events, and clock drift.** Time delay estimation also known as the correction of time offsets and time lags as well as time synchronization.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Nearest advocate: a novel event-based time delay estimation algorithm for multi-sensor time-series data synchronization","paper":"/paper/nearest-advocate-a-novel-event-based-time","first_author":"Christoph Schranz","n_authors":4,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/nearest-advocate-a-novel-event-based-time"},"source":{"url":"https://link.springer.com/article/10.1186/s13634-024-01143-1","title":"Nearest advocate: a novel event-based time delay estimation algorithm for multi-sensor time-series data synchronization","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Sequential","area_id":"sequential","collection":"Time Delay Estimation","url":"/methods/category/time-delay-estimation","pwc_aliases":[]},{"area":"Sequential","area_id":"sequential","collection":"Time Series Analysis","url":"/methods/category/time-series-analysis","pwc_aliases":[]}],"n_papers_tagged":1,"archive_num_papers":1,"papers_newest_first":[{"paper":"/paper/nearest-advocate-a-novel-event-based-time","title":"Nearest advocate: a novel event-based time delay estimation algorithm for multi-sensor time-series data synchronization","date":"2024-04-05","arxiv_id":null,"n_code_links":1,"syntology":null}],"papers_shown":1,"tasks":[{"task":"/task/dynamic-time-warping","name":"Dynamic Time Warping","papers":1},{"task":"/task/time-series-1","name":"Time Series","papers":1}],"tasks_shown":2,"n_tasks":2,"usage_by_year":[{"year":"2024","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/nearestadvocate"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}