南華大學機構典藏系統:Item 987654321/21702
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 18278/19583 (93%)
造访人次 : 914835      在线人数 : 769
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://nhuir.nhu.edu.tw/handle/987654321/21702


    题名: 資料挖掘技術在旅遊行銷之應用
    其它题名: The Study of Applying Data Mining Technology into Tourist Marketing
    作者: 鄭丞君
    Cheng, Chen-Chun
    貢獻者: 資訊管理學研究所
    謝昆霖
    Kun-Lin Hsieh
    关键词: 顧客關係管理;類神經網路;休閒旅遊;基因遺傳演算法;自適應性共振理論模式
    Customer Relationship Management;Leisure Tour;Genetic Algorithm;Adaptive Resonance Theory;Artificial Neural Networks
    日期: 2004
    上传时间: 2015-06-17 15:50:30 (UTC+8)
    摘要:   隨著社會經濟的發展,民眾的生活型態有著逐漸的改善,這也使得休閒旅遊已成為民眾重視的生活議題。顧客關係管理(Customer Relationship Management, CRM)是一項近幾年最受重視的研究領域,要如何挖掘潛在顧客與如何快速地開發新顧客通常是飯店業者最積極投入資源進行探討,飯店業者可以根據過去顧客的交易記錄進行有意義的規則或是模型等資料探勘(Data Mining, DM),再根據所挖掘的結果進行最適行銷建議。人工智慧技術(Artificial Intelligence, AI)在近幾年在許多領域(例如:預測、辨識、控制、分類等)都有不錯的應用成效,其中的類神經網路(Artificial Neural Networks, ANNs)方法更是受到多數研究者的青睞,尤其是資料挖掘中的聚類分析(Clustering Analysis),類神經網路也因為它的便利性和簡易性而有不錯的成效,在本論文中亦將引用類神經網路中非監督式的自適應性共振理論模式(Adaptive Resonance Theory, ART)來進行必要的顧客屬性群的聚類分析。此外,我們也設計一個指標與評比程序來找出到底哪些舊顧客屬性群對飯店業者而言是最適合進行資源投資以及行銷開發、並利用舊顧客的屬性區隔資訊來對新顧客提供最適行銷建議。     此外,飯店服務人員可能會被詢問到顧客想去玩的旅遊景點應如何搭車較方便?怎麼進行是最省錢?這些顧客服務就要考慮到前往各個景點移動時間或者移動費用(成本)的最適性問題,本研究將應用基因遺傳演算法(Genetic Algorithm, GA)來規劃出旅遊行程最適解,求出顧客欲前往的各個景點總移動時間最少的最佳路徑、總移動成本最少的最佳路徑、以及總移動時間與總移動成本同時為最少的最佳組合路徑,提供顧客旅遊行程規劃參考,以提升飯店業者在市場的競爭力。         
      As for the social economic rapidly developing, the living style of people in Taiwan had been improved. It will let most people pay more attention to the leisure tour. Recently, customer relationship management (CRM) is a new issue to be addresses for many Hotels or Tourism centers. How to efficiently mine the potential customers or attract the new customers are two primary goals to invest in studying for them. The marketing suggestions can be made by mining the meaningful rules or models from the historical transaction records. Up to now, the performance of using the techniques of artificial intelligence (AI) had presented well for many applications, e.g. prediction, recognition, control, classification and clustering. Among them, the issue of clustering analysis can be done well by using the artificial neural networks (ANNs). Especially, the adaptive resonance theory (ART) in the unsupervised model is the popular one with the characteristics of simplification to be applied into clustering analysis. Hence, we will employ it to implement the necessary clustering analysis in this study. Besides, an evaluated index and a complete evaluation procedure are developed to obtain the related conclusion from the results of DM. That is, the information about the clusters of the potential customers being suitable to invest and that about the corresponding cluster being suitable to develop can be obtained.    Besides, the attendant will be frequently asked about how to travel conveniently by public transits? or how to travel with the less cost? Such cases will focus on the problems of the adaptive tour scheduling with moving time or moving cost limitations. Genetic algorithm (GA) is an approach to address the optimization problem well in most industries. In this thesis, we will apply GA to address such problem. The suggestions of adaptive tour scheduling with the minimum tour’s moving time, minimum tour’s moving cost or simultaneously minimize the tour’s moving time and moving cost can be derived. Not only the customer’s requirement can be achieved, but the necessary market strategies can also be created in the subsequent customer relationship management (CRM). The service competence for hotel can be then promoted.
    显示于类别:[資訊管理學系] 博碩士論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    092NHU05396022-001.pdf1099KbAdobe PDF767检视/开启
    index.html0KbHTML191检视/开启


    在NHUIR中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