臺灣博碩士論文加值系統

群聚分析是一種很有效的工具，可以被用來分析資料間的結構特性，並且將分析結果廣泛的應用於工程與科學上的訓練。群聚分析的主要目的是根據資料彼此之間的相似度而將一群資料分成數個群聚。在本篇論文中，我們提出了四種新的群聚分析方法，分別是藉由改良舊的群聚分析方法或類神經網路而獲得的。這四種新的方法我們將它整理如下：
(1)監督式模糊Kohonen分類網路
模糊Kohonen分類網路(FKCN)引入了模糊c-means (FCM)演算法的模型來整合Kohonen分類網路(KCN)的學習速率與迭代更新策略。因為FKCN是非監督式的，因此我們在FKCN中加入了監督式的學習演算法，而此種監督式演算法有一點類似於學習向量量化(LVQ2)演算法。許多的資料集測試被用來說明我們所提的這個方法，由結果可知我們的方法在相同條件之下的確優於其他的監督式類神經網路。除此之外，我們所提的監督式FKCN更可以在很短的時間內達到收斂的目的。
(2)改良式模糊c-means演算法
(3)具有對稱概念的模糊Kohonen分類網路
(4)新的泛學習向量量化網路
FCM、FKCN與LVQ2演算法都是使用歐基里德距離來測量資料間的相似度，而此種測量法會讓演算法傾向於尋找圓形的群聚。但在實際上我們常遭遇到的資料集中發現，資料集常常是由線、圓或橢圓形狀所組合而成的。根據這樣的問題，我們提出了一種新的距離量測法，我們稱之為對稱距離，並將此對稱距離加入FCM、FKCN與LVQ2演算法中。藉由許多的電腦模擬結果可知，改良後的FCM、FKCN與LVQ2演算法在分割線、圓與橢圓群聚上的確有很好的效果。另外，本篇論文所提的改良式LVQ2演算法更可解決群聚交叉的問題。

Cluster analysis is an efficient tool for exploring the true underlying structure of a given data set and is being applied in a wide variety of engineering and scientific disciplines. The primary objective of cluster analysis is to partition a given data set into so-called homogenous clusters such that patterns within a cluster are more similar to each other. In this thesis, we propose four cluster analysis methods using improved cluster analysis algorithm or neural networks. The new methods are summarized below.
(1) Supervised fuzzy Kohonen clustering networks
A fuzzy Kohonen clustering networks (FKCN) was proposed which integrates the fuzzy c-means (FCM) algorithm model into the learning rate and updating strategies of the Kohonen clustering networks (KCN). Because FKCN is unsupervised, we propose a supervised version of FKCN with the supervised learning algorithm that is similar to the learning vector quantization (LVQ2) algorithm. Several data sets are used to illustrate this method. The results show that proposed method is more effective than another supervised neural networks. Moreover, it can terminate quickly with the same condition.
(2) Improved fuzzy c-means algorithm
(3) Fuzzy Kohonen clustering networks using the concept of
symmetry
(4) A new generalized learning vector quantization algorithm
FCM, FKCN and LVQ2 algorithms use Euclidean distance to compute the distance between a pattern and the assigned cluster center, so the algorithms are suitable for detecting the spherical cluster. However, since most clusters (or classes) in the real data sets may be the linear, spherical or ellipsoidal shape. Based on the question, we propose a distance measure based on the concept of symmetry. FCM, FKCN and LVQ2 algorithms incorporated with the symmetrical distance can detect linear, spherical and ellipsoidal clusters very well. Through several computer simulations, the results show that the proposed methods with the random initialization are effectiveness in detecting linear, spherical and ellipsoidal clusters. Besides, the improved LVQ2 algorithm can solve the crossed question.

第一章緒論 …………………………………………1
1.1研究動機 ……………………………………1
1.2論文架構 ……………………………………3
第二章群聚分析 ……………………………………4
2.1分群 …………………………………………4
2.2群聚分析的工具 ……………………………6
2.2.l k-means演算法 ………………………6
2.2.2模糊c-means演算法 …………………9
第三章類神經網路 …………………………………13
3.1類神經網路的發展簡史 ……………………13
3.2類神經網路運作的基本原理 ………………16
3.2.1何謂類神經網路 ………………………16
3.2.2生物神經網路與類神經網路的結構 …16
3.2.3類神經網路的工作及學習 ……………18
3.2.4類神經網路測試 ………………………19
3.3學習向量量化網路 …………………………19
3.4 Kohonen分類網路 …………………………21
3.5模糊Kohonen分類網路 ……………………24
第四章監督式模糊Kohonen分類網路 ……………27
4.1監督式模糊Kohonen分類網路 ……………27
4.2實驗結果 ……………………………………29
第五章改良式模糊c-means演算法 ………………44
5.1對稱距離 ……………………………………44
5.2改良式模糊c-means演算法 ………………45
5.3實驗結果 ……………………………………46
第六章具有對稱概念的模糊Kohonen分類網路 …56
6.1具有對稱概念的模糊Kohonen分類網路 …56
6.2實驗結果 ……………………………………57
第七章新的泛學習向量量化網路 …………………67
7.1新的泛學習向量量化網路 …………………67
7.2實驗結果 ……………………………………68
第八章結論與展望 …………………………………81
8.1結論 …………………………………………81
8.2展望 …………………………………………81
參考文獻 ……………………………………………83

