Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Management / 管理學院
  3. Information Management / 資訊管理學系
  4. Tour recommendations by mining photo sharing social media
 
  • Details

Tour recommendations by mining photo sharing social media

Journal
Decision Support Systems
Journal Volume
101
Pages
28-39
Date Issued
2017
Author(s)
Sun C.-Y.
Lee A.J.T.  
DOI
10.1016/j.dss.2017.05.013
URI
https://scholars.lib.ntu.edu.tw/handle/123456789/415107
URL
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85020129581&doi=10.1016%2fj.dss.2017.05.013&partnerID=40&md5=878c0585753f06ae4a083b8ad508067e
Abstract
With the increasing popularity of photo and video sharing social networks, more and more people have shared their photos or videos with their family members and friends. Therefore, in this paper, we propose a framework for recommending top-k tours to meet user's interest and time frame by using user-generated contents in a photo sharing social network. The proposed framework contains four phases. First, we cluster geotagged locations into landmarks, and further cluster these landmarks into areas by the mean-shift clustering method. Second, we employ the Latent Dirichlet Allocation model to categorize the hashtags posted by users into landmark topics, and then use these topics to characterize landmarks and users. Third, to recommend tours for a user, we compute the tendency (or score) of the user visiting each landmark by the landmark popularity, the attraction of landmark to the user, and how many users similar to the user visit the landmark. Finally, based on the scores computed, we develop a method to recommend top-k tours with highest scores for the user. Unlike most previous methods recommending tours landmark by landmark, our framework recommends tours area by area so that users can avoid going back and forth from one area to another and save plenty of time on transportation, which in turn can visit more landmarks. The experiment results show that our proposed method outperforms the Markov-Topic method in terms of average score and precision. Our proposed framework may help users plan their trips and customize a trip for each user. ? 2017 Elsevier B.V.
Subjects
Data mining
Latent Dirichlet Allocation model
Mean-shift clustering method
Photo sharing social network
Tour recommendation
SDGs

[SDGs]SDG11

Type
journal article

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science