Point of Interest Calculation based on Prefixspan
碩士 === 淡江大學 === 資訊工程學系碩士班 === 104 === The rapid development and popularity of transport technology encourages people to travel frequently. As many traveling experiences are been shared through the Internet,more people are searching interesting sites from different web sites. Traveling informations i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/54385503119136373380 |
| Summary: | 碩士 === 淡江大學 === 資訊工程學系碩士班 === 104 === The rapid development and popularity of transport technology encourages people to travel frequently.
As many traveling experiences are been shared through the Internet,more people are searching interesting sites from different web sites. Traveling informations including itinerary and accomodations are scattered and it is not easy to grasp relevant information. Especially when people want information regarding to regions where they never been to before, questions such as the most popular attractions, and what are the restaurant most visited are not easy to answer.
In order to answer the above questions, efficient methods in combining and calculating the large amount of traveling informations are needed. This thesis address the issue by comparing different algorithms in calculating point of interest. The result showed prefixspan is more efficient than aprioriall in a modern day Hadoop computation platform.
|
|---|