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.

169,051 papers · 148 categories

Trend · papers per month

18365371 · Jun 202019922001200920182026
48 results for trip recommendation

Proposes a joint POI embedding model for better trip recommendations.

problem Trip recommendation needs to consider multiple contextual factors for better user satisfaction.
method Jointly learns the impact of POI popularity, co-occurring POIs, and user preferences.
result Proposed algorithms outperform state-of-the-art in trip recommendation quality.

New system assigns vehicles to routes for cost and energy efficiency.

problem Optimizing vehicle route assignment for cost and energy efficiency.
method Machine learning-based neural network algorithm to estimate energy consumption and provide real-time recommendations.
result Demonstrated efficient vehicle assignment for medium and heavy duty trucks.

Deep learning improves trip prediction accuracy in transportation planning.

problem Traditional models fail to accurately predict person and vehicle trips due to complexity and dynamics.
method Developed and trained a deep learning model using NHTS data.
result Deep learning model achieved 98% accuracy for person trip prediction and 96% for vehicle trip estimation.

Optimizes taxi carpool policies using RL and spatio-temporal data.

problem Reduce car usage and minimize traffic congestion through efficient carpooling.
method Developed a deep neural network (ST-NN) for trip time prediction and a carpooling RL simulation environment.
result RL learned policy outperformed a fixed policy in maximizing efficiency and minimizing congestion.

Study shows how wealth distribution leads to volatility clustering in speculative markets.

problem Volatility clustering in financial markets.
method Agent-based model of financial markets with heterogeneous wealth distribution and round-trip trading.
result Heterogeneous wealth distribution induces volatility clustering through market wealth redistribution.

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 paper applies thermodynamics to financial markets to prove no-arbitrage constraints.

problem No arbitrage in financial markets under price impact.
method Stochastic thermodynamics applied to financial trading cycles.
result Proves any round-trip trading strategy yields non-positive expected profit.

Study analyzes how discounts affect train ticket purchases and rescheduling in Switzerland.

problem Understanding how discounts influence train ticket buying and rescheduling behavior.
method Machine learning techniques, including causal machine learning, to analyze survey data.
result Increasing a discount rate by 1% increases the rescheduled trip share by 0.16% among always buyers.

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.

Enhanced travel time prediction using deep neural networks and road network information.

problem Improving travel time estimation using deep learning models.
method Proposes incorporating road network information into deep learning models for travel time prediction.
result Improved travel time prediction, especially with limited training data.

Paper proposes a risk index combining frequency and severity of abnormal driving patterns.

problem Assessing driver risk based on telematics data.
method Combines frequency of abnormal driving patterns with severity quantified through tail rarity.
result Developed a risk index that enables reliable discrimination and ranking of drivers.

TRIP detects unreliable feature importance scores in random forests.

problem Unreliable feature importance scores in random forests due to model extrapolation.
method Develops TRIP (Test for Reliable Interpretation via Permutation) to detect unreliable permutation feature importance scores.
result TRIP reliably detects unreliable permutation feature importance scores in high-dimensional settings.

Automated scoring prioritizes risky driving behavior in telematic auto insurance policies.

problem Identifying risky driving behavior in telematic auto insurance policies using machine learning.
method Bayesian approach using MCMC to model propensity of policyholders to undertake trips resulting in positive classification.
result The approach improves efficiency of human resource allocation in identifying risky driving behavior.

Reliable uncertainty estimation for time series prediction is critical in many fields, including physics, biology, and manufacturing. At Uber, probabilistic time series forecasting is used for robust prediction of number of trips during special events, driver incentive allocation, as well as real-time anomaly detection…

2017-09-06abs ↗pdf ↗

Study estimates and predicts dynamic traffic OD flows for improved DTA models.

problem Estimating and predicting time-varying OD trip tables for dynamic traffic assignment.
method Bi-level optimisation for OD flow estimation and time series prediction for OD demand.
result High capability of proposed OD demand estimation method to reduce DTA model error.

If the group of a 2-knot group KK has an abelian normal subgroup of rank 1\geq1 which is not finitely generated then either KK has no minimal Seifert hypersurface or KK is topologically equivalent to Example 10 of Ralph Fox's``{\it A quick trip through knot theory}".

