2020 IEEE 36th International Conference on Data Engineering (ICDE) 2020
DOI: 10.1109/icde48307.2020.00077
|View full text |Cite
|
Sign up to set email alerts
|

Multiscale Frequent Co-movement Pattern Mining

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 23 publications
0
1
0
Order By: Relevance
“…Informally, a co-movement pattern can be defined as a group of objects moving together for at least some time duration. While there exists a plethora of works in this area, such as [3,[5][6][7]15], we choose the algorithm proposed in [13], where the authors propose a novel co-movement pattern definition, called evolving clusters, that unifies the definitions of flocks and convoys and reduces them to Maximal Cliques (MC), and Maximal Connected Subgraphs (MCS), respectively; see the difference between the two in Figure 2. For the purposes of our demonstration, we choose to run EvolvingClusters in two modes:…”
Section: Co-movement Patternsmentioning
confidence: 99%
“…Informally, a co-movement pattern can be defined as a group of objects moving together for at least some time duration. While there exists a plethora of works in this area, such as [3,[5][6][7]15], we choose the algorithm proposed in [13], where the authors propose a novel co-movement pattern definition, called evolving clusters, that unifies the definitions of flocks and convoys and reduces them to Maximal Cliques (MC), and Maximal Connected Subgraphs (MCS), respectively; see the difference between the two in Figure 2. For the purposes of our demonstration, we choose to run EvolvingClusters in two modes:…”
Section: Co-movement Patternsmentioning
confidence: 99%