Constructing Top-k Routes with Personalized Submodular Maximization of POI Features

10/10/2017
by   Hongwei Liang, et al.
0

We consider a practical top-k route problem: given a collection of points of interest (POIs) with rated features and traveling costs between POIs, a user wants to find k routes from a source to a destination, that maximally match her needs on feature preferences and can be completed within a travel cost budget. One challenge is dealing with the personalized diversity requirement where each user has a different trade-off between quantity (the number of POIs with a specified feature) and variety (the coverage of specified features). Another challenge is the large scale of the POI network and the great many alternative routes to search. We model the personalized diversity requirement by the whole class of submodular functions, and present an optimal solution to the top-k route problem through an index structure for retrieving relevant POIs in both feature and route spaces and various strategies for pruning the search space using user preferences and constraints. We also present heuristic solutions and evaluate all the solutions on real life POI network data.

READ FULL TEXT

page 3

page 4

page 5

page 6

page 7

page 8

page 9

page 12

research
11/30/2022

Nonmonontone submodular maximization under routing constraints

In machine learning and big data, the optimization objectives based on s...
research
07/19/2019

Empowering A* Search Algorithms with Neural Networks for Personalized Route Recommendation

Personalized Route Recommendation (PRR) aims to generate user-specific r...
research
06/17/2017

Evaluating the quality of tourist agendas customized to different travel styles

Many tourist applications provide a personalized tourist agenda with the...
research
04/15/2019

A Personalized Preference Learning Framework for Caching in Mobile Networks

This paper comprehensively studies a content-centric mobile network base...
research
01/27/2021

Personalization and Recommendation Technologies for MaaS

Over the last few years, MaaS has been extensively studied and evolved i...
research
02/08/2020

A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints

Diversity maximization is a fundamental problem in web search and data m...

Please sign up or login with your details

Forgot password? Click here to reset