Developing a Location-Item-Time Sequential Pattern Mining algorithm for Personalized Route Recommendation Service
碩士 === 元智大學 === 工業工程與管理學系 === 100 === Recently, amusement parks are now facing strict challenges from other business competition. How to survive in a rapidly changing environment and provide a high quality service in terms of consumer preference has become a critical issue for amusement park manager...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Online Access: | http://ndltd.ncl.edu.tw/handle/44942383141046309669 |
id |
ndltd-TW-100YZU05031096 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-100YZU050310962015-10-13T21:33:10Z http://ndltd.ncl.edu.tw/handle/44942383141046309669 Developing a Location-Item-Time Sequential Pattern Mining algorithm for Personalized Route Recommendation Service 發展一個LIT序列探勘方法於客製化路徑推薦系統 Bo-Han Lai 賴柏翰 碩士 元智大學 工業工程與管理學系 100 Recently, amusement parks are now facing strict challenges from other business competition. How to survive in a rapidly changing environment and provide a high quality service in terms of consumer preference has become a critical issue for amusement park managers. To satisfy the requirement, this research proposes a personalized route recommendation system that provides tourists with the facilities in which theme they should visit. In the proposed system, to detect which region a visitor is in, all regions are covered by Radio-Frequency Identification (RFID) readers. The tourist behaviors (i.e. visiting sequences and corresponding timestamps) will be collected until the tourist leaves the amusement park and stored in a route database. The proposed route recommendation system consists of two major stages. The first step is to preprocess the route sequences so that unreasonable routes are modified and corrected. After the preprocessing the route database, the second step is to discover the frequent Location-Item-Time (LIT) sequential patterns using the proposed Location-Item-Time PrefixSpan (LIT-PrefixSpan) mining procedure. In the second stage, the route suggestion procedure will filter the LIT sequential patterns under the constraints of intended-visiting time, favorite regions with its related visiting time, and favorite recreation facilities. In addition, this research develops the similarity measurement between the new user’s input vector and the candidate LIT routes from the user point of view. Finally, the route recommendation system will select the top-three suggested routes to guide the visitors. To show the feasibility of the proposed route recommendation system, the Tokyo DisneySea in Japan is used as an example. The experiments for different parameters and user preference settings are conducted to demonstrate the quality of route recommendation. Based on the experimental results, it is clear that the recommended route satisfies visitor requirement based on previous visiting experiences of tourists. Chieh-YuanTsai 蔡介元 學位論文 ; thesis 110 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 元智大學 === 工業工程與管理學系 === 100 === Recently, amusement parks are now facing strict challenges from other business competition. How to survive in a rapidly changing environment and provide a high quality service in terms of consumer preference has become a critical issue for amusement park managers. To satisfy the requirement, this research proposes a personalized route recommendation system that provides tourists with the facilities in which theme they should visit. In the proposed system, to detect which region a visitor is in, all regions are covered by Radio-Frequency Identification (RFID) readers. The tourist behaviors (i.e. visiting sequences and corresponding timestamps) will be collected until the tourist leaves the amusement park and stored in a route database. The proposed route recommendation system consists of two major stages. The first step is to preprocess the route sequences so that unreasonable routes are modified and corrected. After the preprocessing the route database, the second step is to discover the frequent Location-Item-Time (LIT) sequential patterns using the proposed Location-Item-Time PrefixSpan (LIT-PrefixSpan) mining procedure. In the second stage, the route suggestion procedure will filter the LIT sequential patterns under the constraints of intended-visiting time, favorite regions with its related visiting time, and favorite recreation facilities. In addition, this research develops the similarity measurement between the new user’s input vector and the candidate LIT routes from the user point of view. Finally, the route recommendation system will select the top-three suggested routes to guide the visitors. To show the feasibility of the proposed route recommendation system, the Tokyo DisneySea in Japan is used as an example. The experiments for different parameters and user preference settings are conducted to demonstrate the quality of route recommendation. Based on the experimental results, it is clear that the recommended route satisfies visitor requirement based on previous visiting experiences of tourists.
|
author2 |
Chieh-YuanTsai |
author_facet |
Chieh-YuanTsai Bo-Han Lai 賴柏翰 |
author |
Bo-Han Lai 賴柏翰 |
spellingShingle |
Bo-Han Lai 賴柏翰 Developing a Location-Item-Time Sequential Pattern Mining algorithm for Personalized Route Recommendation Service |
author_sort |
Bo-Han Lai |
title |
Developing a Location-Item-Time Sequential Pattern Mining algorithm for Personalized Route Recommendation Service |
title_short |
Developing a Location-Item-Time Sequential Pattern Mining algorithm for Personalized Route Recommendation Service |
title_full |
Developing a Location-Item-Time Sequential Pattern Mining algorithm for Personalized Route Recommendation Service |
title_fullStr |
Developing a Location-Item-Time Sequential Pattern Mining algorithm for Personalized Route Recommendation Service |
title_full_unstemmed |
Developing a Location-Item-Time Sequential Pattern Mining algorithm for Personalized Route Recommendation Service |
title_sort |
developing a location-item-time sequential pattern mining algorithm for personalized route recommendation service |
url |
http://ndltd.ncl.edu.tw/handle/44942383141046309669 |
work_keys_str_mv |
AT bohanlai developingalocationitemtimesequentialpatternminingalgorithmforpersonalizedrouterecommendationservice AT làibǎihàn developingalocationitemtimesequentialpatternminingalgorithmforpersonalizedrouterecommendationservice AT bohanlai fāzhǎnyīgèlitxùliètànkānfāngfǎyúkèzhìhuàlùjìngtuījiànxìtǒng AT làibǎihàn fāzhǎnyīgèlitxùliètànkānfāngfǎyúkèzhìhuàlùjìngtuījiànxìtǒng |
_version_ |
1718066169753108480 |