A Hierarchical Optimizer for Recommendation System Based on Shortest Path Algorithm
Top-k Nearest Geosocial Keyword (T-kNGK) query on geosocial network is defined to give users k recommendations based on some keywords and designated spatial range, and can be realized by shortest path algorithms. However, shortest path algorithm cannot provide convincing recommendations, so we design a hierarchical optimizer consisting of classifiers and a constant optimizer to optimize the result by some features of the service providers.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Graph Neural Networks for Travel Distance Estimation and Route Recommendation Under Probabilistic Hazards
Estimating the shortest travel time and providing route recommendation between different locations in a city or region can quantitatively measure the conditions of the transportation network during or after extreme event…
Computational EfficiencyStructuring the Environment Nudges Participants Toward Hierarchical Over Shortest Path Planning
Effective planning is crucial for navigating complex environments and achieving goals efficiently. In this study, we investigated how environmental structure influences the selection of planning strategies. Forty-two par…
Decision MakingLearning with Differentiable Pertubed Optimizers
Machine learning pipelines often rely on optimizers procedures to make discrete decisions (e.g., sorting, picking closest neighbors, or shortest paths). Although these discrete decisions are easily computed in a forward …
Structured PredictionConstraint-Aware Route Recommendation from Natural Language via Hierarchical LLM Agents
Route recommendation aims to provide users with optimal travel plans that satisfy diverse and complex requirements. Classical routing algorithms (e.g., shortest-path and constraint-aware search) are efficient but assume …
Spatial ReasoningLearning with Differentiable Perturbed Optimizers
Machine learning pipelines often rely on optimization procedures to make discrete decisions (e.g., sorting, picking closest neighbors, or shortest paths). Although these discrete decisions are easily computed, they break…
Structured Prediction