n m-dimensional data points K Clusters KP Data Points (Cluster centers) K Clusters
|
|
- Asher Fisher
- 6 years ago
- Views:
Transcription
1 Clustering using a coarse-grained parallel Genetic Algorithm: A Preliminary Study Nalini K. Ratha Anil K. Jain Moon J. Chung Department of Computer Science Department of Computer Science Department of Computer Science Michigan State University Michigan State University Michigan State University East Lansing, MI 4884 East Lansing, MI 4884 East Lansing, MI 4884 ratha@cps.msu.edu jain@cps.msu.edu chung@cps.msu.edu Abstract Genetic Algorithms (GA) are useful in solving complex optimization problems. By posing pattern clustering as an optimization problem, GAs can be used to obtain an optimal minimum squared-error partitions. In order to improve the total execution time, a distributed algorithm has been developed using the divide and conquer approach. Using a standard communication library called PVM, the distributed algorithm has been implemented on a workstation cluster. The GA approach gives better quality clusters for many data sets compared to a standard K-Means clustering algorithm. We have achieved a near linear speedup for the distributed implementation. Keywords: Genetic Algorithm, Pattern Clustering, PVM, Workstation cluster. Introduction Clustering algorithms group patterns based on measures of similarity or dissimilarity. Data clustering is an important technique in the eld of exploratory data analysis. The set of clustering algorithms can be broadly classied into one of the following two types: (i) hierarchical or (ii) partitional. Hierarchical clustering is concerned with obtaining a nested hierarchical partition of the data. In partitional clustering we are interested in generating a single partition describing the groups or clusters present in the data. A formal denition of partitional clustering can be described as follows. Given a collection of n pattern vectors where each pattern is a m-dimensional vector characterized by the set of features (x; x; : : : ; x m ), nd the clusters present in the data. A cluster is dened by the similarity of patterns present in it. The number of clusters may be known or unknown. Jain and Dubes [6] describe a number of clustering techniques and indices for cluster validity. The minimum squared-error is a well known criterion used to obtain a specied number of clusters. The squared-error for a set of n m-dimensional patterns is given by K E k = e k ; () k= where K is the desired number of clusters, and e k is dened as follows: where n k e k = (x (k) i? m (k) ) t (x (k) i? m (k) ); () i= n k m (k) = n k i= x (k) i ; n = K n k : (3) k= Mean-squared error criterion function typically looks for clusters with hyperellipsoidal shapes. The most well-known squared-error clustering algorithms are K- Means, ISODATA, CLUSTER, and FORG. The main problem with these algorithms is the nonoptimality of the resulting partitions. Moreover, these algorithms often give dierent clusters when run with dierent initial cluster centers as they usually get stuck at a local minima. The simplest and the most well known partitional clustering algorithm is the K-Means algorithm. A sequential version of the K-Means algorithm is shown in Table. The algorithm requires that the user specify the desired number of clusters. The partitional clustering problem can also be viewed as an optimization problem. For the squarederror criterion, the clustering problem can be stated as nding the clusters (i.e., nd a labeling for the patterns) such that the between-group scatter is maximized and the within-group scatter is minimized. Many stochastic techniques exist in the literature which address the issue of achieving the global minima of a criterion function. Simulated annealing and
2 Input: n m?dimensional patterns, and K (number of desired clusters). Output: Non-overlapping K clusters i.e., a labeling of all the n patterns with labels from the set [..K]. Method:. Select K points randomly as cluster centers.. Repeat For i= to n do if pattern[i] is closest to the j th cluster center, assign it to cluster j. Compute new cluster centers as the average of patterns in each cluster. Until no changes occur in cluster centers Table : K-Means algorithm. genetic algorithms are some of these techniques. Simulated annealing has been used to solve the partitional clustering problem [7]. A genetic algorithm (GA) is a search procedure based on the \survival of the ttest" principle [3]. The \ttest candidate" is the solution at any given time. By running the evolution process for a suciently large number of generations, we are hopeful of reaching the global minima. The genetic algorithm (GA) is a model of machine learning [5]. It mimics the evolutionary process in nature by creating a population of individuals represented by chromosomes. These individuals go through a process of evolution. Dierent individuals compete for resources in the environment. The \ttest" individual survives and propagates its genes. The \crossover" operation is the process of exchanging chunks of genetic information between a pair of chromosomes. As in natural evolution process, GAs also dene a \mutation" process, where a gene undergoes changes in itself. A general scheme for GA is shown in Table. The main issues involved in designing a GA are (i) a suitable problem representation that enables application of GA operators, (ii) selecting a suitable candidate tness evaluation function, and (iii) dening the crossover and mutation functions. Other global parameters such as the population size, crossover and mutation probabilities, and number of generations also play an important role in obtaining good quality results using GAs. Genetic algorithms have been used in many pattern recognition and image processing applications including image segmentation [], feature selection [], and shape analysis []. The main drawback of genetic algorithms is the amount of time taken for convergence. The search space grows exponentially as a function of the problem size. Hence, the number of generations needed to reach a global solution increases rapidly. A number of methods have been described in the literature to improve the convergence [3]. We adopt a divide and conquer strategy to combat the unacceptable convergence time. The divide and conquer approach lends itself to a coarse-grained parallel implementation. Squared-error clustering algorithms are compute intensive. As a result, a number of parallel clustering algorithms have been proposed in the literature. Ni and Jain [9] describe a systolic array-based algorithm that can be implemented on a VLSI. Li et al. [8] proposed a SIMD algorithm with O(k lognm) time complexity and NM processing elements (PEs). Another SIMD algorithm described by Ranka and Sahni [0] has a time complexity of O(k + lognm) with NM processors in a hypercube. We have used a set of generalpurpose workstations connected over a local area network (LAN) to implement the squared-error clustering algorithm using a genetic algorithm. The purpose of this paper is two fold. First, we show that the local minima problem associated with a standard squarederror clustering algorithm can be overcome by using a genetic algorithm. Second, the slow convergence of genetic algorithms can be somewhat alleviated by using a cluster of workstations. Thus, the combination of the two approaches can result in good clusters with a reasonable execution time. The reminder of the paper is organized as follows. Section describes a sequential genetic algorithm for partitional clustering. The parallel algorithm using a coarse-grained approach is described in section 3. Both the sequential and distributed algorithms have been implemented. An analysis of the results in terms
3 of quality of clusters and speedup is carried out in section 4. The conclusions and future work are presented in section 5. A Genetic Algorithm for clustering The squared-error clustering problem can also be posed as a label assignment problem. Each of the n patterns needs to be assigned a label from the set f : : : Kg such that the squared error in Eq. () is minimized. Using this denition of clustering, we form the chromosome as a bit stream of pattern labels. We can apply the genetic operators on the bit stream. The sequential genetic algorithm for pattern clustering is described in Table. The clustering problem has now been presented as an optimization problem. The standard crossover and mutation can be applied on potential solutions represented as bit streams. However, we need to dene the tness function. The tness of a new generation candidate should be better than its parents [5]. We dene a variation of squared-error as the tness function. The tness value of a candidate is computed as follows:. Let Worstscore be the squared-error when all the patterns form a single cluster.. Let PresentScore be the squared-error obtained by the present assignment of labels. 3. FitnessScore = e P resentscore (W orstscoret ), where T is a normalization constant. The normalization is done so that the tness value is between 0 and which can be used as the probability of a candidate being selected for crossover. From the squared-error criterion point of view, a crossover need not result in a better solution. Hence, we restrict the crossover to cases where the crossover results in a lower squared-error value with respect to its parents. Otherwise, the generated candidate is rejected. In this way, we ensure the property of the population moving towards a global optimum. 3 Coarse-grained parallel Algorithm The main drawback with any GA scheme is the time taken to converge to the global minima. In order to speedup the total execution time, we need to explore distributed/parallel methods. There are two ways to parallelize the above algorithm: (i) divide and conquer, and (ii) distributed computation. In the rst method, the n pattern vectors are divided into P groups assuming that P processors are available. Each of the P processors works on the data assigned to it using the sequential algorithm. After each processor is done with its task, we will have P K clusters. The master now runs a K- Means pass on the PK cluster centers to obtain the desired K clusters. The advantage of this method is that it needs very little communication between the processors. The disadvantage is that it is dicult to balance the load on a heterogeneous workstation cluster as each subset of data might take dierent numbers of passes to complete. Hence, the overall execution time may depend on the slowest workstation. In the distributed computation method, the pattern vectors are distributed as before. At the end of every phase, the result is communicated to the master. A minor variation to this is that the partial results (best candidates) can be sent asynchronously. This method has a higher communication overhead, but the work load can be balanced. We use the divide and conquer method because of its low communication requirement. A schematic diagram of this approach is shown in Figure. The distributed algorithm is fairly simple using divide and conquer strategy and is described in Table algorithm is based on Master - Slave protocol. 4 Results 4. The Both the sequential and distributed algorithms have been implemented. We used the PVM communication library to implement the distributed algorithm. PVM was developed at the Oak Ridge National Laboratory [4] and is available as a public domain software. It supports heterogeneous computing. Users call the architecture-independent (transparent) subroutines for passing messages between the nodes. There is no synchronization involved in our algorithm as the slaves are independent of each other. However, the master has to wait for the result from all the slaves before it can start the merge pass. The following data sets are used to evaluate the performance of the genetic algorithm approach.. A set of two-dimensional points shown in Figure. This data set contains two clusters.. A data set on which the K-Means algorithm fails is shown in g.. This data set contains three clusters. 3. A subset of the IRIS data. IRIS dataset is wellknown in the pattern recognition literature. It has four features, 3 classes, and 50 patterns per class. We have chosen only 0 patterns per class. 4. Full IRIS data (50 patterns, 4 features, 3 classes).
4 t:=0; initialize population(t); evaluate population(t); do while (true) t:=t+; p := select parents(t); recombine(p); mutate(p); evaluate population(p); new population := survivors (p,p); end; Table : A simple genetic algorithm. Input: n m?dimensional patterns, and K (the desired number of clusters). Output: Non-overlapping K clusters or a labeling of all the n patterns with labels f : : : Kg. Method: Let P s = population size, k = dlogke, p c = probability of crossover, and p m = probability of mutation.. Coding: Each pattern can take a label of k bits. Hence the string length is nk bits.. Initial Population: Randomly generate P s streams of size Nk bits. 3. For i = to P s, compute tness value of each candidate. 4. Reproduction: Reproduce the i th string proportional to its tness value. 5. Crossover: Each pair of strings undergoes a crossover at randomly chosen positions. 6. Mutation: A mutation is carried out by ipping randomly chosen bits with a probability p m. 7. Repeat steps ({6) for a specied number of generations. Table 3: Sequential GA for clustering.
5 n m-dimensional data points n/p data points n/p data points n/p data points n/p data points PE PE PE (P-) PE P KP Data Points (Cluster centers) Figure : Scheme for a distributed clustering approach. Input: n m-dimensional patterns, and K (the desired number of clusters) Output: K clusters Method:. Data Distribution: Assign n patterns to P processors in a round robin fashion, thus dividing data as evenly as possible.. Computation Phase: Each PE clusters the data set assigned to it using the sequential method described previously. At the end of the run, the result is sent to the Master. 3. Merge Phase: Master collects the PK cluster centers and applies a K-Means algorithm to these PK points. It is assumed that PK << n. 4. Reassignment of labels: Depending on the result of the merge phase, the patterns are assigned a new label to get the nal set of K clusters. Table 4: A coarse-grained parallel GA for clustering.
6 The clusters obtained by the K-Means algorithm for the two synthetic data sets are shown in Figure 3. Using the coarse-grained parallel GA, the clusters obtained for these data sets are shown in Figure 4. The cluster labels for the 30 patterns of IRIS data are shown in Figure 5. For the full IRIS data (50 patterns) the confusion matrices of assigned labels are shown in Table 5 and Table 5 using K-Means and parallel genetic algorithm respectively. Out of 50 patterns, 5 patterns were misclassied by the parallel genetic algorithm in contrast to 6 patterns being misclassied by the K-Means algorithm. Typically, K-Means algorithm is run more than once to verify that the solution obtained does not correspond to a local minima. For large data sets, this can be very costly. For our synthetic data set in Figure 3, with multiple runs of K-Means algorithm, we were able to obtain the correct labels for the three clusters. The total execution time for the full IRIS data set using - 5 workstations is shown in Table 6. For this experiment, we used Sun SPARCstation 0 workstations which were mostly idle during the experiment. The clustering results obtained using GAs is better than the standard K-Means algorithm. The performance in terms of speed is evaluated using the following denition of speedup: Speedup = Exection time on workstation Execution T ime on P workstations : The resulting speedup measure for - 5 workstations is given in Table 6. The best speedup is 4. for 5 workstations. 5 Conclusions and Future Work We have implemented a distributed genetic algorithm for pattern clustering on a workstation cluster. The clustering results are better for the genetic algorithm compared to the K-Means algorithm. The evaluation criteria for the parallel implementation is the ratio of execution time on a single workstation to the execution time on P workstations. The obtained speedup is near linear. We feel that because of our divide and conquer approach, we obtained better results compared to a distributed large population case. We have not addressed the following issues in our implementation: (i) load balancing in case of heterogeneous nodes in the cluster, (ii) fault tolerance, (iii) large data sets, and (iv) advanced GA features such as -point crossover, restricted mating, and other genetic operators such as inversion, reordering, and epistasis [3]. References [] Philippe Andrey and Philippe Tarroux. Unsupervised image segmentation using a distributed genetic algorithm. Pattern Recognition, 7(5):659{ 673, May 994. [] Jerzy Bala and Harry Wechsler. Shape analysis using genetic algorithms. Pattern Recognition Letters, 4():965{973, December 993. [3] R. Bianchini and C. Brown. Parallel Genetic Algorithms on distributed-memory architectures. Technical Report 436, Computer Science Department, The University of Rochester, New ork, 993. [4] Al Geist, Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Manchek, and Vaidy Sunderam. PVM 3 User's guide and reference manual. Oak Ridge National Laboratory, Tennessee, 993. [5] David E. Goldberg. Genetic Algorihms in Search, Optimization, and Machine Learning. Addison- Wesley, New ork, 989. [6] Anil K. Jain and Richard C. Dubes. Algorithms for Clustering Data. Prentice-Hall, Englewood Clis, New Jersy, 988. [7] R. W. Klein and R. C. Dubes. Experiments in projection and clustering by simulated annealing. Pattern Recognition, :3{0, 989. [8] iabo Li and Zhixi Fang. Parallel algorithms for clustering on hypercube SIMD computers. In Proc. of IEEE Computer Vision and Pattern Recognition, pages 30{33, 986. [9] Lionel M. Ni and Anil K. Jain. A VLSI systolic architecture for pattern clustering. IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-7():80{89, January 985. [0] Sanjay Ranka and Sartaj Sahni. Clustering on a hypercube multicomputer. IEEE Trans. on Parallel and Distributed Systems, ():9{37, April 99. [] W. Siedlecki and J. Sklansky. A note on genetic algorithms for large-scale feature selection. Pattern Recognition Letters, 0():335{346, November 989.
7 Figure : Data set used for evaluating GA clustering algorithm. -cluster data; 3-cluster data Figure 3: Results of K-Means algorithm. -cluster data; 3-cluster data Figure 4: Results of Genetic Algorithm. -cluster data; 3-cluster data.
8 Figure 5: Clustering results for 30 patterns from IRIS Data Set. labels by K-Means algorithm; labels by GA-based clustering; Note that patterns have been misclassied by the K-Means algorithm. Assigned Class True Class c c c3 c c 0 48 c Assigned Class True Class c c c3 c 48 0 c 39 0 c Table 5: Confusion Matrix for IRIS dataset. K-Means; Parallel GA. No. of Execution Speedup Workstations Time Table 6: Total Execution Time (in milliseconds).
Heuristic Optimisation
Heuristic Optimisation Part 10: Genetic Algorithm Basics Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic
More informationUnsupervised Learning and Clustering
Unsupervised Learning and Clustering Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Spring 2009 CS 551, Spring 2009 c 2009, Selim Aksoy (Bilkent University)
More informationUnsupervised Learning and Clustering
Unsupervised Learning and Clustering Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Spring 2008 CS 551, Spring 2008 c 2008, Selim Aksoy (Bilkent University)
More informationMOTION ESTIMATION IN MPEG-2 VIDEO ENCODING USING A PARALLEL BLOCK MATCHING ALGORITHM. Daniel Grosu, Honorius G^almeanu
MOTION ESTIMATION IN MPEG-2 VIDEO ENCODING USING A PARALLEL BLOCK MATCHING ALGORITHM Daniel Grosu, Honorius G^almeanu Multimedia Group - Department of Electronics and Computers Transilvania University
More informationA Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2
Chapter 5 A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Graph Matching has attracted the exploration of applying new computing paradigms because of the large number of applications
More informationGenetic Algorithm for Circuit Partitioning
Genetic Algorithm for Circuit Partitioning ZOLTAN BARUCH, OCTAVIAN CREŢ, KALMAN PUSZTAI Computer Science Department, Technical University of Cluj-Napoca, 26, Bariţiu St., 3400 Cluj-Napoca, Romania {Zoltan.Baruch,
More informationDistributed Optimization of Feature Mining Using Evolutionary Techniques
Distributed Optimization of Feature Mining Using Evolutionary Techniques Karthik Ganesan Pillai University of Dayton Computer Science 300 College Park Dayton, OH 45469-2160 Dale Emery Courte University
More informationDepartment of Electrical Engineering, Keio University Hiyoshi Kouhoku-ku Yokohama 223, Japan
Shape Modeling from Multiple View Images Using GAs Satoshi KIRIHARA and Hideo SAITO Department of Electrical Engineering, Keio University 3-14-1 Hiyoshi Kouhoku-ku Yokohama 223, Japan TEL +81-45-563-1141
More information100 Mbps DEC FDDI Gigaswitch
PVM Communication Performance in a Switched FDDI Heterogeneous Distributed Computing Environment Michael J. Lewis Raymond E. Cline, Jr. Distributed Computing Department Distributed Computing Department
More informationNormal mode acoustic propagation models. E.A. Vavalis. the computer code to a network of heterogeneous workstations using the Parallel
Normal mode acoustic propagation models on heterogeneous networks of workstations E.A. Vavalis University of Crete, Mathematics Department, 714 09 Heraklion, GREECE and IACM, FORTH, 711 10 Heraklion, GREECE.
More informationParallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster
Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster Abstract- Traveling Salesman Problem (TSP) is one of the most common studied problems in combinatorial
More informationProceedings of the 1994 ACM/SIGAPP Symposium on Applied Computing March 6-8, 1994, pp , ACM Press.
roceedings of the 99 ACM/SIGA Symposium on Applied Computing March 6-, 99, pp.-7, ACM ress. A ARALLEL ISLAND MODEL GENETIC ALGORITHM FOR THE MULTIROCESSOR SCHEDULING ROBLEM Arthur L. Corcoran Roger L.
More informationGenetic Programming. Charles Chilaka. Department of Computational Science Memorial University of Newfoundland
Genetic Programming Charles Chilaka Department of Computational Science Memorial University of Newfoundland Class Project for Bio 4241 March 27, 2014 Charles Chilaka (MUN) Genetic algorithms and programming
More informationObject classes. recall (%)
Using Genetic Algorithms to Improve the Accuracy of Object Detection Victor Ciesielski and Mengjie Zhang Department of Computer Science, Royal Melbourne Institute of Technology GPO Box 2476V, Melbourne
More informationAn experimental evaluation of a parallel genetic algorithm using MPI
2009 13th Panhellenic Conference on Informatics An experimental evaluation of a parallel genetic algorithm using MPI E. Hadjikyriacou, N. Samaras, K. Margaritis Dept. of Applied Informatics University
More informationProceedings of the First IEEE Conference on Evolutionary Computation - IEEE World Congress on Computational Intelligence, June
Proceedings of the First IEEE Conference on Evolutionary Computation - IEEE World Congress on Computational Intelligence, June 26-July 2, 1994, Orlando, Florida, pp. 829-833. Dynamic Scheduling of Computer
More informationGrid-Based Genetic Algorithm Approach to Colour Image Segmentation
Grid-Based Genetic Algorithm Approach to Colour Image Segmentation Marco Gallotta Keri Woods Supervised by Audrey Mbogho Image Segmentation Identifying and extracting distinct, homogeneous regions from
More informationCHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION
131 CHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION 6.1 INTRODUCTION The Orthogonal arrays are helpful in guiding the heuristic algorithms to obtain a good solution when applied to NP-hard problems. This
More informationMonika Maharishi Dayanand University Rohtak
Performance enhancement for Text Data Mining using k means clustering based genetic optimization (KMGO) Monika Maharishi Dayanand University Rohtak ABSTRACT For discovering hidden patterns and structures
More informationUnsupervised Feature Selection Using Multi-Objective Genetic Algorithms for Handwritten Word Recognition
Unsupervised Feature Selection Using Multi-Objective Genetic Algorithms for Handwritten Word Recognition M. Morita,2, R. Sabourin 3, F. Bortolozzi 3 and C. Y. Suen 2 École de Technologie Supérieure, Montreal,
More informationFrontier Pareto-optimum
Distributed Genetic Algorithms with a New Sharing Approach in Multiobjective Optimization Problems Tomoyuki HIROYASU Mitsunori MIKI Sinya WATANABE Doshisha University, Dept. of Knowledge Engineering and
More informationUniversity of Florida CISE department Gator Engineering. Clustering Part 2
Clustering Part 2 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville Partitional Clustering Original Points A Partitional Clustering Hierarchical
More informationClustering and Visualisation of Data
Clustering and Visualisation of Data Hiroshi Shimodaira January-March 28 Cluster analysis aims to partition a data set into meaningful or useful groups, based on distances between data points. In some
More informationCHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES
CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES 6.1 INTRODUCTION The exploration of applications of ANN for image classification has yielded satisfactory results. But, the scope for improving
More informationCHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM
20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:
More informationMODULE 6 Different Approaches to Feature Selection LESSON 10
MODULE 6 Different Approaches to Feature Selection LESSON 10 Sequential Feature Selection Keywords: Forward, Backward, Sequential, Floating 1 Sequential Methods In these methods, features are either sequentially
More informationNeural Network Weight Selection Using Genetic Algorithms
Neural Network Weight Selection Using Genetic Algorithms David Montana presented by: Carl Fink, Hongyi Chen, Jack Cheng, Xinglong Li, Bruce Lin, Chongjie Zhang April 12, 2005 1 Neural Networks Neural networks
More informationUsing Genetic Algorithm with Triple Crossover to Solve Travelling Salesman Problem
Proc. 1 st International Conference on Machine Learning and Data Engineering (icmlde2017) 20-22 Nov 2017, Sydney, Australia ISBN: 978-0-6480147-3-7 Using Genetic Algorithm with Triple Crossover to Solve
More informationSegmentation of Noisy Binary Images Containing Circular and Elliptical Objects using Genetic Algorithms
Segmentation of Noisy Binary Images Containing Circular and Elliptical Objects using Genetic Algorithms B. D. Phulpagar Computer Engg. Dept. P. E. S. M. C. O. E., Pune, India. R. S. Bichkar Prof. ( Dept.
More informationDept. of Computer Science. The eld of time series analysis and forecasting methods has signicantly changed in the last
Model Identication and Parameter Estimation of ARMA Models by Means of Evolutionary Algorithms Susanne Rolf Dept. of Statistics University of Dortmund Germany Joachim Sprave y Dept. of Computer Science
More informationRowena Cole and Luigi Barone. Department of Computer Science, The University of Western Australia, Western Australia, 6907
The Game of Clustering Rowena Cole and Luigi Barone Department of Computer Science, The University of Western Australia, Western Australia, 697 frowena, luigig@cs.uwa.edu.au Abstract Clustering is a technique
More informationCHAPTER 4 GENETIC ALGORITHM
69 CHAPTER 4 GENETIC ALGORITHM 4.1 INTRODUCTION Genetic Algorithms (GAs) were first proposed by John Holland (Holland 1975) whose ideas were applied and expanded on by Goldberg (Goldberg 1989). GAs is
More informationTopological Machining Fixture Layout Synthesis Using Genetic Algorithms
Topological Machining Fixture Layout Synthesis Using Genetic Algorithms Necmettin Kaya Uludag University, Mechanical Eng. Department, Bursa, Turkey Ferruh Öztürk Uludag University, Mechanical Eng. Department,
More informationA Modified Genetic Algorithm for Task Scheduling in Multiprocessor Systems
A Modified Genetic Algorithm for Task Scheduling in Multiprocessor Systems Yi-Hsuan Lee and Cheng Chen Department of Computer Science and Information Engineering National Chiao Tung University, Hsinchu,
More informationPerformance impact of dynamic parallelism on different clustering algorithms
Performance impact of dynamic parallelism on different clustering algorithms Jeffrey DiMarco and Michela Taufer Computer and Information Sciences, University of Delaware E-mail: jdimarco@udel.edu, taufer@udel.edu
More informationAkaike information criterion).
An Excel Tool The application has three main tabs visible to the User and 8 hidden tabs. The first tab, User Notes, is a guide for the User to help in using the application. Here the User will find all
More informationObject Modeling from Multiple Images Using Genetic Algorithms. Hideo SAITO and Masayuki MORI. Department of Electrical Engineering, Keio University
Object Modeling from Multiple Images Using Genetic Algorithms Hideo SAITO and Masayuki MORI Department of Electrical Engineering, Keio University E-mail: saito@ozawa.elec.keio.ac.jp Abstract This paper
More informationMultiprocessor Scheduling Using Parallel Genetic Algorithm
www.ijcsi.org 260 Multiprocessor Scheduling Using Parallel Genetic Algorithm Nourah Al-Angari 1, Abdullatif ALAbdullatif 2 1,2 Computer Science Department, College of Computer & Information Sciences, King
More informationUsing Genetic Algorithms to Improve Pattern Classification Performance
Using Genetic Algorithms to Improve Pattern Classification Performance Eric I. Chang and Richard P. Lippmann Lincoln Laboratory, MIT Lexington, MA 021739108 Abstract Genetic algorithms were used to select
More informationChapter 14 Global Search Algorithms
Chapter 14 Global Search Algorithms An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Introduction We discuss various search methods that attempts to search throughout the entire feasible set.
More informationThe k-means Algorithm and Genetic Algorithm
The k-means Algorithm and Genetic Algorithm k-means algorithm Genetic algorithm Rough set approach Fuzzy set approaches Chapter 8 2 The K-Means Algorithm The K-Means algorithm is a simple yet effective
More informationUsing a genetic algorithm for editing k-nearest neighbor classifiers
Using a genetic algorithm for editing k-nearest neighbor classifiers R. Gil-Pita 1 and X. Yao 23 1 Teoría de la Señal y Comunicaciones, Universidad de Alcalá, Madrid (SPAIN) 2 Computer Sciences Department,
More informationIntroduction to Design Optimization: Search Methods
Introduction to Design Optimization: Search Methods 1-D Optimization The Search We don t know the curve. Given α, we can calculate f(α). By inspecting some points, we try to find the approximated shape
More informationNetwork. Department of Statistics. University of California, Berkeley. January, Abstract
Parallelizing CART Using a Workstation Network Phil Spector Leo Breiman Department of Statistics University of California, Berkeley January, 1995 Abstract The CART (Classication and Regression Trees) program,
More informationGenetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
28 Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree 1 Tanu Gupta, 2 Anil Kumar 1 Research Scholar, IFTM, University, Moradabad, India. 2 Sr. Lecturer, KIMT, Moradabad, India. Abstract Many
More informationActive contour: a parallel genetic algorithm approach
id-1 Active contour: a parallel genetic algorithm approach Florence Kussener 1 1 MathWorks, 2 rue de Paris 92196 Meudon Cedex, France Florence.Kussener@mathworks.fr Abstract This paper presents an algorithm
More informationRevision of a Floating-Point Genetic Algorithm GENOCOP V for Nonlinear Programming Problems
4 The Open Cybernetics and Systemics Journal, 008,, 4-9 Revision of a Floating-Point Genetic Algorithm GENOCOP V for Nonlinear Programming Problems K. Kato *, M. Sakawa and H. Katagiri Department of Artificial
More informationIntroduction (7.1) Genetic Algorithms (GA) (7.2) Simulated Annealing (SA) (7.3) Random Search (7.4) Downhill Simplex Search (DSS) (7.
Chapter 7: Derivative-Free Optimization Introduction (7.1) Genetic Algorithms (GA) (7.2) Simulated Annealing (SA) (7.3) Random Search (7.4) Downhill Simplex Search (DSS) (7.5) Jyh-Shing Roger Jang et al.,
More informationsizes. Section 5 briey introduces some of the possible applications of the algorithm. Finally, we draw some conclusions in Section 6. 2 MasPar Archite
Parallelization of 3-D Range Image Segmentation on a SIMD Multiprocessor Vipin Chaudhary and Sumit Roy Bikash Sabata Parallel and Distributed Computing Laboratory SRI International Wayne State University
More informationISSN: [Keswani* et al., 7(1): January, 2018] Impact Factor: 4.116
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY AUTOMATIC TEST CASE GENERATION FOR PERFORMANCE ENHANCEMENT OF SOFTWARE THROUGH GENETIC ALGORITHM AND RANDOM TESTING Bright Keswani,
More informationParallel Implementation of a Unied Approach to. Image Focus and Defocus Analysis on the Parallel Virtual Machine
Parallel Implementation of a Unied Approach to Image Focus and Defocus Analysis on the Parallel Virtual Machine Yen-Fu Liu, Nai-Wei Lo, Murali Subbarao, Bradley S. Carlson yiu@sbee.sunysb.edu, naiwei@sbee.sunysb.edu
More informationGenetic Algorithm and Simulated Annealing based Approaches to Categorical Data Clustering
Genetic Algorithm and Simulated Annealing based Approaches to Categorical Data Clustering Indrajit Saha and Anirban Mukhopadhyay Abstract Recently, categorical data clustering has been gaining significant
More informationHardware Implementation of GA.
Chapter 6 Hardware Implementation of GA Matti Tommiska and Jarkko Vuori Helsinki University of Technology Otakaari 5A, FIN-02150 ESPOO, Finland E-mail: Matti.Tommiska@hut.fi, Jarkko.Vuori@hut.fi Abstract.
More informationFast Efficient Clustering Algorithm for Balanced Data
Vol. 5, No. 6, 214 Fast Efficient Clustering Algorithm for Balanced Data Adel A. Sewisy Faculty of Computer and Information, Assiut University M. H. Marghny Faculty of Computer and Information, Assiut
More informationAN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING
International Journal of Latest Research in Science and Technology Volume 3, Issue 3: Page No. 201-205, May-June 2014 http://www.mnkjournals.com/ijlrst.htm ISSN (Online):2278-5299 AN EVOLUTIONARY APPROACH
More information1 Case study of SVM (Rob)
DRAFT a final version will be posted shortly COS 424: Interacting with Data Lecturer: Rob Schapire and David Blei Lecture # 8 Scribe: Indraneel Mukherjee March 1, 2007 In the previous lecture we saw how
More informationSYDE Winter 2011 Introduction to Pattern Recognition. Clustering
SYDE 372 - Winter 2011 Introduction to Pattern Recognition Clustering Alexander Wong Department of Systems Design Engineering University of Waterloo Outline 1 2 3 4 5 All the approaches we have learned
More informationDERIVATIVE-FREE OPTIMIZATION
DERIVATIVE-FREE OPTIMIZATION Main bibliography J.-S. Jang, C.-T. Sun and E. Mizutani. Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence. Prentice Hall, New Jersey,
More informationActive Motion Detection and Object Tracking. Joachim Denzler and Dietrich W.R.Paulus.
0 Active Motion Detection and Object Tracking Joachim Denzler and Dietrich W.R.Paulus denzler,paulus@informatik.uni-erlangen.de The following paper was published in the Proceedings on the 1 st International
More informationSelection of Location, Frequency and Orientation Parameters of 2D Gabor Wavelets for Face Recognition
Selection of Location, Frequency and Orientation Parameters of 2D Gabor Wavelets for Face Recognition Berk Gökberk, M.O. İrfanoğlu, Lale Akarun, and Ethem Alpaydın Boğaziçi University, Department of Computer
More informationA Framework for Parallel Genetic Algorithms on PC Cluster
A Framework for Parallel Genetic Algorithms on PC Cluster Guangzhong Sun, Guoliang Chen Department of Computer Science and Technology University of Science and Technology of China (USTC) Hefei, Anhui 230027,
More informationAn adaptive genetic algorithm for dynamically reconfigurable modules allocation
An adaptive genetic algorithm for dynamically reconfigurable modules allocation Vincenzo Rana, Chiara Sandionigi, Marco Santambrogio and Donatella Sciuto chiara.sandionigi@dresd.org, {rana, santambr, sciuto}@elet.polimi.it
More informationA Genetic Algorithm for Multiprocessor Task Scheduling
A Genetic Algorithm for Multiprocessor Task Scheduling Tashniba Kaiser, Olawale Jegede, Ken Ferens, Douglas Buchanan Dept. of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB,
More informationA Real Coded Genetic Algorithm for Data Partitioning and Scheduling in Networks with Arbitrary Processor Release Time
A Real Coded Genetic Algorithm for Data Partitioning and Scheduling in Networks with Arbitrary Processor Release Time S. Suresh 1, V. Mani 1, S. N. Omkar 1, and H. J. Kim 2 1 Department of Aerospace Engineering,
More informationCHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN
97 CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN 5.1 INTRODUCTION Fuzzy systems have been applied to the area of routing in ad hoc networks, aiming to obtain more adaptive and flexible
More informationIn Proc of 4th Int'l Conf on Parallel Problem Solving from Nature New Crossover Methods for Sequencing Problems 1 Tolga Asveren and Paul Molito
0 NEW CROSSOVER METHODS FOR SEQUENCING PROBLEMS In Proc of 4th Int'l Conf on Parallel Problem Solving from Nature 1996 1 New Crossover Methods for Sequencing Problems 1 Tolga Asveren and Paul Molitor Abstract
More informationDesign Optimization of Hydroformed Crashworthy Automotive Body Structures
Design Optimization of Hydroformed Crashworthy Automotive Body Structures Akbar Farahani a, Ronald C. Averill b, and Ranny Sidhu b a Engineering Technology Associates, Troy, MI, USA b Red Cedar Technology,
More information4.12 Generalization. In back-propagation learning, as many training examples as possible are typically used.
1 4.12 Generalization In back-propagation learning, as many training examples as possible are typically used. It is hoped that the network so designed generalizes well. A network generalizes well when
More informationRobust Object Segmentation Using Genetic Optimization of Morphological Processing Chains
Robust Object Segmentation Using Genetic Optimization of Morphological Processing Chains S. RAHNAMAYAN 1, H.R. TIZHOOSH 2, M.M.A. SALAMA 3 1,2 Department of Systems Design Engineering 3 Department of Electrical
More informationREAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN
REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION Nedim TUTKUN nedimtutkun@gmail.com Outlines Unconstrained Optimization Ackley s Function GA Approach for Ackley s Function Nonlinear Programming Penalty
More informationGraph Matching: Fast Candidate Elimination Using Machine Learning Techniques
Graph Matching: Fast Candidate Elimination Using Machine Learning Techniques M. Lazarescu 1,2, H. Bunke 1, and S. Venkatesh 2 1 Computer Science Department, University of Bern, Switzerland 2 School of
More informationJHPCSN: Volume 4, Number 1, 2012, pp. 1-7
JHPCSN: Volume 4, Number 1, 2012, pp. 1-7 QUERY OPTIMIZATION BY GENETIC ALGORITHM P. K. Butey 1, Shweta Meshram 2 & R. L. Sonolikar 3 1 Kamala Nehru Mahavidhyalay, Nagpur. 2 Prof. Priyadarshini Institute
More informationAN IMPROVED K-MEANS CLUSTERING ALGORITHM FOR IMAGE SEGMENTATION
AN IMPROVED K-MEANS CLUSTERING ALGORITHM FOR IMAGE SEGMENTATION WILLIAM ROBSON SCHWARTZ University of Maryland, Department of Computer Science College Park, MD, USA, 20742-327, schwartz@cs.umd.edu RICARDO
More informationMultiobjective Data Clustering
To appear in IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Multiobjective Data Clustering Martin H. C. Law Alexander P. Topchy Anil K. Jain Department of Computer Science
More informationEnergy Efficient Genetic Algorithm Model for Wireless Sensor Networks
Energy Efficient Genetic Algorithm Model for Wireless Sensor Networks N. Thangadurai, Dr. R. Dhanasekaran, and R. Pradeep Abstract Wireless communication has enable to develop minimum energy consumption
More informationGenetic Model Optimization for Hausdorff Distance-Based Face Localization
c In Proc. International ECCV 2002 Workshop on Biometric Authentication, Springer, Lecture Notes in Computer Science, LNCS-2359, pp. 103 111, Copenhagen, Denmark, June 2002. Genetic Model Optimization
More informationNetwork Routing Protocol using Genetic Algorithms
International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:0 No:02 40 Network Routing Protocol using Genetic Algorithms Gihan Nagib and Wahied G. Ali Abstract This paper aims to develop a
More informationUsing Genetic Algorithms in Integer Programming for Decision Support
Doi:10.5901/ajis.2014.v3n6p11 Abstract Using Genetic Algorithms in Integer Programming for Decision Support Dr. Youcef Souar Omar Mouffok Taher Moulay University Saida, Algeria Email:Syoucef12@yahoo.fr
More informationMINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS
Proceedings of Student/Faculty Research Day, CSIS, Pace University, May 5 th, 2006 MINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS Richard
More informationAutomata Construct with Genetic Algorithm
Automata Construct with Genetic Algorithm Vít Fábera Department of Informatics and Telecommunication, Faculty of Transportation Sciences, Czech Technical University, Konviktská 2, Praha, Czech Republic,
More informationUsing implicit fitness functions for genetic algorithm-based agent scheduling
Using implicit fitness functions for genetic algorithm-based agent scheduling Sankaran Prashanth, Daniel Andresen Department of Computing and Information Sciences Kansas State University Manhattan, KS
More informationThe Simple Genetic Algorithm Performance: A Comparative Study on the Operators Combination
INFOCOMP 20 : The First International Conference on Advanced Communications and Computation The Simple Genetic Algorithm Performance: A Comparative Study on the Operators Combination Delmar Broglio Carvalho,
More informationConstrained Functions of N Variables: Non-Gradient Based Methods
onstrained Functions of N Variables: Non-Gradient Based Methods Gerhard Venter Stellenbosch University Outline Outline onstrained Optimization Non-gradient based methods Genetic Algorithms (GA) Particle
More informationSuppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you?
Gurjit Randhawa Suppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you? This would be nice! Can it be done? A blind generate
More informationGenetic algorithm-based clustering technique
Pattern Recognition 33 (2000) 1455}1465 Genetic algorithm-based clustering technique Ujjwal Maulik, Sanghamitra Bandyopadhyay * Department of Computer Science, Government Engineering College, Kalyani,
More informationGenetic Approach to Parallel Scheduling
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 13, Issue 4 (Jul. - Aug. 2013), PP 20-29 Genetic Approach to Parallel Scheduling Prashant Sharma 1, Gurvinder
More informationPARALLEL GENETIC ALGORITHMS IMPLEMENTED ON TRANSPUTERS
PARALLEL GENETIC ALGORITHMS IMPLEMENTED ON TRANSPUTERS Viktor Nìmec, Josef Schwarz Technical University of Brno Faculty of Engineering and Computer Science Department of Computer Science and Engineering
More informationThe Parallel Software Design Process. Parallel Software Design
Parallel Software Design The Parallel Software Design Process Deborah Stacey, Chair Dept. of Comp. & Info Sci., University of Guelph dastacey@uoguelph.ca Why Parallel? Why NOT Parallel? Why Talk about
More informationComparative Study Of Different Data Mining Techniques : A Review
Volume II, Issue IV, APRIL 13 IJLTEMAS ISSN 7-5 Comparative Study Of Different Data Mining Techniques : A Review Sudhir Singh Deptt of Computer Science & Applications M.D. University Rohtak, Haryana sudhirsingh@yahoo.com
More informationAutomated Clustering-Based Workload Characterization
Automated Clustering-Based Worload Characterization Odysseas I. Pentaalos Daniel A. MenascŽ Yelena Yesha Code 930.5 Dept. of CS Dept. of EE and CS NASA GSFC Greenbelt MD 2077 George Mason University Fairfax
More informationLecture 4: Principles of Parallel Algorithm Design (part 4)
Lecture 4: Principles of Parallel Algorithm Design (part 4) 1 Mapping Technique for Load Balancing Minimize execution time Reduce overheads of execution Sources of overheads: Inter-process interaction
More informationComparative Study on VQ with Simple GA and Ordain GA
Proceedings of the 9th WSEAS International Conference on Automatic Control, Modeling & Simulation, Istanbul, Turkey, May 27-29, 2007 204 Comparative Study on VQ with Simple GA and Ordain GA SADAF SAJJAD
More informationDesign of an Optimal Nearest Neighbor Classifier Using an Intelligent Genetic Algorithm
Design of an Optimal Nearest Neighbor Classifier Using an Intelligent Genetic Algorithm Shinn-Ying Ho *, Chia-Cheng Liu, Soundy Liu, and Jun-Wen Jou Department of Information Engineering, Feng Chia University,
More information336 THE STATISTICAL SOFTWARE NEWSLETTER where z is one (randomly taken) pole of the simplex S, g the centroid of the remaining d poles of the simplex
THE STATISTICAL SOFTWARE NEWSLETTER 335 Simple Evolutionary Heuristics for Global Optimization Josef Tvrdk and Ivan Krivy University of Ostrava, Brafova 7, 701 03 Ostrava, Czech Republic Phone: +420.69.6160
More informationThe Genetic Algorithm for finding the maxima of single-variable functions
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding
More informationSPR. stochastic deterministic stochastic SA beam search GA
Feature Selection: Evaluation, Application, and Small Sample Performance Anil Jain Department of Computer Science Michigan State University East Lansing, Michigan, USA Douglas Zongker Department of Computer
More informationMulti-objective pattern and feature selection by a genetic algorithm
H. Ishibuchi, T. Nakashima: Multi-objective pattern and feature selection by a genetic algorithm, Proc. of Genetic and Evolutionary Computation Conference (Las Vegas, Nevada, U.S.A.) pp.1069-1076 (July
More informationAn Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid
An Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid Demin Wang 2, Hong Zhu 1, and Xin Liu 2 1 College of Computer Science and Technology, Jilin University, Changchun
More informationMarch 19, Heuristics for Optimization. Outline. Problem formulation. Genetic algorithms
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland March 19, 2014
More informationTowards Automatic Recognition of Fonts using Genetic Approach
Towards Automatic Recognition of Fonts using Genetic Approach M. SARFRAZ Department of Information and Computer Science King Fahd University of Petroleum and Minerals KFUPM # 1510, Dhahran 31261, Saudi
More information