Building a validation measure for activity-based transportation models based on mobile phone data
F Liu, D Janssens, JX Cui, YP Wang, G Wets… - Expert Systems with …, 2014 - Elsevier
Activity-based micro-simulation transportation models typically predict 24-h activity-travel
sequences for each individual in a study area. These sequences serve as a key input for …
sequences for each individual in a study area. These sequences serve as a key input for …
Characterizing activity sequences using profile Hidden Markov Models
In literature, activity sequences, generated from activity-travel diaries, have been analyzed
and classified into clusters based on the composition and ordering of the activities using …
and classified into clusters based on the composition and ordering of the activities using …
A bag-of-paths framework for network data analysis
This work develops a generic framework, called the bag-of-paths (BoP), for link and network
data analysis. The central idea is to assign a probability distribution on the set of all paths in …
data analysis. The central idea is to assign a probability distribution on the set of all paths in …
Graph-based point drift: Graph centrality on the registration of point-sets
S De Sousa, WG Kropatsch - Pattern Recognition, 2015 - Elsevier
The problem of point-set registration often arises in Pattern Recognition whenever one
needs to match information available in images, such as feature locations, landmarks, or …
needs to match information available in images, such as feature locations, landmarks, or …
Randomized shortest paths with net flows and capacity constraints
This work extends the randomized shortest paths (RSP) model by investigating the net flow
RSP and adding capacity constraints on edge flows. The standard RSP is a model of …
RSP and adding capacity constraints on edge flows. The standard RSP is a model of …
Sparse randomized shortest paths routing with Tsallis divergence regularization
This work elaborates on the important problem of (1) designing optimal randomized routing
policies for reaching a target node t from a source note s on a weighted directed graph G …
policies for reaching a target node t from a source note s on a weighted directed graph G …
A new iterative algorithm for computing a quality approximate median of strings based on edit operations
J Abreu, JR Rico-Juan - Pattern Recognition Letters, 2014 - Elsevier
This paper presents a new algorithm that can be used to compute an approximation to the
median of a set of strings. The approximate median is obtained through the successive …
median of a set of strings. The approximate median is obtained through the successive …
Relative entropy-regularized optimal transport on a graph: a new algorithm and an experimental comparison
The present work investigates a new relative entropy-regularized algorithm for solving the
optimal transport on a graph problem within the randomized shortest paths formalism. More …
optimal transport on a graph problem within the randomized shortest paths formalism. More …
Assessing the best edit in perturbation-based iterative refinement algorithms to compute the median string
Different pattern recognition techniques such as clustering, k-nearest neighbors
classification or instance reduction algorithms require prototypes to represent pattern …
classification or instance reduction algorithms require prototypes to represent pattern …
Design of biased random walks on a graph with application to collaborative recommendation
This work investigates a paths-based statistical physics formalism, inspired from the bag-of-
paths framework, for the design of random walks on a graph in which the transition …
paths framework, for the design of random walks on a graph in which the transition …