參考文獻 |
[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. |