2019
DOI: 10.1007/978-3-030-37188-3_18
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Algorithms for Flock Detection in Large Spatio-Temporal Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…1. Designing faster algorithms for ST clustering using that can process massive amounts of data and thus enable large-scale studies like clustering of trajectories [11]. 2.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…1. Designing faster algorithms for ST clustering using that can process massive amounts of data and thus enable large-scale studies like clustering of trajectories [11]. 2.…”
Section: Discussionmentioning
confidence: 99%
“…While most of these techniques extend spatial clustering by treating time as another dimension, the specific requirements of the application dictate the parameters and thresholds. For example, different parameters and adaptation of the algorithms are used in identification of disease clusters compared to identification of flocks, convoys, and swarms [11] For the analysis in this paper, we employ a spatial scan statistic that has been developed to test for geographical clusters and to identify their approximate location [12]. The spatial scan statistic imposes a circular window on the map and lets the center of the circle move over the area so that at different positions the window includes different sets of neighboring areas.…”
Section: St Clustering Algorithmsmentioning
confidence: 99%