Zeng, Yifeng, Chen, Xuefeng, Cao, Xin, Qin, Shengchao, Cavazza, Marc ORCID: https://orcid.org/0000-0001-6113-9696 and Xiang, Yanping (2015) Optimal route search with the coverage of users’ preferences. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015). AAAI Press, pp. 2118-2124.

Full text not available from this repository.

Abstract

The preferences of users are important in route search and planning. For example, when a user plans a trip within a city, their preferences can be expressed as keywords shopping mall, restaurant, and museum, with weights 0.5, 0.4, and 0.1, respectively. The resulting route should best satisfy their weighted preferences. In this paper, we take into account the weighted user preferences in route search, and present a keyword coverage problem, which finds an optimal route from a source location to a target location such that the keyword coverage is optimized and that the budget score satisfies a specified constraint. We prove that this problem is NP-hard. To solve this complex problem, we propose an optimal route search based on an A* variant for which we have defined an admissible heuristic function. The experiments conducted on real-world datasets demonstrate both the efficiency and accuracy of our proposed algorithms.

Item Type:	Conference Proceedings
Title of Proceedings:	Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015)
Additional Information:	Conference held at Buenos Aires, Argentina, 25-31 July, 2015.
Uncontrolled Keywords:	Artificial Intelligence
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / School / Research Centre / Research Group:	Faculty of Engineering & Science > School of Computing & Mathematical Sciences (CMS) Faculty of Engineering & Science
Last Modified:	04 Mar 2022 13:07
URI:	http://gala.gre.ac.uk/id/eprint/19798

Actions (login required)

View Item