计算机科学
航程(航空)
约束(计算机辅助设计)
光学(聚焦)
推荐系统
兴趣点
GSM演进的增强数据速率
路径(计算)
图形
相似性(几何)
上下界
数学优化
算法
理论计算机科学
情报检索
数学
人工智能
图像(数学)
计算机网络
几何学
物理
数学分析
光学
复合材料
材料科学
作者
Hongwei Tang,Detian Zhang
标识
DOI:10.1145/3539597.3570434
摘要
In this paper, we focus on a new route recommendation problem, i.e., when a user gives a keyword and range constraint, the route that contains the maximum number of POIs tagged with the keyword or similar POIs in the range will be returned for him. This is a practical problem when people want to explore a place, e.g., find a route within 2 km containing as many clothing stores as possible. To solve the problem, we first calculate the score of each edge in road networks based on the number and similarity of POIs. Then, we reformulate the problem into finding the path in a graph with the maximum score within the distance constraint problem, which is proved NP-hard. Given this, we not only propose an exact branch and bound (BnB) algorithm, but also devise a more efficient top-k based network expansion (k-NE) algorithm to find the near-optimal solution. Extensive experiments on real datasets not only verify the effectiveness of the proposed route recommendation algorithm, but also show that the efficiency and accuracy of k-NE algorithm are completely acceptable.
科研通智能强力驱动
Strongly Powered by AbleSci AI