English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69561/69561 (100%)
Visitors : 23136094      Online Users : 860
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/64840


    Title: 使用凝聚型階層式分群法對流成行資料分群;Agglomerative Hierarchical clustering with the string data
    Authors: 廖秋閔;Liao,Chiu-Min
    Contributors: 工業管理研究所
    Keywords: 資料採礦;群集分析;相似度測量;字串型資料;凝聚型階層式分群;Data mining;Cluster analysis;Similarity Measure;String data;Agglomerative clustering
    Date: 2014-07-02
    Issue Date: 2014-10-15 14:29:46 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 由於科技的進步,使得資料量快速地成長。而資料採礦(Data mining)是可有效幫助我們組織成千上萬資料的方法,讓管理者可以從資料中得到相關資訊,做出適當的決策。其中群集分析為資料採礦中常使用的方法之一,而分群的依據來自於資料的特徵。在群集分析中較常使用的資料型態為類別型資料(Qualitative data)與數值型資料(Quantitative data),而流程型資料或字串型資料在過去較少被大家所討論,因此在本研究中,我們將針對流程型資料(字串型資料)提出可行的分群方法。
    關於相似度的衡量方法,我們採用以下兩種方法,分別為Jaro similarity與Edit distance,其中距離愈大表示相似度愈小,且根據所定義的相似度或距離,我們可列出相似度矩陣,並利用相似度來對資料做分群。而在本研究中,我們採用凝聚型階層式分群方法來做分群,其中包含最短距離法、最長距離法和平均距離法等方法。在凝聚型階層式分群方法中,一開始每筆資料為各自一群,將最相似的群體逐一合併後,最終全部資料將會屬於同一群體。階層式分群方法的優點為可自己決定分群的群數,且透過階層分群圖可清楚明瞭分群的步驟。
    本研究所探討的個案資料,資料型態皆為流程型資料(字串型資料),共使用了三個例子,其中兩個例子為標竿資料,廣泛被許多學者使用;另外一個例子來自於發動機在執行翻修工作時,所產生的待維修零件,因為不同的維修零件所經過的維修站不同,所以各自會有不同的維修流程。本研究中主要在解決流程型資料(字串型資料)間的相似度問題,使我們可以針對資料相似度做分群,讓管理者可以根據分群結果安排適當的維修工作或做其它決策。;Due to the progressing of the science and technology, the data is growing rapidly. Data mining help us to organize the thousands of data efficiently and the managers can obviously find out the information that they do not know before and make appropriate decisions. Cluster analysis is one of the methods that are widely used in data mining according to the features of the data. Most of data applied to cluster analysis are qualitative and quantitative and the string data (flow data) is seldom discussed in cluster analysis. Therefore in this research, we try to propose some possible clustering methods to handle the string data.
    About the similarity measure, we adopt two measurements as follows. One is Jaro similarity and the other is Edit distance. The larger the value of distance is, the smaller the value of similarity will be. According to the similarity or distance that we define, we can obtain the similarity matrix. Hence, clustering the data is based on this matrix. In our study, we consider the agglomerative hierarchical clustering such as single linkage, complete linkage and average linkage to group string data. In the initial of agglomerative clustering, each string data is in its own cluster. It means that every cluster includes exactly one string. Then the most similar strings are grouped. After a series of merge operations, finally lead all strings to the same cluster. The advantage of hierarchical clustering algorithm is that we can decide the number of groups which we want to divide and we can obviously know the clustering steps through the hierarchical tree.
    We use three examples to present our methodology. The data type in our research is string data. Two benchmark examples and an engine parts dataset. Because different parts are passing different repair workstations, every part has its own repair procedure. Our study is focusing on dealing with the problem about counting similarity between strings. We want to cluster the string data and the clustering result can help the workstations work efficiently.
    Appears in Collections:[工業管理研究所 ] 博碩士論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML368View/Open


    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 ©   - Feedback  - 隱私權政策聲明