paper-with-me

홈 › Papers

Generalizing the first-difference correlated random walk for marine animal movement data

2018-06-22

Animal telemetry data are often analysed with discrete time movement models assuming rotation in the movement. These models are defined with equidistant distant time steps. However, telemetry data from marine animals are observed irregularly. To account for irregular data, a time-irregularised first-difference correlated random walk model with drift is introduced. The model generalizes the commonly used first-difference correlated random walk with regular time steps by allowing irregular time steps, including a drift term, and by allowing different autocorrelation in the two coordinates. The model is applied to data from a ringed seal collected through the Argos satellite system, and is compared to related movement models through simulations. Accounting for irregular data in the movement model results in accurate parameter estimates and reconstruction of movement paths. Measured by distance, the introduced model can provide more accurate movement paths than the regular time counterpart. Extracting accurate movement paths from uncertain telemetry data is important for evaluating space use patterns for marine animals, which in turn is crucial for management. Further, handling irregular data directly in the movement model allows efficient simultaneous analysis of several animals.

📄 PDF Abstract BibTeX arXiv:1806.08582

Code (0)

등록된 구현이 없습니다.

Tasks

Management

Similar Papers 제목 키워드 기반

A Framework for Generalizing Graph-based Representation Learning Methods

2017-09-14 · Nesreen K. Ahmed, Ryan A. Rossi, Rong Zhou, John Boaz Lee 외

Random walks are at the heart of many existing deep learning algorithms for graph data. However, such algorithms have many limitations that arise from the use of random walks, e.g., the features resulting from these meth…

Inductive LearningRepresentation Learning

Learning Role-based Graph Embeddings

2018-02-07 · IJCAI 2018 7 · Nesreen K. Ahmed, Ryan Rossi, John Boaz Lee, Theodore L. Willke 외

Random walks are at the heart of many existing network embedding methods. However, such algorithms have many limitations that arise from the use of random walks, e.g., the features resulting from these methods are unable…

Inductive LearningNetwork Embedding

The Random Walk behind Volatility Clustering

2016-12-29

Financial price changes obey two universal properties: they follow a power law and they tend to be clustered in time. The second regularity, known as volatility clustering, entails some predictability in the price change…

Clustering

Lossy Compression of Decimated Gaussian Random Walks

2018-02-26

We consider the problem of estimating a Gaussian random walk from a lossy compression of its decimated version. Hence, the encoder operates on the decimated random walk, and the decoder estimates the original random walk…

Decoder

Inductive Representation Learning in Large Attributed Graphs

2017-10-25 · Nesreen K. Ahmed, Ryan A. Rossi, Rong Zhou, John Boaz Lee 외

Graphs (networks) are ubiquitous and allow us to model entities (nodes) and the dependencies (edges) between them. Learning a useful feature representation from graph data lies at the heart and success of many machine le…

Anomaly DetectionAttributeLink PredictionRepresentation Learning