3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
These leaderboards are used to track progress in trajectory-clustering-31
No benchmarks available.
Use these libraries to find trajectory-clustering-31 models and implementations
No subtasks available.
A new distance is introduced : Symmetrized Segment-Path Distance (SSPD) and is compared to the others according to their corresponding clustering results obtained using both hierarchical clustering and affinity propagation methods.
This paper proposes to adapt two top performing objectives in this class - instance recognition and local aggregation, to the video domain, and forms clusters in the IDT space, using heuristic-based IDT descriptors as a an unsupervised prior in the iterative local aggregation algorithm.
This work presents a novel, data-driven, network-based Trajectory Clustering (TC) algorithm for identifying Parkinson’s subtypes based on disease trajectory, which can effectively assist in targeted subtype-specific treatment in the field of personalized medicine.
A comprehensive comparison of similarity measures, clustering algorithms and evaluation measures using trajectory data from seven intersections is performed and a method to automatically generate trajectory reference clusters based on their origin and destination points is proposed to be used for label-based evaluation measures.
Adding a benchmark result helps the community track progress.