2022
DOI: 10.1007/978-3-031-22105-7_14
|View full text |Cite
|
Sign up to set email alerts
|

Fully Dynamic k-Center Clustering with Outliers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…Clustering is most often applied to spatial-only trajectories, with prior work on spatial-textual trajectory clustering being relatively rare. Trajectory clustering can be broadly divided into two categories: partition-based clustering [ 44 , 45 , 46 ] and density-based clustering [ 39 , 47 , 48 ]. Both partition- and density-based trajectory clustering require extensive similarity computations, with the only distinction being whether similarity is computed for whole trajectories or using only sub-trajectories.…”
Section: Related Workmentioning
confidence: 99%
“…Clustering is most often applied to spatial-only trajectories, with prior work on spatial-textual trajectory clustering being relatively rare. Trajectory clustering can be broadly divided into two categories: partition-based clustering [ 44 , 45 , 46 ] and density-based clustering [ 39 , 47 , 48 ]. Both partition- and density-based trajectory clustering require extensive similarity computations, with the only distinction being whether similarity is computed for whole trajectories or using only sub-trajectories.…”
Section: Related Workmentioning
confidence: 99%