| 研究生: |
李韻紫 Lee, Yun-Tz |
|---|---|
| 論文名稱: |
以行動社群網絡為基礎且運用雲端運算科技的智慧旅遊推薦系統 ITRS: An Intelligent Touring Recommendation System over the Mobile Social Network Using the Cloud Computing Technique |
| 指導教授: |
黃崇明
Huang, Chung-Ming |
| 學位類別: |
碩士 Master |
| 系所名稱: |
電機資訊學院 - 資訊工程學系 Department of Computer Science and Information Engineering |
| 論文出版年: | 2014 |
| 畢業學年度: | 102 |
| 語文別: | 英文 |
| 論文頁數: | 37 |
| 中文關鍵詞: | 雲端運算 、景點推薦 、分群 、行動社群網路 、點位資訊 |
| 外文關鍵詞: | Cloud Computing, Touring Recommendation, Clustering, Mobile Social Network, Point of Interest |
| 相關次數: | 點閱:107 下載:7 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
現存已有許多旅遊推薦系統有結合行動社群網絡,且為了因應系統內漸增的使用者,系統會透過在雲端上平行運算的特性來改善系統運算時間及效能,但這些系統大多還未能妥善應用在社群網絡中使用者所分享的文字,包括分析社群關係以及使用者的旅遊喜好,並進而提供客製化的景點資訊。除此之外,由於整體的社群關係會僅因為一位使用者更新了旅遊經驗而受到影響,這在系統運算整體社群關係時,即使使用平行運算來節省運算時間,也會造成嚴重的重複運算問題[7] [8]。在此研究中,提出了一個可以根據使用者的旅遊喜好來智慧推薦景點資訊的系統,透過系統中半結構式的使用者介面及知識本體論,可利用使用者上傳的部落格,有效地分析出使用者的旅遊喜好,進而將使用者依旅遊喜好群組化,以此群組來提供客製化的景點資訊。除此之外,此系統還將分群的結果融入雲端運算中來消弭更新分群時所碰到的重複運算問題。在實驗數據中,分析了在不同變數下群組化的趨勢,以及驗證了融合分群到雲端運算中可以有效的提高系統運算速度,卻不影響到分群的群內相似度。
Although many touring recommendation systems work with mobile social network, the delivered posts among users are still not to be utilized well for estimating user’s travel preferences. Besides, with the increasing of users in touring recommendation systems, using the parallel cloud computing can help save executing time and computing resources. However, the processing of estimating user’s travel preferences results in the severe redundancy problem [7][8], because when one user updates his/her travel experiences, the social relationship among all users will be changed synchronously. In this thesis, a cloud-based touring recommendation system with mobile social network, i.e., Intelligent Touring Recommending System (ITRS) is proposed, to recommend users suitable Point of Interests (PoIs) according to users’ travel preferences. Users are classified into meta-groups by analyzing the blogs through the proposed semi-structured user interface and ontology. Besides, the meta-groups mechanism is combined with the cloud computing model to reduce the redundancy problem existed in executing. In the experiment, results demonstrates the trend of classifying meta-groups results. Moreover, the experiment results also have shown the better efficiency of the proposed cloud model, for which the proposed cloud model still keeps the group’s internal similarity as good as the traditional ones.
[1] N. Kayastha, D. Niyato, Ping Wang and E. Hossain, "Applications, Architectures, and Protocol Design Issues for Mobile Social Networks: A Survey," in Proceedings of the IEEE, vol.99, no.12, pp.2130-2158, Dec. 2011.
[2] C.P. Diehl, J. Montemayor and M. Pekala, "Social Relationship Identification: An Example of Social Query," in Proceedings of IEEE International Conference on Computational Science and Engineering (CSE), vol.4, no., pp.381-388, Aug. 2009.
[3] Sameer Pradhan, Kadri Hacioglu, Wayne Ward, J.H. Martin and D. Jurafsky, "Semantic role parsing: adding semantic structure to unstructured text," in Proceedings of 3rd IEEE International Conference on Data Mining (ICDM), pp.629-632, Nov. 2003.
[4] Jiaying Yu, “A General Comparison on Sentences Analysis and Its Teaching Significance between Traditional and Structural Grammars,” in Proceedings of IEEE International Conference on Asian Language Processing (IALP), pp. 81-84, 2010.
[5] Jeffrey Dean and Sanjay Ghemawat, “MapReduce: Simplied Data Processing on Large Clusters,” in Proceedings of the 6th conference on Opearting Systems Design & Implementation, pp. 10-10, December, 2004.
[6] Shin-Gyu Kim, Hyuck Han, Hyungsoo Jung, Hyeonsang Eom and Heon Y. Yeom, “Improving MapReduce Performance by Exploiting Input Redundancy,” Journal of Information Science and Engineering 27, pp. 1137-1152, 2011.
[7] Lars Kolb, Andreas Thor, and Erhard Rahm, “Don’t Match Twice: Redundancy-free Similarity Computation with MapReduce,” in Proceedings of the 2nd Workshop on Data Analytics in the Cloud, pp. 1-5, 2013.
[8] Guojun Liu, Ming Zhang and Fei Yan, “Large-Scale Social Network Analysis Based on MapReduce,” in Proceedings of IEEE International Conference on Computational Aspects of Social Networks (CASoN), pp. 487-490, 2010.
[9] Hai-Guang Li, Gong-Qing Wu, Xue-Gang Hu, Jing Zhang, Lian Li and Xindong Wu, “K-Means Clustering with Bagging and MapReduce,” in Proceedings of IEEE International Conference on Hawaii International Conference on System Sciences (HICSS), pp. 1-8, 2011.
[10] Wuman Luo, Haoyu Tan, Huajian Mao and L.M. Ni, “Efficient Similarity Joins on Massive High-Dimensional Datasets Using MapReduce,” in Proceedings of IEEE International Conference on Mobile Data Management (MDM), pp. 1-10, 2012.
[11] Fang Dong, Junzhou Luo, Xia Zhu, Yuxiang Wang and Jun Shen, “A Personalized Hybrid Recommendation System Oriented to E-Commerce Mass Data in the Cloud,” in Proceedings of IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 1020-1025, 2013.
[12] Li Sa, “Collaborative Filtering Recommendation Algorithm Based on Cloud Model Clustering of Multi-indicators Item Evaluation,” in Proceedings of IEEE International Conference on Business Computing and Global Informatization (BCGIN), pp. 645-648, 2011.
[13] O. Khalid, M. Khan, S. Khan and A. Zomaya, “OmniSuggest: A Ubiquitous Cloud based Context Aware Recommendation System for Mobile Social Networks,” IEEE Transactions on Services Computing, pp, xx-xx, 2013.
[14] Jia-Ching Ying, Eric Hsueh-Chan Lu, Chi-Min Huang, Kuan-Cheng Kuo, Yu-Hsien Hsiao and Vincent S. Tseng, “A framework for cloud-based POI search and trip planning systems,” in Proceedings of IEEE International Conference on Orange Technologies (ICOT), pp. 274-277, 2013.
[15] Feng Zhou, Yong Fang and Hao Chen, “Personalized Travel Service Discovery and Usage in Cloud Environment,” in Proceedings of IEEE International Conference on e-Business Engineering (ICEBE), pp. 333-337, 2012.
[16] Weiwei Cui, Hong Zhou, Huamin Qu, Pak Chung Wong and Xiaoming Li, “Geometry-Based Edge Clustering for Graph Visualization,” IEEE Transactions on Visualization and Computer Graphics (TVCG), pp. 1277-1284, 2008.
[17] A. Kumar, M. Kiran, B.R. Prathap, “Verification and validation of MapReduce program model for parallel K-means algorithm on Hadoop cluster,” in Proceedings of IEEE International Conference on Computing, Communications and Networking Technologies (ICCCNT), pp. 1-8, 2013.
[18] Gongqing Wu, Haiguang Li, Xuegang Hu, Yuanjun Bi, Jing Zhang and Xindong Wu, “MReC4.5: C4.5 Ensemble Classification with MapReduce,” in Proceedings of IEEE International Conference on ChinaGrid Annual Conference, pp. 249-255, 2009.
[19] Kehua Yang, Guoxiong He and Guohui He, “Research and application of MapReduce-based MST text clustering algorithm,” in Proceedings of IEEE International Conference on Information Science and Technology (ICIST), pp. 753-757, 2012.
[20] Yiling Yang, Xudong Guan and Jinyuan You, “CLOPE: A Fast and Effective Clustering Algorithm for Transactional Data,” in Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 682-687, 2002.
[21] N. F. Noy and D. L. McGuinness, “Ontology Development 101: A Guide to Creating Your First Ontology”, Stanford University, NY, USA, Rep. KSL-01-05, 2001.
[22] Joos-Hendrik Böse, Artur Andrzejak and Mikael Högqvist, “Beyond Online Aggregation: Parallel and Incremental Data Mining with Online MapReduce,” in Proceedings of ACM Workshop on Massive Data Analytics over the Cloud (MDAC), 2010.