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

1234 · Apr 201919922001200920182026
48 results for POI Check-ins

SANST uses self-attentive networks with spatial and temporal embeddings for better POI recommendations.

problem Next point-of-interest (POI) recommendation for users based on their history.
method SANST incorporates spatio-temporal patterns into self-attentive networks.
result SANST outperforms state-of-the-art models by up to 13.65% in nDCG@10.

A model for POI recommendation using relation embedding.

problem Challenges in POI recommendation due to sparse user-POI matrix and varying context.
method Translation-based relation embedding using Knowledge Graph Embedding techniques, combined matrix factorization framework.
result Demonstrates effectiveness of the proposed model on real-world datasets.

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.

PriRec preserves privacy in POI recommendation by keeping data and models on users' devices.

problem Privacy concerns in centralized POI recommendation models.
method Local differential privacy for sensitive data, secure decentralized gradient descent for linear models, secure aggregation for feature interactions.
result PriRec achieves comparable or better recommendation accuracy than FM while protecting user privacy.

Urban2Vec combines street view imagery and POIs for better urban neighborhood embeddings.

problem Lack of comprehensive representation of urban neighborhoods using heterogeneous data.
method Unsupervised multi-modal framework using CNN for visual features and bag-of-words for POI data.
result Urban2Vec achieves better performance than baseline models and comparable to fully-supervised methods.

VisitHGNN predicts visit probabilities between neighborhoods and POIs using graph neural networks.

problem Estimating visit probabilities between neighborhoods and POIs for urban planning.
method Heterogeneous, relation-specific graph neural network (VisitHGNN) trained on mobility data.
result Strong predictive performance with high fidelity to observed travel behavior.

Proposes a CNN-based method for better trajectory owner prediction.

problem Improves trajectory owner prediction for better personalized recommendations and urban planning.
method Connects POIs in a graph, encodes POIs into vectors, transforms trajectories into matrices, and uses a CNN to detect features and predict owners.
result Significantly outperforms existing methods in various metrics.

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 ↗

Task focuses on fact checking in Q&A forums, improving over baseline systems.

problem Fact checking in community Q&A forums to distinguish factual from opinion.
method Two subtasks: distinguishing factual vs. opinion/advice/socializing, predicting answer truthfulness.
result Improved over baseline systems for both subtasks, but not for Subtask B.

In this paper, we investigate the common scenario where every candidate item for recommendation is characterized by a maximum capacity, i.e., number of seats in a Point-of-Interest (POI) or size of an item's inventory. Despite the prevalence of the task of recommending items under capacity constraints in a variety of s…

2017-01-18abs ↗pdf ↗

DETECT clusters mobility behaviors from trajectories using deep learning.

problem Clustering similar mobility behaviors in large, complex trajectory data.
method DETECT uses deep learning to cluster mobility behaviors from trajectories, transforming and summarizing them to identify similar behaviors.
result DETECT effectively clusters mobility behaviors from real-world datasets.

Proposes a model to understand urban dynamics from mega-metropolises.

problem Understanding residents mobility patterns in mega-metropolises.
method Neighbor-Regularized and context-aware Non-negative Tensor Factorization (NR-cNTF).
result NR-cNTF accurately captures city rhythms and spatial communities.

For each k > 0 we find an explicit function f_k such that the topology of S inside the ball B(p,r) is `bounded' by f_k(r) for every complete Riemannian surface (compact or noncompact) with K\geq -k^2, every point p on the surface, and every r. Using this result, we obtain a characterization (simple to check in practica…

2010-09-20abs ↗pdf ↗

Space2Vec learns multi-scale spatial representations from grid cell insights.

problem Encoding spatial features with varying scales from GIS data.
method Proposes Space2Vec, a multi-scale representation learning model using grid cell insights.
result Space2Vec outperforms baselines in predicting POI types and image classification with geo-locations.

Many normal subgroups of mapping class groups are geometric.

problem Characterizing normal subgroups of mapping class groups of surfaces with punctures.
method Proving automorphism and commensurator groups of certain subgroups are isomorphic to the mapping class group, using simplicial complexes.
result Many normal subgroups of mapping class groups are geometric.

PHP connects to ReLU neural networks for scalable Bayesian inference.

problem Scalability and Bayesian inference in two-layer ReLU neural networks.
method PHP with Gaussian prior, decomposition propositions, annealed sequential Monte Carlo.
result PHP provides an alternative scalable representation for two-layer ReLU neural networks.

We argue that the relevant higher gauge group for the non-abelian generalization of the self-dual string equation is the string 2-group. We then derive the corresponding equations of motion and discuss their properties. The underlying geometric picture is a string structure, i.e. a categorified principal bundle with co…

2017-05-05abs ↗pdf ↗

This paper calculates the exact probability distribution of hypervolume improvement for bi-objective problems.

problem Calculating the exact probability distribution of hypervolume improvement in bi-objective problems.
method Cell partition-based method to derive the probability distribution of hypervolume improvement from a bi-variate Gaussian random variable.
result The proposed ε\varepsilon-PoHVI acquisition function outperforms other related functions in Bayesian optimization.

Study tests adequacy of FARIMA models with uncorrelated but non-independent errors.

problem Testing adequacy of FARIMA models with specific error characteristics.
method Derive asymptotic distributions of residual autocovariances and autocorrelations, propose self-normalization approach.
result Asymptotic distributions of modified portmanteau statistics for weak FARIMA models.

Study of embedding spaces using homotopy theory and operads.

problem Understanding the stable homotopy type of embedding spaces.
method Analysis of cubes of framed configuration spaces, homotopy theory of presheaves, operadic structures.
result Induced action of the Poisson operad on the homology of configuration spaces is a homotopy invariant.

A new Gaussian mechanism for differential privacy in the shuffle model is introduced.

problem Improving differential privacy in distributed learning environments.
method Characterization and upper-bounding of Rényi differential privacy (RDP) for the shuffle Gaussian mechanism.
result The shuffle Gaussian mechanism provides improved privacy guarantees compared to existing methods.

AI agents on social networks rarely engage in extended conversations.

problem Understanding the persistence of interactions in AI-agent social networks.
method Analysis of Moltbook, a social network of AI agents, using interaction half-life and spectral tests.
result Most comments on Moltbook receive a direct reply within seconds, indicating a ``fast response or silence'' regime.

An efficient algorithm calculates exact EHVI values for multi-objective optimization problems.

problem Efficient computation of EHVI values for multi-objective optimization problems.
method Partitioning the integration volume into axis-parallel slices and using a new hyperbox decomposition technique.
result Theoretical time complexity improved to Θ(nlogn)Θ(n\log n), asymptotically optimal.

The purpose of this paper is to revisit the Bianchi identities existing for the Riemann and Weyl tensors in the combined framework of the formal theory of systems of partial differential equations (Spencer cohomology, differential systems, formal integrability) and Algebraic Analysis (homological algebra, differential …

2016-03-16abs ↗pdf ↗