Rating Inference for Custom Trips from Enriched GPS Traces using Random Forests

被引:0
|
作者
Chondrogiannis, Theodoros [1 ]
Ge, Mouzhi [2 ]
机构
[1] Univ Konstanz, Constance, Germany
[2] Deggendorf Inst Technol, Deggendorf, Germany
关键词
Trip recommendation; mapping services; random forests;
D O I
10.1145/3615896.3628344
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Trip planning services are employed extensively by users to compute paths between locations for many different use cases, including commuting to work, transportation of goods, and itinerary planning for tourists. In many scenarios, such as planning for a hiking trip, running training, or mountain cycling, it is desirable to provide users with personalized trips according to their preferences. Existing route planning systems for mountain activities recommend user-posted trips, along with ratings w.r.t. the route's difficulty, condition, or enjoyment it provides. However, users often want to define a specific trip by choosing the segments/trails they want to follow. Existing systems do not provide a rating for such trips, thus suffering from the cold-start problem. Also, the efforts to automatically infer such a rating have been limited. In this paper, we study the problem of inferring ratings for custom trips. We propose a machine-learning framework that encodes various rated trip features and employs random forest classifiers to infer ratings. We conduct feature engineering to encode information regarding a) trip location, b) trip elevation profile, c) closeness to points of interest, and d) closeness to locations of geotagged photos. Finally, we present the results of an ablation study on two real-world data sets and five different ratings. We evaluate the efficiency of our proposed approach and the effect each feature has on the rating inference accuracy.
引用
收藏
页码:50 / 57
页数:8
相关论文
共 50 条
  • [21] Anomalous Trajectory Detection from Taxi GPS Traces Using Combination of iBAT and DTW
    Taniarza, Natya
    Akbar, Saiful
    PROCEEDINGS OF THE 2017 6TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING AND INFORMATICS (ICEEI'17), 2017,
  • [22] Towards a consolidation of worldwide journal rankings - A classification using random forests and aggregate rating via data envelopment analysis
    Tueselmann, Heinz
    Sinkovics, Rudolf R.
    Pishchulov, Grigory
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2015, 51 : 11 - 23
  • [23] Automatic Cardiac Segmentation Using Semantic Information from Random Forests
    Dwarikanath Mahapatra
    Journal of Digital Imaging, 2014, 27 : 794 - 804
  • [24] DECODING INDEX FINGER POSITION FROM EEG USING RANDOM FORESTS
    Weichwald, Sebastian
    Meyer, Timm
    Schoelkopf, Bernhard
    Ball, Tonio
    Grosse-Wentrup, Moritz
    2014 4TH INTERNATIONAL WORKSHOP ON COGNITIVE INFORMATION PROCESSING (CIP), 2014,
  • [25] Automatic Cardiac Segmentation Using Semantic Information from Random Forests
    Mahapatra, Dwarikanath
    JOURNAL OF DIGITAL IMAGING, 2014, 27 (06) : 794 - 804
  • [26] Enhanced engraftment of a cell enriched matrix derived from lipoaspirate using a custom processing system with extrusion
    Friddle, C.
    Bruno, R.
    Husfeld
    Coleman, M.
    JOURNAL OF TISSUE ENGINEERING AND REGENERATIVE MEDICINE, 2012, 6 : 268 - 268
  • [27] Building pathway clusters from Random Forests classification using class votes
    Herbert Pang
    Hongyu Zhao
    BMC Bioinformatics, 9
  • [28] Extracting urban landmarks from geographical datasets using a random forests classifier
    Lin, Yue
    Cai, Yuyang
    Gong, Yue
    Kang, Mengjun
    Li, Lin
    INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2019, 33 (12) : 2406 - 2423
  • [29] PREDICTING MODIS EVI FROM SAR PARAMETERS USING RANDOM FORESTS ALGORITHMS
    Haupt, Shelley
    Engelbrecht, Jeanine
    Kemp, Jaco
    2017 IEEE INTERNATIONAL GEOSCIENCE AND REMOTE SENSING SYMPOSIUM (IGARSS), 2017, : 4382 - 4385
  • [30] Building pathway clusters from Random Forests classification using class votes
    Pang, Herbert
    Zhao, Hongyu
    BMC BIOINFORMATICS, 2008, 9 (1)