A Hierarchical Optimizer for Recommendation System Based on Shortest Path Algorithm

11/07/2019
by   Jiacheng Dai, et al.
0

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.

READ FULL TEXT

page 1

page 2

research
02/24/2022

The Shortest Path with Increasing Chords in a Simple Polygon

We study the problem of finding the shortest path with increasing chords...
research
07/08/2021

Computational Benefits of Intermediate Rewards for Hierarchical Planning

Many hierarchical reinforcement learning (RL) applications have empirica...
research
08/09/2022

A Novel Faster All-Pair Shortest Path Algorithm Based on the Matrix Multiplication for GPUs

The shortest path problem is a class of typical problems in graph theory...
research
11/13/2021

On Nash-solvability of finite n-person shortest path games; bi-shortest path conjecture

We formulate a conjecture from graph theory that is equivalent to Nash-s...
research
06/01/2023

Image generation with shortest path diffusion

The field of image generation has made significant progress thanks to th...
research
06/14/2016

Relating Strong Spatial Cognition to Symbolic Problem Solving --- An Example

In this note, we discuss and analyse a shortest path finding approach us...
research
08/09/2018

A Constrained Shortest Path Scheme for Virtual Network Service Management

Virtual network services that span multiple data centers are important t...

Please sign up or login with your details

Forgot password? Click here to reset