Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

295988117 · Jun 202019922001200920172026
48 results for passenger clustering

Proposes a new model for clustering passenger trajectories with graphs.

problem Hierarchical trip structure, inaccurate clustering number, and lack of spatial semantic graphs.
method Tensor Dirichlet Process Multinomial Mixture model with graphs and a tensor version of Collapsed Gibbs Sampling.
result Automatic determination of the number of clusters and better cluster quality.

Proposes a new model for clustering passenger trips considering hierarchical and multi-dimensional data.

problem Clustering passenger trips with hierarchical and multi-dimensional data, especially in large-scale transportation systems.
method Tensor Dirichlet Process Multinomial Mixture (Tensor-DPMM) model, incorporating Dirichlet Process for automatic cluster number determination and tensor representation for multi-mode data.
result Automatic determination of the number of clusters and improved clustering quality.

The vision of automated driving is to increase both road safety and efficiency, while offering passengers a convenient travel experience. This requires that autonomous systems correctly estimate the current traffic scene and its likely evolution. In highway scenarios early recognition of cut-in maneuvers is essential f…

2019-07-25abs ↗pdf ↗

Recently, the online car-hailing service, Didi, has emerged as a leader in the sharing economy. Used by passengers and drivers extensive, it becomes increasingly important for the car-hailing service providers to minimize the waiting time of passengers and optimize the vehicle utilization, thus to improve the overall u…

2018-04-06abs ↗pdf ↗

We consider problems in which a system receives external \emph{perturbations} from time to time. For instance, the system can be a train network in which particular lines are repeatedly disrupted without warning, having an effect on passenger behavior. The goal is to predict changes in the behavior of the system at par…

2019-08-20abs ↗pdf ↗

A sufficient knowledge of the demographics of a commuting public is essential in formulating and implementing more targeted transportation policies, as commuters exhibit different ways of traveling. With the advent of the Automated Fare Collection system (AFC), probing the travel patterns of commuters has become less i…

2015-08-25abs ↗pdf ↗

This research optimizes plate structures to reduce vibrations in vehicles and aircraft.

problem Minimizing structural vibrations in engineering systems for improved passenger comfort.
method Guided flow matching design optimization integrating generative flow matching and surrogate model.
result Generated plate designs with reduced vibrations compared to random search and other methods.

Bayesian framework predicts post-disruption travel times in metro networks.

problem Uncertainty in post-disruption travel times in metro networks.
method Bayesian spatiotemporal modeling framework capturing train interactions and non-Gaussian distributional characteristics.
result The proposed models consistently outperform baseline specifications in point prediction and uncertainty quantification.

Modern vehicle fleets, e.g., for ridesharing platforms and taxi companies, can reduce passengers' waiting times by proactively dispatching vehicles to locations where pickup requests are anticipated in the future. Yet it is unclear how to best do this: optimal dispatching requires optimizing over several sources of unc…

2018-04-13abs ↗pdf ↗

Gaussian processes are rich distributions over functions, which provide a Bayesian nonparametric approach to smoothing and interpolation. We introduce simple closed form kernels that can be used with Gaussian processes to discover patterns and enable extrapolation. These kernels are derived by modelling a spectral dens…

2013-02-18abs ↗pdf ↗

A framework combining HSMM and survival analysis for lifecycle-oriented mobility analysis.

problem Understanding individual metro usage dynamics over multi-year horizons.
method A state-based lifecycle modeling framework integrating HSMM and discrete-time survival analysis.
result Identification of interpretable mobility states, transition dynamics, and state-dependent exit and re-entry processes.

We address the problem of inverse reinforcement learning in Markov decision processes where the agent is risk-sensitive. In particular, we model risk-sensitivity in a reinforcement learning framework by making use of models of human decision-making having their origins in behavioral psychology, behavioral economics, an…

2017-03-29abs ↗pdf ↗

Proposes a compensation mechanism for improving individual forecast confidence.

problem Difficult to assess the quality of individual probabilistic forecasts and their utilities.
method Compensation mechanism based on fair bets and online learning.
result The proposed mechanism cannot be exploited and ensures forecasted utility matches actual utility.

Bayesian method infers transition matrices from incomplete graph data with topological constraints.

problem Inference of transition matrices from incomplete graph data with topological constraints.
method Bayesian approach using repeated interactions and a topological prior.
result Higher accuracy in inferring transition probabilities, improving downstream tasks.

We propose algorithms for approximate filtering and smoothing in high-dimensional Factorial hidden Markov models. The approximation involves discarding, in a principled way, likelihood factors according to a notion of locality in a factor graph associated with the emission distribution. This allows the exponential-in-d…

2019-02-05abs ↗pdf ↗

Model trains passing events on a bridge using multilevel Gaussian process.

problem Represent aggregate train-passing events from a bridge monitoring system.
method Formulate a combined model with low-rank approximation hierarchical Gaussian process, incorporating domain expertise as constraints.
result Allow for simulation of previously unobserved train types.

We consider the problem of learning to behave optimally in a Markov Decision Process when a reward function is not specified, but instead we have access to a set of demonstrators of varying performance. We assume the demonstrators are classified into one of k ranks, and use ideas from ordinal regression to find a rewar…

2019-07-31abs ↗pdf ↗

Enhanced kernel framework for advanced data forecasting.

problem Complex mechanical behaviors and timefrequency dynamics in aircraft systems.
method Frequency-aware surrogate modeling with SMT kernels, extending kernel types and incorporating derivatives.
result Improved accuracy in forecasting CO2 concentrations and airline passenger traffic.

Mode clustering is a nonparametric method for clustering that defines clusters using the basins of attraction of a density estimator's modes. We provide several enhancements to mode clustering: (i) a soft variant of cluster assignment, (ii) a measure of connectivity between clusters, (iii) a technique for choosing the …

2014-06-06abs ↗pdf ↗

Clustering is an essential data mining tool that aims to discover inherent cluster structure in data. For most applications, applying clustering is only appropriate when cluster structure is present. As such, the study of clusterability, which evaluates whether data possesses such structure, is an integral part of clus…

2018-08-24abs ↗pdf ↗

Clustering ensemble, or consensus clustering, has emerged as a powerful tool for improving both the robustness and the stability of results from individual clustering methods. Weighted clustering ensemble arises naturally from clustering ensemble. One of the arguments for weighted clustering ensemble is that elements (…

2019-10-06abs ↗pdf ↗

In many practical applications of clustering, the objects to be clustered evolve over time, and a clustering result is desired at each time step. In such applications, evolutionary clustering typically outperforms traditional static clustering by producing clustering results that reflect long-term trends while being ro…

2011-04-11abs ↗pdf ↗