2018-07-01abs ↗pdf ↗

STAD improves travel time estimation by learning from real traffic data.

problem Travel time estimation using GPS traces is inaccurate and requires offline optimization.
method STAD uses machine learning and real-time trip data to adjust travel time estimates.
result STAD reduces median absolute errors by 14% in Doha and New York City, and 29% in Porto.

In this paper we propose a new method to predict the final destination of vehicle trips based on their initial partial trajectories. We first review how we obtained clustering of trajectories that describes user behaviour. Then, we explain how we model main traffic flow patterns by a mixture of 2d Gaussian distribution…

2016-05-10abs ↗pdf ↗

Study improves dynamic PT fleet optimization under noisy demand predictions.

problem Accurately predicting dynamic public transport demand for effective fleet management.
method Experimental case study in Copenhagen, using linear programming to optimize fleets.
result Optimized fleet performance is mainly affected by noise distribution skew and large errors.

A new neural approach for generating origin-destination matrices in ABMs.

problem Challenges in generating origin-destination matrices for ABMs, including discretisation errors and inability to explore multimodal distributions.
method A computationally efficient framework that learns trip intensity through a neural differential equation, operating directly on the discrete combinatorial space.
result Outperforms prior art in terms of reconstruction error and ground truth matrix coverage, at a fraction of the computational cost.

The paper predicts travel times using tree-based ensembles.

problem Predicting travel times between urban points over short and long horizons.
method Tree-based ensemble methods trained on taxi trip records with additional features from weather and routing data.
result Adding routing data improves model performance and short-term predictions require less data.

Study develops a new model for predicting individual mobility based on activity patterns.

problem Existing mobility prediction methods overlook underlying activity patterns.
method Activity-based hidden Markov model (IOHMM) using transit smart card data.
result Proposed model achieves similar prediction performance to LSTM but also provides behavioral insights.

Bayesian model predicts public transport usage during events.

problem Difficulty in predicting transportation disruptions during special events.
method Bayesian additive model with Gaussian process components, using smart card records and web data.
result Model outperforms baselines by up to 26% in R2 and explains individual event components.

Deviation-based learning improves recommender systems by abstaining from recommending choices users might follow.

problem Recommender systems learn from user choices but can stall if users blindly follow recommendations.
method The recommender learns user knowledge by observing choices, abstaining from recommending a choice when multiple alternatives produce similar payoffs.
result Learning rate and social welfare improve when the recommender abstains from recommending certain choices.

Study uses vehicle trajectory data to predict traffic incidents on highways.

problem Early detection of traffic incidents to reduce secondary crashes.
method Machine learning algorithms (Logistic Regression, Random Forest, Extreme Gradient Boost, Artificial Neural Network) applied to vehicle trajectory data.
result Random Forest model performs best for incident prediction.

CAFL breaks feedback loops in recommender systems using causal inference.

problem Feedback loops in recommender systems compromise recommendation quality and homogenize user behavior.
method Causal Adjustment for Feedback Loops (CAFL) algorithm that breaks feedback loops using causal inference.
result CAFL improves recommendation quality compared to prior correction methods.

Proposes a new model for diversified interactive recommendation.

problem Previous methods focus on optimizing recommendation accuracy, ignoring diversity.
method DC2^2B model using determinantal point process and Thompson sampling-based variational Bayesian inference.
result Demonstrates effectiveness of the proposed method through extensive experiments.

Poisoning attacks improve graph-based recommender system recommendations.

problem Designing effective poisoning attacks for graph-based recommender systems.
method Formulated as an optimization problem, solved with techniques to assign rating scores to fake users.
result Outperforms existing attacks for graph-based recommender systems, recommending target items to 580 times more normal users.

Paper introduces a new job recommendation method using candidate job selection progression.

problem Traditional job recommendation methods are either filter-based or feature-based, limiting serendipitous and cold-start recommendations.
method Uses machine learning to analyze candidate job selection progression and derive latent competencies.
result Achieved best click-through rate in a real-world job recommender system.