17 Hits in 6.5 sec

Top-k Route Search through Submodularity Modeling of Recurrent POI Features

Hongwei Liang, Ke Wang
2018 The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval - SIGIR '18  
We consider a practical top-k route search 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  ...  We model the personalized diversity requirement by the whole class of submodular functions, and present an optimal solution to the top-k route search problem through indices for retrieving relevant POIs  ...  . • We formulate the top-k route problem with the personalized route diversity requirement by a submodular aggregation function Φ h as a query parameter.  ... 
doi:10.1145/3209978.3210038 dblp:conf/sigir/LiangW18 fatcat:ykvbwbekq5chpkd3pprzhhulci

A survey on algorithmic approaches for solving tourist trip design problems

Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou
2014 Journal of Heuristics  
The tourist trip design problem (TTDP) refers to a route-planning problem for tourists interested in visiting multiple points of interest (POIs).  ...  The main objective of the problem discussed is to select POIs that match tourist preferences, thereby maximizing tourist satisfaction, while taking into account a multitude of parameters and constraints  ...  Acknowledgement We sincerely thank the anonymous referees for their constructive comments which considerably contributed to improving the presentation and structure of our article.  ... 
doi:10.1007/s10732-014-9242-5 fatcat:4ibq2qusfnfmxaqz6imoiiwnk4

User recruitment for mobile crowdsensing over opportunistic networks

Merkouris Karaliopoulos, Orestis Telelis, Iordanis Koutsopoulos
2015 2015 IEEE Conference on Computer Communications (INFOCOM)  
We first consider scenarios with deterministic node mobility and formulate the selection of users as a minimumcost set cover problem with a submodular objective function.  ...  Our experimentation with real mobility datasets (a) illustrates the multiple tradeoffs between the campaign cost and duration, the bound on the hopcount of space-time paths, and the number of collection  ...  The mobile users move in different manner so that each user u k visits a subset of PoIs S k ⊆ L, k = 1, 2, . . . , N over time T c .  ... 
doi:10.1109/infocom.2015.7218612 dblp:conf/infocom/KaraliopoulosTK15 fatcat:qvelrujtxjebxjypv2jxr75pve

Efficient itinerary planning with category constraints

Paolo Bolzoni, Sven Helmer, Kevin Wellenzohn, Johann Gamper, Periklis Andritsos
2014 Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - SIGSPATIAL '14  
We develop a group of efficient algorithms based on clustering with guaranteed theoretical bounds.  ...  We develop a group of e cient algorithms based on clustering with guaranteed theoretical bounds.  ...  It includes an ordered se- quence of connected POIs I = Ès, pi 1 , pi 2 , . . . , pi q , dÍ, AE q AE n, such that• the total score of the points, score(I), is maximized; • no more than max k j POIs  ... 
doi:10.1145/2666310.2666411 dblp:conf/gis/BolzoniHWGA14 fatcat:d6snf4uvtnes3ckcvng3hqwrva

A Survey on Trajectory Data Management, Analytics, and Learning [article]

Sheng Wang, Zhifeng Bao, J. Shane Culpepper, Gao Cong
2020 arXiv   pre-print
Finally, we outline the essential qualities that a trajectory data management system should possess in order to maximize flexibility.  ...  Recent advances in sensor and mobile devices have enabled an unprecedented increase in the availability and collection of urban trajectory data, thus increasing the demand for more efficient ways to manage  ...  [75] proposed learning to route with sparse trajectory sets, by constructing a region graph of transfer routing preferences.  ... 
arXiv:2003.11547v2 fatcat:5gf5h5skqjbrhf67cflygggnky

Scanning the Issue

Azim Eskandarian
2021 IEEE transactions on intelligent transportation systems (Print)  
Unlike static obstacles, pedestrians are active agents with complex, interactive motions. Planning AV actions in the presence of pedestrians thus requires modeling of their  ...  Indeed, the grouping of vehicles in platoons with a small inter-vehicle distance can result in numerous advantages, such as energy savings, congestion reduction, and safety improvements.  ...  There are two modules: i) a ground area predication (GAP) branch is appended on top of convolutional feature map of the backbone network, in parallel with existing branches, for region proposal, classification  ... 
doi:10.1109/tits.2021.3113361 fatcat:x2xuoh2qefcdrmqpbwqfttcvhm

Mobile social networks: Design requirements, architecture, and state-of-the-art technology

Zhifei Mao, Yuming Jiang, Geyong Min, Supeng Leng, Xiaolong Jin, Kun Yang
2017 Computer Communications  
In Section 4, we provide a state-of-the-art study for each of the constructing modules of the MSN architecture.  ...  Definition of MSN We consider a mobile social network to be an overlay network, that is, a social network overlaying on top of one or several types of mobile networks. A social 130 190 3.  ...  Authors in [73] first discover user's POIs 780 (points of interest) from GPS trajectories using a k-means clustering algorithm [75] .  ... 
doi:10.1016/j.comcom.2016.11.006 fatcat:qjhxoa2w65dxldeomaeuve7jxi

