WEKO3
-
RootNode
アイテム
One-day Trip Recommendation for Nearby Spots Based on Users' Locations and Preferences
https://ipsj.ixsq.nii.ac.jp/records/190080
https://ipsj.ixsq.nii.ac.jp/records/1900803a843f64-44b5-4b84-9c8a-43136b704017
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-DICOMO2017075.pdf (1.1 MB)
|
Copyright (c) 2017 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Symposium(1) | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2017-06-21 | |||||||||||
| タイトル | ||||||||||||
| タイトル | One-day Trip Recommendation for Nearby Spots Based on Users' Locations and Preferences | |||||||||||
| タイトル | ||||||||||||
| 言語 | en | |||||||||||
| タイトル | One-day Trip Recommendation for Nearby Spots Based on Users' Locations and Preferences | |||||||||||
| 言語 | ||||||||||||
| 言語 | eng | |||||||||||
| キーワード | ||||||||||||
| 主題Scheme | Other | |||||||||||
| 主題 | trip recommendation,location,preference | |||||||||||
| 資源タイプ | ||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_5794 | |||||||||||
| 資源タイプ | conference paper | |||||||||||
| 著者所属 | ||||||||||||
| Waseda University | ||||||||||||
| 著者所属 | ||||||||||||
| Waseda University | ||||||||||||
| 著者所属 | ||||||||||||
| Waseda University | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Waseda University | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Waseda University | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Waseda University | ||||||||||||
| 著者名(英) |
Siya, Bao
× Siya, Bao
× Masao, Yanagisawa
× Nozomu, Togawa
|
|||||||||||
| 論文抄録 | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | Over the past decades, advanced digital applications have widely available to users. Some of the applications enhance the possibility of generating personalized trip routes. In this paper, we propose an algorithm of which aim is to plan various trip routes to help users visit different landmarks that could be really interesting and achievable. The algorithm is based on capturing the information of users and landmarks, which determines lists of landmarks worthy of visiting. Experimental results demonstrate the effectiveness of the proposed algorithm. | |||||||||||
| 論文抄録(英) | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | Over the past decades, advanced digital applications have widely available to users. Some of the applications enhance the possibility of generating personalized trip routes. In this paper, we propose an algorithm of which aim is to plan various trip routes to help users visit different landmarks that could be really interesting and achievable. The algorithm is based on capturing the information of users and landmarks, which determines lists of landmarks worthy of visiting. Experimental results demonstrate the effectiveness of the proposed algorithm. | |||||||||||
| 書誌情報 |
マルチメディア，分散協調とモバイルシンポジウム2017論文集 巻 2017, p. 532-537, 発行日 2017-06-21 |
|||||||||||
| 出版者 | ||||||||||||
| 言語 | ja | |||||||||||
| 出版者 | 情報処理学会 | |||||||||||
