# PathRank: A Multi-Task Learning Framework to Rank Paths in Spatial Networks

arXiv: https://arxiv.org/abs/1907.04028 · HTML: https://mlsanity.com/paper/1907.04028/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 9 Jul 2019.

## Built on by (most cited first, 5 of 5)

- [Learn-n-Route: Learning implicit preferences for vehicle routing](https://mlsanity.com/paper/2101.03936/) (2021)
- [REFINE: Trajectory Representation Learning via Closed-Loop Transcription -- Extended Version](https://mlsanity.com/paper/2609.07206/) (2026)
- [DGCPath: Distribution-Aware Generative Contrastive Framework for Self-supervised Path Representation Learning -- Extended Version](https://mlsanity.com/paper/2609.07316/) (2026)
- [TraveL: Transformer-based Multi-view Path Distributional Representation Learning](https://mlsanity.com/paper/2609.03427/) (2026)
- [When Correlations Mislead: Confounder-Aware Multi-View Urban Region Representation Learning](https://mlsanity.com/paper/2609.15305/) (2026)

## Abstract (arXiv)

Modern navigation services often provide multiple paths connecting the same source and destination for users to select. Hence, ranking such paths becomes increasingly important, which directly affects the service quality. We present PathRank, a data-driven framework for ranking paths based on historical trajectories using multi-task learning. If a trajectory used path P from source s to destination d, PathRank considers this as an evidence that P is preferred over all other paths from s to d. Thus, a path that is similar to P should have a larger ranking score than a path that is dissimilar to P. Based on this intuition, PathRank models path ranking as a regression problem, where each path is associated with a ranking score. To enable PathRank, we first propose an effective method to generate a compact set of training data: for each trajectory, we generate a small set of diversified paths. Next, we propose a multi-task learning framework to solve the regression problem. In particular, a spatial network embedding is proposed to embed each vertex to a feature vector by considering both road network topology and spatial properties, such as distances and travel times. Since a path is represented by a sequence of vertices, which is now a sequence of feature vectors after embedding, recurrent neural network is applied to model the sequence. The objective function is designed to consider errors on both ranking scores and spatial properties, making the framework a multi-task learning framework. Empirical studies on a substantial trajectory data set offer insight into the designed properties of the proposed framework and indicating that it is effective and practical.