Survey on the Objectives of Recommender System: Measures, Solutions, Evaluation Methodology, and New Perspectives

Bushra Alhijawi, Arafat Awajan, Salam Fraihat
2022 ACM Computing Surveys  
In addition, the definitions and measures associated with these objectives are reviewed.  ...  Research in the recommender system field has traditionally focused on the accuracy of predictions and the relevance of recommendations.  ...  The probabilistic MF determined the personalized preferences of users. In their method, k-means clustering determined the expert users, and PSO-based clustering enriched users' personalized features.  ... 
doi:10.1145/3527449 fatcat:xc4ibrglpjgqzlgttplmgitedu

Introduction to Multi-Armed Bandits [article]

Aleksandrs Slivkins
2022 arXiv   pre-print
Each chapter tackles a particular line of work, providing a self-contained, teachable technical introduction and a brief review of the further developments; many of the chapters conclude with exercises  ...  The last three chapters cover connections to economics, from learning in repeated games to bandits with supply/budget constraints to exploration in the presence of incentives.  ...  The construction uses only K = T /B distinct bids.  ... 
arXiv:1904.07272v7 fatcat:pptyhyyshrdyhhf7bdonz5dsv4

Efficient itinerary planning with category constraints

Paolo Bolzoni, Periklis Andritsos, Et Al
We develop a group of efficient algorithms based on clustering with guaranteed theoretical bounds.  ...  We develop a group of e cient algorithms based on clustering with guaranteed theoretical bounds.  ...  It includes an ordered se- quence of connected POIs I = Ès, pi 1 , pi 2 , . . . , pi q , dÍ, AE q AE n, such that• the total score of the points, score(I), is maximized; • no more than max k j POIs  ... 
doi:10.5167/uzh-119030 fatcat:cwg6jbbz2bamllu2ntbqfttktq

Harnessing the Power of the General Public for Crowdsourced Business Intelligence: A Survey

Bin Guo, Yan Liu, Yi Ouyang, Vincent W. Zheng, Daqing Zhang, Zhiwen Yu
2019 IEEE Access  
This paper first characterizes the concept model and unique features and presents a generic framework for CrowdBI.  ...  It also investigates novel application areas as well as the key challenges and techniques of CrowdBI. Furthermore, we make discussions about the future research directions of CrowdBI.  ...  A dynamic programming-based recommendation system is proposed to make Top-k recommendations to the shopper for maximizing her value for money, which considers about shopper personality as well as time  ... 
doi:10.1109/access.2019.2901027 fatcat:a5vz6vl7urckpdsreplkvjalea

Recommendation techniques for Web search and social media

Hossein Vahabi
In particularwe study on a number of different recommendation problems: correct tag recommendation, query recommendation, tweet recommendation, and tourist points of interest recommendation.  ...  A recommender system is a tool that identifies highly relevant items of interest for a user. In this thesis we aim to harness the information available through Web to build recommender systems.  ...  Let S i @k be the set of top-k scoring PoIs according to r Ui .  ... 
doi:10.6092/imtlucca/e-theses/86 fatcat:xgzbwm3b5beeheuhgv4jmvyxv4

Distributed control and game design: From strategic agents to programmable machines [article]

Dario Paccagnan
2019 pre-print
In the second part of this thesis, we consider large-scale cooperative problems, where a number of agents need to be allocated to a set of resources with the goal of jointly maximizing a given submodular  ...  This thesis deals with the analysis and coordination of large scale systems without the need of a centralized authority.  ...  This is due to the potential applications of submodular maximization in different fields featuring "large-scale" systems.  ... 
doi:10.3929/ethz-b-000314981 arXiv:1901.06287v1 fatcat:uy6i7kvp4ja2pjnijfhpnmu4jy

Efficient Spatial Query Processing in Urban Environments

Location-based services (LBSs) have entered into people's daily lives with the evolution of telecommunication technologies.  ...  Mainly, we focus on processing such queries in the indoor space motivated by the abundance of applications of indoor LBSs and lack of existing studies supporting indoor spatial queries.  ...  Moreover, they do not take into account any POIs or the distance between them in route construction. Deng et al.  ... 
doi:10.26180/5d3e9820ba0e1 fatcat:pb3ck2zpybdcfhrolrew7crwf4


La Habana
Tourists plan a trip based on their personal preferences and point of interest (POI) information of the destination. It usually is not possible to visit all POIs.  ...  The problem is to select the POIs to visit during the trip and to establish the routes every day.  ... 
« Previous Showing results 1 — 15 out of 17 results