以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：3

、訪客IP：18.226.185.240

姓名	趙于翔(Yu-Xiang Zhao)  查詢紙本館藏	畢業系所	資訊工程學系
論文名稱	以群體智慧為基礎的最佳化演算法及其應用 (Swarm-Intelligence-Based Optimization Algorithms and Their Applications)
相關論文	★ 以Q-學習法為基礎之群體智慧演算法及其應用 ★ 發展遲緩兒童之復健系統研製 ★ 從認知風格角度比較教師評量與同儕互評之差異：從英語寫作到遊戲製作 ★ 基於檢驗數值的糖尿病腎病變預測模型 ★ 模糊類神經網路為架構之遙測影像分類器設計 ★ 複合式群聚演算法 ★ 身心障礙者輔具之研製 ★ 指紋分類器之研究 ★ 背光影像補償及色彩減量之研究 ★ 類神經網路於營利事業所得稅選案之應用 ★ 一個新的線上學習系統及其於稅務選案上之應用 ★ 人眼追蹤系統及其於人機介面之應用 ★ 結合群體智慧與自我組織映射圖的資料視覺化研究 ★ 追瞳系統之研發於身障者之人機介面應用 ★ 以類免疫系統為基礎之線上學習類神經模糊系統及其應用 ★ 基因演算法於語音聲紋解攪拌之應用
檔案	[Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載] 本電子論文使用權限為同意立即開放。 已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。 請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。
摘要(中)	群體智慧(swarm intelligence)是目前廣受歡迎的最佳化(optimization)演算法，其依據族群為基礎以及無需導式的特性深受大眾所喜愛，因為有著多變化且多功能的最佳化特性，使得群體智慧廣泛地使用於許多連續與離散的最佳化問題上，在此論文中，我們提出兩種以群體智慧為基礎的最佳化演算法來解決許多不同的問題，並將其應用在各種不同領域之最佳化問題中。 在第一個所提出的最佳化演算法中，我們嘗試利用「自我特徵組織映射圖(self-organizing feature maps, SOM)演算法」的特性來改良並提出一個解決連續問題的新型態最佳化演算法，此新型態的最佳化演算法我們將其命名為「以自我組織特徵映射圖為基礎的最佳化(SOM-based optimization, SOMO)演算法」，經由此最佳化演算法，對於最佳化問題中的較佳或適合解可以在自我組織的過程中進而同時被探索與開拓；在另外一方面，其類神經網路輸出的特性，提供將多維空間的適應度景觀圖(fitness landscape)轉換至二維或三維空間的適應度景觀圖影像，藉由適應度景觀圖的建立，我們可以選擇適合再繼續探索的區域範圍來搜尋問題的最佳解，在此演算法中我們提出了一些測試方法來展示其效能。接著我們以此演算法提出了兩個應用，第一個應用為以「SOMO為基礎的推薦系統(SOMO-based recommendation system)」，此系統可以學習使用者的喜好，幫助使用者規劃旅行行程並提出適合的旅行行程建議給使用者；第二個應用為「以SOMO為基礎的群聚(SOMO-based clustering, SOMOC)演算法」，此演算法可以同時決定出群聚的數目以及資料的分配方法，其特性在於能正確且有效地偵測影像上各種不同形狀的物件，在此演算法中我們利用一些不同形狀的物件影像來測試及展示其演算法的效能。 在第二個所提出的最佳化演算法中，我們將問題鎖定在解決矩形拼圖(puzzle)的問題上，分別提出兩種不同的方法來組合拼圖，第一個為以啟發式(heuristic)為基礎的方法，此方法能直覺且有效地解決大部分的拼圖問題；然而，針對第一個方法所不能解決的問題，我們提出第二個以「螞蟻演算法(ant colony system, ACS)」為基礎的方法來改善第一個方法，在此問題中我們利用一些影像來測試其演算法的效能。接著我們將此演算法應用於語音通訊保密的語音解攪拌器上，語音通訊保密已經被廣泛應用在軍事與商業領域，一般的作法是將語音攪拌器(scrambler)使用在端點對端點的保密上，而大部分的語音攪拌器都是以時域與頻域為基礎來進行排列攪拌，另一方面語音解攪拌器(descrambler)也必須防止竊聽者盜取攪拌後的語音訊號，在此實驗上，我們將語音解攪拌的問題視為解拼圖的問題，並且利用我們所提出的解拼圖方法來實作其應用，最後我們採用一些範例來展示其結果。
摘要(英)	Swarm intelligence is one of the most popular derivative-free and population-based optimization algorithms. It has been extensively used for both continuous and discrete optimization problems due to its versatile optimization capabilities. In this dissertation, we proposed two swarm-intelligence-based optimization algorithms to solve different problems. In the first proposed optimization algorithm, we tried to explore the possibility of applying the self-organizing feature maps (SOM) algorithm in continuous optimization problems. A new optimization algorithm based on the self-organizing map was proposed and named SOM-based optimization (SOMO). Via the SOMO algorithm, good solutions to an optimization problem can be simultaneously explored and exploited during the self-organizing process. In addition, the outputs of the neural network allow us to transform a multi-dimensional fitness (objective) landscape into a three-dimensional projected fitness landscape or a two-dimensional fitness image. By viewing the three-dimensional projected fitness landscape or the two-dimensional fitness image we may choose which region deserves to be further exploited. Some test functions and data sets were used to demonstrate the performance of the SOMO algorithm. Two applications based on the SOMO algorithm were proposed. The first application is the SOMO-based recommendation system, which is able to learn personal preferences of users and provide tailored suggestions to users, to help travelers to plan their sightseeing tours. Tourist spots which meet the travelers’ preferences will be suggested by the proposed recommendation system. The second application is the SOMO-based clustering (SOMOC) algorithm, which is able to simultaneously determine the number of clusters and partition a given data set into the estimated number of clusters. The SOMOC algorithm could be used to detect objects with different geometrical properties in images. Some experimental results demonstrate that the SOMOC algorithm could detect clusters with different geometrical shapes. In the second proposed optimization algorithm, we considered a special puzzle problem where the shape of each puzzle piece is a rectangle. Two different approaches to assemble the special puzzles were proposed. The first method is based on common human heuristics. It is very straightforward but effective for many puzzle problems. For some puzzle problems where the first approach doesn’t work well, the second approach which is based on ACS algorithm can provide appealing solutions. Some images were used to test the proposed methods. In addition, we proposed a new approach to implement a descrambler. The security problem of speech communication has always been a demanding problem in military and business areas. A common approach to realizing end-to-end security is the use of a scrambler. Most of the scramblers are based on the permutation of speech signals in the time domain and/or frequency domain. On the other hand, descramblers are used to eavesdrop information from scrambled speech signals. We treated the descrambling problem as a puzzle solving problem. Some speech signals were used to demonstrate the performance of the proposed methods.
關鍵字(中)	★ 最佳化演算法 ★ 群體智慧 ★ 解攪拌器 ★ 攪拌器 ★ 語音通訊保密 ★ 螞蟻演算法 ★ 類神經網路 ★ 推薦系統 ★ 群聚演算法 ★ 適應度景觀圖 ★ 拼圖 ★ 以自我組織特徵映射圖為基礎的最佳化演算法 ★ 自我特徵組織映射圖演算法	關鍵字(英)	★ derivative-free ★ descrambler ★ security ★ neural network ★ fitness landscape ★ recommendation system ★ scrambler ★ speech communication ★ SOMO algorithm ★ puzzle ★ SOMOC algorithm ★ ACS algorithm ★ swarm intelligence ★ population-based ★ optimization algorithm ★ SOM algorithm ★ cluste
論文目次	Abstract i Acknowledgments v Table of Contents vi List of Figures viii List of Tables x 1 Introduction 1 1.1 Introduction of Optimization Algorithms 1 1.2 Derivative-Based Optimization 3 1.2.1 Steepest Descent Method 3 1.2.2 Newton’s Method 8 1.3 Derivative-Free Optimization 10 1.3.1 Evolutionary Computation 12 1.3.2 Simulated Annealing 17 1.3.3 Random Search 21 1.4 Introduction of Swarm Intelligence 23 1.4.1 Ant Colony System 24 1.4.2 Particle Swarm Optimization Algorithm 29 1.5 Discussion 33 1.6 The Organization of This Dissertation 35 2 A New Approach to Optimization Based on the SOM 37 2.1 Survey of Related Works 37 2.2 Review of the SOM Algorithm 39 2.3 The SOM-Based Optimization Algorithm 40 2.4 Discussion 50 2.5 Conclusions 54 3 Performance Tests of the SOMO Algorithm 56 3.1 Optimizing Standard Test Functions 56 3.2 Neural Network Training Problem 69 3.3 Conclusions 71 4 A SOMO-Based Recommendation System for ATIS 72 4.1 Survey of Related Works 72 Table of Contents - vii - 4.2 Brief Review of Recommendation Systems 73 4.3 The SOMO-Based Recommendation System 74 4.4 The Tourist Spots Recommendation System 76 4.5 Conclusions 80 5 A SOMO-Based Clustering Algorithm 81 5.1 Survey of Related Works 81 5.2 Review of the Point Symmetry Distance 83 5.3 Review of the PS Index 84 5.4 The SOMO-based Clustering Algorithm 85 5.5 The Experimental Results 86 5.6 Conclusions 96 6 A New Approach to Puzzle Solver Based on the ACS 97 6.1 Survey of Related Works 97 6.2 The Any Colony Optimization Algorithm 99 6.3 The Assembly Method 99 6.3.1 The Heuristic Method 100 6.3.2 The ACS-Based Method 101 6.4 Simulation Results 104 6.5 Conclusions 106 7 A Puzzle-Solver-Based Speech Descrambling Method 107 7.1 Survey of Related Works 107 7.2 Introduction of Voiceprint 109 7.3 Simulation Results 113 7.4 Conclusions 113 8 Conclusions and Future Works 115 References 117 Publications 128
參考文獻	[1] G. Adorni, M. Mordonini, and A. Poggi, “Autonomous Agents Coordination through Traffic Signals and Rules,” IEEE Conference on Intelligent Transportation Systems, pp. 290-295, 1998. [2] J. Ahmed and N. Ikram, “Frequency-domain speech scrambling/descrambling techniques implementation and evaluation on DSP,” Proceedings of the IEEE INMIC’2003, Dec. 2003. [3] J. A. Alspector, A. Kolcz, and N. Karunanithi, “Comparing feature-based and clique-based user models for movie selection,” Proceedings of the Third ACM Conference on Digital Libraries, 1998. [4] T. Altman, “Solving the jigsaw puzzle problem in linear time,” Applied Artificial Intelligence, vol. 3, pp. 453-462, 1989. [5] B. Angeniol, G. De La Croix Vaubois, and J. Y. Le Texier, “Self-Organizing Feature Maps and the Travelling Salesman Problem,” Neural Networks, vol. 1, pp. 289-293, 1988. [6] M. Avriel, Nonlinear Programming: Analysis and Methods, Dover Publishing, 2003. [7] N. Baba, T. Shoman, and Y. Sawaragi, “A modified convergence theorem for a random optimization method”, Information Science, vol. 13, pp. 159-166, 1977. [8] N. Baba, Y. Mogami, M. Kohzake, Y. Shiraishi, and Y. Yoshida, “A hybrid algorithm for finding the global minimum of error function of neural networks and its applications”, Neural Networks, vol. 7, no. 8, pp. 1253-1265, 1994. [9] G. P. Babu and M. N. Murty, “Clustering with evolution strategies,” Pattern Recognition, vol. 27, no. 2, pp. 321-329, 1994. [10] T. M. Balckwell and P. J. Bentley, “Dynamic search with charged swarms,” Proceedings of the Genetic and Evolutionary Computation Conference, pp. 19-26, 2002. [11] T. M. Balckwell and P. J. Bentley, “Improvised music with swarms,” Proceedings. of the 2002 Congress on Evolutionary Computation, pp. 1462-1467, 2002. [12] H. J. Beker and F. C. Piper, Secure Speech Communications, Academic, 1985. [13] G. Beni, and J. Wang, “Swarm Intelligence in Cellular Robotic Systems”, Proceedings of the NATO Advanced Workshop on Robots and Biological Systems, Tuscany, Italy, pp. 26-30, June 1989. [14] P. J. Bentley, Evolutionary Design by Computers, Morgan Kaufmann, 1999. [15] J. Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithm, New York: Plenum, 1981. [16] J. C. Bezdek, “Numerical taxonomy with fuzzy sets,” Journal of Mathematical Biology, vol. 1, pp. 57-71, 1974. [17] C. L. Blake and C. J. Merz, “UCI repository of machine learning databases,” Available: http://www.ics.uci.edu/~mlearn/MLRepository.html, 1998. [18] J. De Bock, R. De Smet, W. Philips, and J. D'Haeyer, “Constructing the Topological Solution of Jigsaw Puzzles,” Proceedings of the ICIP’04, pp. 2127-2130, 2004. [19] E. Bonabeau, M. Dorigo, and G. Theraulaz, Swarm Intelligence: From Natural to Artificial Systems, Oxford University Press, 1999. [20] S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004. [21] G. C. Burdea and H. J. Wolfson, “Solving jigsaw puzzles by a robot,” IEEE Transactions on Robotics and Automation, vol. 5, no. 6, pp. 752-764, 1989. [22] C. Chang and C. Lin, LIBSVM: a library for SVMs, 2001. Available: http://www.vision.caltech.edu/Image_Datasets/Caltech101/Caltech101.html. [23] C. H. Chou, M. C. Su, and E. Lai, “A New Cluster Validity Measure and Its Application to Image Compression,” Pattern Analysis and Applications, vol. 7, pp. 205-220, July 2004. [24] M. G. Chung, M. Fleck, and D.A. Forsyth, “Jigsaw Puzzle Solver Using Shape and Color,” Proceedings of the IEEE ICSP’98, pp. 877–880, 1998. [25] M. Clerc and J. Kennedy, “The particle swarm - Explosion, stability, and convergence in a multidimensional complex space,” IEEE Trans. Evolutionary Computation, vol. 6, no. 1, pp. 58-73, 2002. [26] M. Clerc, “TRIBES - un exemple d'optimisation par essaim particulaire sans parametres de controle,” Optimisation par Essaim Particulaire, Paris, France, 2003. [27] A. Colorni, M. Dorigo, and V. Maniezzo, “Distributed Optimization by Ant Colonies,” Proceedings of First European Conference on Artifical Life, edited by F. Varela and P. Bourgine, Cambridge, MA: MIT Press, pp. 134-142. 1991. [28] R. N. Dave and K. Bhaswan, “Adaptive fuzzy c-shells clustering and detection of ellipses,” IEEE Trans. Neural Networks, vol. 3(5), pp. 643-662, 1992. [29] R. N. Dave, “Fuzzy shell-clustering and application to circle detection in digital images,” International Journal General Systems, vol. 16, pp. 343-355, 1990. [30] R. N. Dave, “Use of the adaptive fuzzy clustering algorithm to detect lines in digital images,” Intelligent Robots and Computer Vision VIII, vol. 1192, pp. 600-611, 1989. [31] K. A. De Jong, “An analysis of the behaviour of a class of genetic adaptive systems,” University of Michigan, Ann Arbor, 1975. [32] D. Devogelaere, P. Van Bael, and M. Rijckaert, “Genetic algorithm driven clustering for toxicity prediction,” Fourth International Conference on Knowledge-based Intelligent Engineering Systems & Allied Technologies, pp. 173-176, 2000. [33] M. Dorigo, and L. M. Gambardella, “Ant Colonies for the Traveling Salesman Problem,” BioSystems, vol. 43, pp. 73-81, 1997. [34] M. Dorigo, and L. M. Gambardella, “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53-56, 1997. [35] M. Dorigo, “Ottimizzazione, Apprendimento Automatico, ed Algoritmi Basati su Metafora Naturale.” Ph.D. Dissertation, Politecnico di Milano, Press, 1992. [36] R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis, New York: Wiley, 1973. [37] J. C. Dunn, “A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters,” Journal of Cybernetics, vol. 3, no. 3, pp. 32-57, 1973. [38] J. C. Dunn, “Well separated clusters and optimal fuzzy partitions,” Journal of Cybernetics, vol. 4, pp. 95-104, 1974. [39] R. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,” Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp.39-43, Oct. 1995. [40] R. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,” Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, pp.39-43, Oct. 1995. [41] T. Eltoft and R. J. P. deFigueiredo, “A new neural network for cluster-detection-and-labeling,” IEEE Trans. on Neural Networks, vol. 9, pp. 1021-1035, 1998. [42] G. B. Fogel, G. W. Greenwood, and K. Chellapilla, “Evolutionary computation with extinction: Experiments and analysis,” Proceedings of the 2000 Congress on Evolutionary Computation, pp. 1415–1420, 2000. [43] L. J. Fogel, “Evolutionary Programming in Perspective: the Top-down View,” Computational Intelligence: Imitating Life, J. M. Zurada, R. J. Marks II, and C. J. Robinson, Eds., IEEE Press, Piscataway, NJ, pp. 135-146, 1994. [44] H. Freeman and L. Gardner, “Apictorial jigsaw puzzles: the computer solution of a problem in pattern recognition,” IEEE Transactions on Electronic Computers, vol. 13, pp. 118-127, April 1964. [45] K. Fujimura and H. Tokutaka, “SOM-TSP: an approach to optimize surface component mounting on a printed circuit board,” Kohonen Maps, Elsevier, Amsterdam, pp. 219-230, 1999. [46] K. Fujimura, H. Tokutaka, Y. Ohshima, and S. Kishida, “The Traveling Salesman Problem Applied to the Self-Organizing Feature Map,” Proceedings of International Conference on Neural Information Processing, pp. 427-432, 1994. [47] K. Fujimura, S. Kishida, O. C. Kwaw, and H. Tokutaka, “Optimization of electronic chip-mounting machine using SOM-TSP method with 5 dimensional data,” Proceedings of the International Conference on Info-tech and Info-net (ICII 2001-Beijing), vol. 4, pp. 26-31, 2001. [48] I. Gath and A. B. Geva, “Unsupervised optimal fuzzy clustering,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, pp. 773-781, 1989. [49] S. Geman and D. Geman, “Stochastic relaxation, Gibbs distribution and the Bayesian restoration in images,” IEEE Transactions of Pattern Analysis and Machine Intelligence, vol. 6, no. 6, pp. 721-741, 1984. [50] A. B. Geva, “Hierarchical Unsupervised Fuzzy Clustering,” IEEE Transactions on Fuzzy Systems, vol. 7, pp. 723-733, 1999. [51] A. Ghozeil and D. Fogel, “Discovering patterns in spatial data using evolutionary programming,” Proceedings of the 1st Annual Conference on Genetic Programming, pp. 512-520, 1996. [52] P. E. Gill, W. Murray, and M. H. Wright, Practical optimization, Academic Press, New York, 1981. [53] D. Goldberg, C. Malon, and M. Bern, “A global approach to automatic solution of jigsaw puzzles,” Proceedings of the 18th Annual Symposium on Computational Geometry, pp. 82-87, 2002. [54] D. Goldberg, D. Nichols, B. M. Oki, and D. Terry, “Using collaborative filtering to weave an information tapestry,” Communications of the ACM, vol. 35, pp. 61–70, January 1992. [55] D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Publishing Company, Reading, MA, 1989. [56] B. Goldburg, S. Sridharan, and E. Dawson, “Design and Cryptanalysis of Transform-Based Analog Speech Scramblers,” IEEE Journal on Selected Areas in Communications, vol. 11, no. 5, pp. 735-744, June 1993. [57] N. Good, J. Ben Schafer, J. A. Konstan, A. Borchers, B. Sarwar, J. Herlocker, and J. Riedl, “Combining collaborative filtering with personal agents for better recommendations,” AAAI/IAAI, pp. 439-446, 1999. [58] P. P. Grasse, “La reconstruction du nid et les coordinations inter-individuelles chez bellicoitermes natalenis et cubitermes sp. La theorie de la stigmergie: Essaid’interpretation du comportement des termites constructeurs,” Insect Societies, vol. 6, pp. 41-83. [59] D. Gupta, M. Digiovanni, H. Narita, and K. Goldberg, “Jester 2.0: A new linear-time collaborative filtering algorithm applied to jokes,” Proceedings of the ACM-SIGIR Workshop on Recommender Systems: Algorithms and Evaluation, 1999. [60] D. E. Gustafson and W. C. Kessel, “Fuzzy clustering with a fuzzy covariance matrix,” Proceedings of the IEEE Conference Decision Control, pp. 761-766, 1979. [61] L. O. Hall, I. B. Ozyurt, and J. C. Besdek, “Clustering with a genetically optimized approach,” IEEE Transactions on Evolutionary Computation, vol. 3, no. 2, pp. 103-112, 1999. [62] J. Hartigan, Clustering Algorithms, New York: Wiley, 1975. [63] D. B. Hauver, “Flycasting: Using collaborative filtering to generate a play list for online radio,” International Conference on Web Delivery of Music, 2001. [64] G. E. Hinton and T. J. Sejnowski, “Learning and relearning in Boltzmann machines”, in Parallel distributed processing, D. E. Rumerhart, J. L. McClelland, and the PDP research group, editors, chapter 7, pp. 282-317, MIT Press, Cambridge, MA., 1986. [65] G. E. Hinton, T. J. Sejnowski, and D. H. Ackley, “Boltzmann machines: constraint satisfaction networks that learn”, Technical Report CMU-CS-84-119, Department of computer Science, Carnegie Mellon University, 1984. [66] J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975. [67] F. Hoppner, F. Klawonn, R. Kruse, and T. Runkler, Fuzzy Cluster Analysis-Methods for Classification, Data Analysis and Image Recognition, John Wiley & Sons, LTD, 1999. [68] P. J. Huber, “Projection pursuit,” Annals of Statistics, vol. 13, pp. 435-475, 1985. [69] L. Ingber and B. E. Rosen, “Genetic algorithms and very fast simulated reannealing”, Mathematical and Computer Modeling, vol. 16, no. 11, pp. 87-100, 1992. [70] K. Jain and R. C. Dubes, Algorithms for Clustering Data, Englewood Cliffs, NJ: Prentice Hall, New Jersey, 1988. [71] J. S. R. Jang, C. T. Sun, and E. Mizutani, Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence, Prentice Hall, 1997. [72] N. S. Jayant, “Analog scramblers for speech privacy,” Computers and Security, vol. 1, pp. 275-298, 1982. [73] N. R. Jennings, “An Agent-Based Approach for Building Complex Software Systems,” Communications of the ACM, vol. 44, no. 4, pp. 35-41, 2001. [74] N. R. Jennings, “On Agent-Based Software Engineering,” Artificial Intelligence, vol. 117, pp. 277-296, 2000. [75] H. D. Jin, K. S. Leung, M. L. Wong, and Z. B. Xu, “An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem,” IEEE Transactions on Systems, Man and Cybernetics, vol. 33, pp. 877-888, Dec 2003. [76] M. Kajiura, Y. Akiyama, and Y. Anzai, “Solving large scale puzzles with neural networks,” Proceedings of the IEEE TAI’89, pp. 562-569, Oct. 1989. [77] N. Kase, M. Hattri, A. Ohsuga, and S. Honiden, “InfoMirror-Agent-based Information Assistance to Drivers,” IEEE/IEEJ/JSAI International Conference on Intelligent Transportation Systems, pp. 734-739, 1999. [78] J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” IEEE International Conference on Neural Networks, vol.4, pp.1942-1948, Dec. 1995. [79] J. Kennedy, R. C. Eberhart, and Y. Shi, Swarm Intelligence, New York: Academic Press, 2001. [80] J. Kennedy and R. Mendes, “Neighborhood topologies in fully-informed and best-of-neighborhood particle swarms,” IEEE SMC Workshop on Soft Computing in Industrial Applications, Jun 2003. [81] J. Kennedy and R. Mendes, “Topological structure and particle swarm performance,” Proceedings of the Congress on Evolutionary Computation, May 2002. [82] J. Kennedy, “Small worlds and mega-minds: effects of neighborhood topology on particle swarm optimization,” IEEE International Conference on Evolutionary Computation, pp.1931-1938, Dec. 1999. [83] J. Kennedy, “Stereotyping: improving particle swarm performance with cluster analysis,” Proceedings of the 2000 Congress on Evolutionary Computing, vol. 2, pp 1507-1512, 2000. [84] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing”, Science, vol. 220, no. 4598, pp. 671-680, May 1983. [85] N. Kohata, T. Yamaguchi, M. Sato, T. Baba, and H. Hashimoto, “Dynamic Formation Generating for Intelligent Transport Systems using Algorithm to Select Function by Environment Information.,” IEEJ/JSAI International Conference on Intelligent Transportation Systems, pp. 798-803, 1999. [86] N. Kohata, T. Yamaguchi, M. Takahide, T. Baba, and H. Hashimoto, “Dynamic Formation on Mobil Agents and Its Evolutionary Parallel Computation,” IEEE International Conference on Systems, Man, and Cybernetics, vol. 1, pp. 272-277, 1999. [87] T. Kohonen, E. Oja, O. Simula, A. Visa, and J. Kangas, “Engineering application of the self-organizing map,” Proceedings of the IEEE, vol. 84, no. 10, pp. 1358-1383, 1996. [88] T. Kohonen, Self-Organization Maps, Springer-Verlag, 1995. [89] T. Kohonen, Self-Organization and Associative Memory, 3rd ed. New York, Berlin: Springer-Verlag, 1989. [90] D. Kosiba, P. M. Devaux, S. Balasubramanian, T. Gandhi, and R. Kasturi, “An Automatic Jigsaw Puzzle Solver,” Proceedings of the 12th IAPR International Conference on Pattern Recognition, IEEE Computer Society Press, Jerusalem, vol. 1, pp. 616-618. 1994. [91] T. Krink and R. Thomsen, “Self-organized criticality and mass extinction in evolutionary algorithms,” Proceedings IEEE International Conf. on Evolutionary Computation, pp. 1155-1161, 2001. [92] K. Krishna and M. N. Murty, “Genetic K-means algorithm,” IEEE Trans. on Systems, Man, and Cybernetics-Part B: Cybernetics, vol. 29, no. 3, pp. 433-439, 1999. [93] E. L. Lawler and D. E. Wood, “Branch-and-bound methods: A survey,” Operations Research, vol. 14, pp. 699-719, 1966. [94] Q. Li and B. M. Kim, “Clustering approach for hybrid recommender system,” Proceedings of the IEEE/WIC International Conference on Web Intelligence, pp. 33-38, 2003. [95] R. Liu, D. V. Vliet, and D. Watling, “DRACULA: Dynamic Route Assignment Combining User Learning and micro-simulation,” Proceedings of the 23rd European Transport Forum. PTRC, vol. E, pp. 143-152, 1995. [96] Y. Man and I. Gath, “Detection and separation of ring-shaped clusters using fuzzy clustering,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 8, pp. 855-861, 1994. [97] A. Matsunaga, D. Koga, and M. Ohkawa, “An Analog Speech Scrambling System Using the FFT Technique with High-Level Security,” IEEE Journal on Selected Areas in Communications, vol. 7, no. 4, pp. 540.-547, May 1989. [98] J. Matyas, “Random optimization,” Automation and Remote Control, vol. 26, pp. 246-253, 1965. [99] U. Maulik and S. Bandyopadhyay, “Genetic algorithm-based clustering technique,” Pattern Recognition, vol. 33, pp. 1455-1465, 2000. [100] W. S. Meisel, Computer-oriented approaches to pattern recognition, volume 83 of Mathematics in science and engineering, Academic Press, New York, 1972. [101] R. Mendes, J. Kennedy, and J. Neves, “Watch why neighbor or how the swarm can learn from its environment,” Iberoamerican Conference on Artificial Intelligence, Seville, Nov. 2002. [102] N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H Teller, and E. Teller, “Equation of state calculations by fast computing machines”, Journal of Chemical Physics, vol. 21, no.6, pp.1087-1092, 1953. [103] C. K. Monson and K. D. Seppi, “Exposing origin-seeking bias in PSO,” Proceedings of the Genetic and Evolutionary Computation Conference, pp. 241-248, 2005. [104] J. Nocedal and S. J. Wright, Numerical Optimization, Springer, 2006. [105] R. H. J. M. Otten and L. P. P. P. van Ginneken, The annealing algorithm, Kluwer Academic, 1989. [106] P. Y. Papalambros and D. J. Wilde, Principles of Optimal Design: Modeling and Computation, Cambridge University Press, 2000. [107] C. D. Perttunen, D. R. Jones, and B. E. Stuckman, “Lipschitzian optimization without the lipschitz constant,” Journal of Optimization Theory and Application, vol. 79, no. 1, pp. 157-181, Oct. 1993. [108] G. M. Radack and N. I. Badler, “Jigsaw puzzle matching using a boundary-centered polar encoding,” Computer Graphics and Image Processing, vol. 19, pp. 1-17, 1982. [109] I. Rechenberg, “Evolution Strategy”, in Computational Intelligence: Imitating Life, J. M. Zurada, R. J. Marks II, and C. Robinson, Eds., IEEE Press, Piscataway, NJ, pp. 147-159, 1994. [110] P. Resnick, N. Iacovou, M. Suchak, P. Bergstorm, and J. Riedl, “Grouplens: An open architecture for collaborative filtering of netnews,” Proceedings of the ACM Conference on Computer-Supported Cooperative Work, 1994. [111] M. Richards and D. Ventura, “Dynamic sociometry in particle swarm optimization”, International Conference on Computational Intelligence and Natural Computing, pp. 1557-1560, September 2003. [112] F. I. Romeo, Simulated annealing: theory and applications to layout problems, PhD thesis, EECS Department, University of California at Berkeley, May 1989. [113] R. J. F. Rossetti, S. Bampi, R. Liu, and D.V. Vliet, “An Agent-based Framework for the Assessment of Drivers’ Decision-Making,” Proceedings of the 2000 IEEE International Conference on Intelligent Transportation Systems, pp. 387-392, 2000. [114] C. A. Rothwell, A. Zisserman, D. A. Forsyth, and J. L. Mundy, “Canonical frames for planar object recognition,” Proceedings of the 2nd European Conference on Computer Vision, pp. 757-772, 1992. [115] R. Salomon, “Reevaluating genetic algorithm performance under coordinate rotation of benchmark functions,” Elsevier Science on BioSystems, vol. 39, pp. 263–278, 1995. [116] G. Salton and McGill, Introduction to Modern Information Retrieval, McGraw-Hill, New York, 1983. [117] M. Sarkar, B. Yegnanarayana, and D. Khemani, “A clustering algorithm using an evolutionary programming-based approach,” Pattern Recognition Letters, vol. 18, pp. 975-986, 1997. [118] B. M. Sarwar, J. A. Konstan, A. Borchers, J. Herlocker, B. Miller, and J. Riedl, “Using Filtering Agents to Improve Prediction Quality in the GroupLens Research Collaborative Filtering System,” Computer Supported Cooperative Work, 1998. [119] J. B. Schafer, J. Konstan, and J. Riedl, “Recommender systems in e-commerce,” Proceedings of the 1st ACM Conference on Electronic Commerce (EC’99), 1999. [120] G. A. F. Seber and C. J. Wild, Nonlinear regression, John Wiley & Sons, 1989. [121] V. Senk, V. D. Delic, and V. S. Milosevic, “A New Speech Scrambling Concept Based on Hadamard Matrices,” IEEE Signal Processing Letters, vol. 4, no. 6, pp. 161-163, June 1997. [122] U. Shardanand and P. Maes, “Social information filtering: Algorithms for automating `word of mouth',” Proceedings of the ACM SIGCHI Conference on Human Factors in Computing Systems, pp. 210-217, 1995. [123] Y. Shi and R. C. Eberhart, “A Modified Particle Swarm Optimizer,” Proceedings of the IEEE International Conference on Evolutionary Computation, Piscataway, pp. 69-73, 1998. [124] Y. Shi and R. C. Eberhart, “Parameter Selection in Particle Swarm Optimization,” Proceedings of the 1998 Annual Conference on Evolutionary Programming, San Diego, CA, 1998. [125] Y. Shi and R. Eberhart, “Fuzzy adaptive particle swarm optimization,” Proceedings of the Congress on Evolutionary Computation, pp. 101-106, 2001. [126] F. J. Solis and J. B. Wets, “Minimization by random search techniques,” Mathematics of Operations Research, vol. 6, no.1, pp. 19-30, 1981. [127] J. C. Spall, “Multivariate stochastic approximation using a simultaneous perturbation gradient approximation,” IEEE Transactions on Automatic Control, vol. 37, pp. 332-341, 1992. [128] E. V. Stansfield, D. Harmer, and M. F. Kerrigan, “Speech processing techniques for HF radio security,” Proceedings of the IEE on Communications, Speech and Vision, vol. 136, no. 1, pp. 25-46, Feb. 1989. [129] M. C. Su and C. H. Chou, “A Modified Version of the K-means Algorithm with a Distance Based on Cluster Symmetry,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 6, pp. 674-680, June 2001. [130] M. C. Su and H. C. Chang, “Fast self-organizing feature map algorithm,” IEEE Transactions on Neural Networks, vol. 13, no. 3, pp. 721-733, May 2000. [131] M. C. Su and I. C. Liu, “A neural-network-based approach to detecting hyperellipsoidal shells,” Neural Processing Letters, vol. 9, no.3, pp. 279-292, 1999. [132] M. C. Su and T. K. Liu, “Application of neural networks using quadratic junctions in cluster analysis,” Neurocomputing, vol. 37, pp. 165-175, 2001. [133] M. C. Su and Y. C. Liu, “A New Approach to Clustering Data with Arbitrary Shapes”, Pattern Recognition, vol. 38, no. 11, pp. 1887-1901, Nov. 2005. [134] M. C. Su, C. H. Chou, and C. C. Hsieh, “Fuzzy C-means algorithm with a Point Symmetry Distance,” International Journal of Fuzzy Systems, vol. 7, no. 4, pp. 175-181, Dec. 2005. [135] M. C. Su, T. K. Liu, and H. T. Chang, “An efficient initialization scheme for the self-organizing feature map algorithm,” IEEE International Joint Conference on Neural Networks, pp. 1906-1910, Washington, D.C, 1999. [136] M. C. Su, Y. X. Zhao, and J. Lee, “SOM-based Optimization,” IEEE International Joint Conference on Neural Networks IJCNN, Budapest, Hungary, pp. 781-786, July 2004. [137] R. J. Sutton, Secure Communications, John Wiley & Sons, Inc., 2002. [138] J. Taheri, “Hierarchical Hopfield neural network in solving the puzzle problem,” Proceedings of the 2004 IEEE International Joint Conference on Neural Networks, vol. 3, pp. 2337-2342, July 2004. [139] T. Takagi, T. Yamaguchi, and M. Sato, “Multi-Modal Information Integration by Conceptual Fuzzy Set for Interactive Systems,” IEEE International Conference on Fuzzy Systems (FUZZ-IEEE’98), pp. 738-743, 1998. [140] D. B. Terry, “A tour through tapestry,” Proceedings of the ACM Conference On Organizational Computing Systems (COOCS), pp. 21–30, 1993. [141] C. Thorpe, T. Jochem, and D. Pomerleau, “The 1997 Automated Highway Free Agent Demonstration,” IEEE Conference on Intelligent Transportation Systems, pp. 496-501, 1997. [142] J. Tou and R. Gonzalez, Pattern Recognition Principles Reading, MA: Addison-Wesley, 1974. [143] F. Toyama, K. Shoji, and J. Miyamichi, “Assembly of Puzzles Using a Genetic Algorithm,” Proceedings of the ICPR’02, vol.4, pp. 389-392, 2002. [144] L. Y. Tseng and S. B. Yang, “A genetic approach to the automatic clustering problem,” Pattern Recognition, vol. 34, pp. 415-424, 2000. [145] S. Ujjin and P. J. Bentley, “Particle swarm optimization recommender system,” Proceedings of the IEEE Swarm Intelligence Symposium, pp. 124-131, 2003. [146] J. Vesterstrom and R. Thomsen, “A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems,” Proceedings of the 2004 Congress on Evolutionary Computation, vol. 2, pp. 1980-1987, 2004. [147] F. Vieira, A. Neto, and J. Cosya, “An efficient approach of the SOM algorithm to the traveling salesman problem,” Proceedings of the Neural Networks (SBRN 2002), pp. 152, 2002. [148] R. W. Webster, P. S. LaFollette, and R. L. Stafford, “Isthmus critical points for solving jigsaw puzzles in computer vision,” IEEE Transactions on Systems, Man and Cybernetics, vol. 21, pp. 1271-1278, 1991. [149] D. J. Willshaw and C. von der Malsburg, “How patterned neural connections can be set up by self-organization,” Proceedings of the Royal Society of London, Series B, vol. 194, pp. 431-445, 1976. [150] K. Wittenburg, D. Das, W. Hill, and L. Stead, “Group asynchronous browsing on the world wide web,” Proceedings of the Fourth International World Wide Web Conference, pp. 51–62, 1995. [151] H. Wolfson, E. Schonberg, A. Kalvin, and Y. Lamdan, “Solving jigsaw puzzles by computer,” Annals of Operations Research, vol. 12, pp. 51-64, 1988. [152] Y. Wu and B. P. Ng, “Speech Scrambling with Hadamard Transform in Frequency Domain”, Proceedings of the 2002 IEEE 6th International Conference on Signal Processing, vol. 2, pp. 1560- 1563, Aug. 2002. [153] X. L. Xie and G. Beni, “A validity measure for fuzzy clustering,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 8, pp. 841-847, 1991. [154] R. Xu and D. Wunsch, “Survey of clustering algorithms,” IEEE Transactions on Neural Networks, vol. 16, no. 3, pp. 645-678, 2005. [155] T. Yamaguchi, H. Nitta, T. Takagi, and H. Hashimoto, “Human Centered Sensory Intelligence Architecture for ITS,” IEEE International Conference on Intelligent Transportation Systems, pp. 446-451, 2000. [156] T. Yamaguchi, “Fuzzy Associative Memory Organizing Units System,” Journal of Japan Society for Fuzzy Theory and Systems, Vol. 5, No. 2, pp. 245-260, 1993. [157] H. Yamamoto, H. Ninomiya, and H. Asai, “Application of Neuro-Based Optimization to 3-D Rectangular Puzzles,” Proceedings of the IEEE&INNS/IJCNN’98 (WCCI’98), May 1998. [158] F. H. Yao and G. F. Shao, “A shape and image merging technique to solve jigsaw puzzles,” Pattern Recognition Letters, vol. 24, no. 12, pp. 1819-1835, 2003. [159] R. Yarlagadda and K. Rao, Hadamard matrix analysis and synthesis: with applications to communications and signal/image processing, Kluwer Academic Publishers, 1997. [160] Taiwan Tourism Bureau, Available: http://www.tbroc.gov.tw/lan/Cht/search/index.asp. [161] The software packages for the GAs and the PSO algorithm, Available: http://www.engr.iupui.edu/~ebergart/web/PSObook.html. [162] Wikipedia: the free encyclopedia, Available: http://en.wikipedia.org/wiki/Main_Page.
指導教授	蘇木春(Mu-Chun Su)	審核日期	2007-7-5
推文	facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu
網路書籤	Google bookmarks   del.icio.us   hemidemi   myshare