[1] A.K. Jain and R.C. Dubes, “Algorithms for clustering data”, Prentice Hall, New Jersey, 1988.
[2] J.S. Jang, C.T. Sun and E. Mizutain, “Neuro-fuzzy and soft computing”, Prentice Hall, New Jersey, 1997.
[3] R.O. Duda and P.E. Hart, “Pattern classification and scene analysis”, Wiley, New York, 1973.
[4] T. Kohonen, “Self-organization and associative memory”, 3rd Ed., Springer, Berlin, 1989.
[5] J.C. Bezdek, “Pattern recognition with fuzzy objective function algorithm”, Plenum, New York, 1981.
[6] J. Tou and R. Gonzalez, “Pattern recognition principles”, Addison-Wesley, Massachusetts, Reading, 1975.
[7] R. Lippman, “An introduction to neural computing”, IEEE ASSP Mag., pp.4-22, April, 1987.
[8] T. Huntsberger and P. Ajjimarangsee, “Parallel self-organizing feature maps for unsupervised pattern recognition”, Int. J. Gen. Syst., Vol.6, pp.357-372, 1989.
[9] E.C.K. Tsao, J.C. Bezdek and N.R. Pal, “Fuzzy Kohonen clustering networks”, Pattern Recognition, Vol.27, No.5, pp.757-764, 1994.
[10] J. Hartigan, “Clustering algorithms”, Wiley, New York, 1975.
[11] Y.H. Joo, H.S. Hwang, K.B. Kim and K.B. Woo, “Fuzzy system modeling by fuzzy partition and GA hybrid schemes”, Fuzzy Sets Syst., Vol.86, pp.279-288, 1997.
[12] M. Sugeno and T. Yasukawa, “A fuzzy-logic-based approach to qualitative modeling”, IEEE Trans. Fuzzy Syst., Vol.1, pp.7-31, 1993.
[13] B.S. Everitt, “Cluster analysis”, John Wiley & Sons, Inc., New York, 1974.
[14] G.H. Ball and D.I. Hall, “Some fundamental concepts and synthesis procedures for pattern recognition preprocessors”, In ROC. of Int. Conf. Microwaves, Circuit Theory and Information Theory, Tokyo, Japan, pp.281-297, 1964.
[15] G.A. Carpenter and S. Grossberg, “ART2: Self-organization of stable category recognition codes for analog input patterns”, Applied Optics, Vol.26, No.23, pp.4919-4930, 1987.
[16] G.A. Carpenter and S. Grossberg, “A massively parallel architecture for a self-organizing neural pattern recognition machine”, Computer Vision, Graphics and Image Proc., Vol.37, pp.54-115, 1987.
[17] E. Ruspini, “Numerical method for fuzzy clustering”, Information Sciences, Vol.2, pp.319-350, 1970.
[18] J.C. Dunn, “A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters”, Cybernetics, Vol.3, pp.32-57, 1974.
[19] J.C. Bezdek, “A convergence theorem for the fuzzy ISODATA clustering algorithms”, IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol.2, pp.1-8, 1980.
[20] T. Kohonen, “Learning vector quantization”, Helsinki University of Technology, Laboratory of Computer and Information Science Report TKK-F-A-601, 1986.
[21] J.C. Bezdek and N.R. Pal, “Two soft relatives of learning vector quantization”, Neural Network, Vol.8, No.5, pp.729-743, 1995.
[22] P.N. Suganthan, “Structure adaptive multilayer overlapped SOMs with supervision for handprinted digit classification”, IEEE, pp.1706-1711, 1998.
[23] T. Kohonen, “The self-organizing maps”, Proc. of the IEEE, Vol.78, No.9, pp.1464-1480, 1995.
[24] R.R. Sarukkai, “Supervised networks that self-organize class outputs”, Neural Computations, Vol.9, No.2, pp.285-289, 1997.
[25] Ching-Tang Hsieh, Uei-Jyh Chen and You-Chuang Wang, “Supervised fuzzy Kohonen clustering networks”, Electronic Session of Fuzzy System Symposium 2000, pp.660, Japan, September 6-8, 2000.
[26] K. Koffka, “Principles of gestalt psychology”, Routledge and Kegan, London, 1935.
[27] Ching-Tang Hsieh, Mu-Chun Su and Uei-Jyh Chen, “Improved fuzzy c-means algorithm”, Artificial Intelligence and Soft Computing (IASTED), pp.1-6, Canada, July 24-26, 2000.
[28] Ching-Tang Hsieh, Uei-Jyh Chen, You-Chuang Wang and Horng-Jae Lee, “Fuzzy Kohonen clustering networks using the concept of symmetry”, International Symposium on Nonlinear Theory and its Applications (NOLTA 2000), pp.487-490, Germany, September 17-21, 2000.
[29] N.R. Pal, J.C. Bezdek and E.C.K. Tsao, “Generalized clustering networks and Kohonen’s self-organizing scheme”, IEEE Trans. Neural Networks, Vol.4, pp.549-557, 1993.
[30] Ching-Tang Hsieh, Mu-Chun Su, Uei-Jyh Chen and Horng-Jae Lee, “A new generalized learning vector quantization algorithm”, 2000 IEEE Asia Pacific Conference on Circuits and Systems, pp.339-344, China, December 4-6, 2000.