Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Engineering / 工學院
  3. Industrial Engineering / 工業工程學研究所
  4. A Wrap-arounded Self-Organizing Map Associated with a 2-Mean Method Based Automation Classification Mechanism
 
  • Details

A Wrap-arounded Self-Organizing Map Associated with a 2-Mean Method Based Automation Classification Mechanism

Date Issued
2004
Date
2004
Author(s)
Sung, Te-Chin
DOI
zh-TW
URI
http://ntur.lib.ntu.edu.tw//handle/246246/51160
Abstract
本研究開發超環面拓樸結構的自組織映射網路的物件分群技術,且提示一自動分析物件間鄰近程度且切斷網路拓樸的鏈結關係以產生子群的自動分群機制。該自動劃分群集演算法以拓樸映射和自動劃分群集兩階段的演算求解求解物件有屬性且無物件間互斥限制及群落的物件分群問題。第一階段的拓樸結構有:平面拓樸結構及超環面拓樸結構。第二階段的求算節線斷開門檻值演算法有:平面拓樸結構為基求算節線斷開門檻值演算法及超環面拓樸結構為基求算節線斷開門檻值演算法。上述兩種演算法各包含三種求算節線斷開門檻值演算法,分別是:網圖為基節線斷開演算法、最小間距樹為基節線斷開演算法、及完全網圖為基節線斷開演算法。並以三維空間中兩個彼此不相交環的範例資料進行自動劃分群集演算法演算。分析演算求解的分群結果推知,以超環面拓樸結構的自組織映射網路結合2–Mean方法為基的自動劃分群集演算法進行求解的分群結果是正確的,且具有自動決定節線斷開門檻值及不需事先設定群數的優點。因此,以本研究提示的自動劃分群集演算法可自動展示分群結果。
This thesis presents a wrap-around Self-Organizing Map associated with an automatic classification mechanism for data clustering. The proposed data clustering method consists of two procedures. At first data are mapped onto topologically structured neural neurons, represented as either a traditional SOM or the proposed wrap-around SOM. Then, in the second stage, the topology of the structured neural neurons and associated characteristic vectors are used by an automation classification algorithm to divide the linked neurons into sub-graphs. These sub-graphs are then the results of data clustering. The classification algorithm uses 2-mean techniques to automatically find the threshold for link cutting between connected neurons. Three topology models are investigated and studied, including the original 2-D topology, a reduced spanning tree for the original topology, and a regenerated complete graph from all neurons. Several numerical examples are tested, including an example with data distributed as chained two rings. Results show that only the proposed wrap-around SOM associated with the 2-mean method based classification mechanism can produce a correct data clustering result. The main advantages of using the proposed method are that the number of groups of the clustered data is automatically determined and only wrap-around topology can deal with problems of mutual inclusive data distribution.
Subjects
物件分群
自組織映射網路
超環面拓樸結構的自組織映射網路
自動劃分群集演算法
automation classification mechanism
Wrap-arounded SOM
Self-Organizing Map
object grouping
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-93-R89546010-1.pdf

Size

23.53 KB

Format

Adobe PDF

Checksum

(MD5):f86af33c6531dfb9b68fbf9f86edb40e

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science