中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/11021
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 80990/80990 (100%)
Visitors : 41955718      Online Users : 996
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/11021


    Title: 運用動態分群方法在市場區隔上 -以電信產業為例;Using dynamic clustering method at marketing segmentation-in Telecom industry
    Authors: 廖淑君;Shu-Jiun Liao
    Contributors: 工業管理研究所
    Keywords: 資料採礦;集群分析;電信產業;Single link algorithm
    Date: 2003-06-19
    Issue Date: 2009-09-22 14:12:15 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 受到全球電信事業自由化及國內電信市場在1997年全面開放行動電話通信業務的衝激,市場競爭的型態受到大幅改變。在多家業者加入競爭及消費者對無線通信服務需求熱切下,使得電信產業呈現一片蓬勃景象。然而,隨著行動電話市場的飽和,各家業者均面臨客戶嚴重流失問題。 為了能維持市場佔有率,各業者無不卯足全力,提供各種促銷方案來吸引客戶,然而前提就是要先做好市場區隔,以往在消費者分群的研究上,大多是將有相似消費行為的顧客來作為分群的根據,但顧客的消費行為,常會因為不同時期而有所變動,所以在消費者分群上,也必須常常跟著變動,而以往的作法是每當有消費者的行為改變,就必須將全部的消費者重新分群,不論變動的人數是多是少,因而常會耗費龐大的成本,因此本研究提出一個新的演算法single-link incremental algorithm,能夠視實際變動情況來調整群內變動的資料點,而不用將全部的資料點重新分群,不但能節省龐大的成本,又能藉由正確的分群資訊了解每一群消費者的真正需求,提高顧客對促銷方案的接受度。 Since 1997, the mobile telecom industry in Taiwan has expanded rapidly to a liberalized environment; the mobile telecom market has drastic competition. Nowadays as the mobile telecom market is being saturated, those carrier companies are confronted with high customer churn rate.  For reducing the customer churn rate, every telecom company try to provide many promotional plans. But it is difficult to choose suitable plan for customers who change their purchasing behavior quickly. Sometimes, only few customers changed, but we have to re-cluster the whole customer data. It is costly and inefficient. In this paper, we introduce a new cluster algorithm, called single-link incremental algorithm. It only to adjust data objects for real change situation in intra-cluster which not to re-cluster again for all data objects. Using this new method, single-link incremental algorithm, not only can reduce cost, but also gain the right market segmentation information immediately.
    Appears in Collections:[Graduate Institute of Industrial Management] Electronic Thesis & Dissertation

    Files in This Item:

    File SizeFormat


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明