approximation algorithmsclusteringdynamic metric spaceshardness of approximationmoving point setsmulti-objective optimization
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Multi-objective and goal programming (90C29)
Recommendations
Cites work
- A Best Possible Heuristic for the k-Center Problem
- A local search approximation algorithm for \(k\)-means clustering
- A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
- A threshold of ln n for approximating set cover
- Analysis of a Local Search Heuristic for Facility Location Problems
- Analytical approach to parallel repetition
- Approximation algorithm for the kinetic robust \(k\)-center problem
- Approximation algorithms for combinatorial problems
- Clustering motion
- Clustering time series under the Fréchet distance
- Deformable spanners and applications
- Faster Scaling Algorithms for Network Problems
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- Geometric clustering, fixed-parameter tractability and lower bounds with respect to the dimension
- How fast is the \(k\)-means method?
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1501063 (Why is no real title available?)
- scientific article; zbMATH DE number 1754597 (Why is no real title available?)
- scientific article; zbMATH DE number 6472653 (Why is no real title available?)
- Kinetic spanners in \(\mathbb{R}^d\)
- Least squares quantization in PCM
- Local Search Heuristics for k-Median and Facility Location Problems
- On coresets for k-means and k-median clustering
- On the hardness of approximating minimization problems
- Smaller coresets for k-median and k-means clustering
- Temporal clustering
Cited in
(11)- On temporal-constrained sub-trajectory cluster analysis
- Parameterized dynamic cluster editing
- Growing in time IDLA cluster is recurrent
- Seasonal clustering technique for time series data
- Parameterized Dynamic Cluster Editing
- Cluster Editing in Multi-Layer and Temporal Graphs.
- Temporal clustering
- scientific article; zbMATH DE number 7278033 (Why is no real title available?)
- Approximation algorithms for clustering with dynamic points
- No two users are alike: generating audiences with neural clustering for temporal point processes
- Cluster editing for multi-layer and temporal graphs
This page was built for publication: Temporal clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111721)
