The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A high rate of expression of Endothelin protein in the placental cell is very much regulated by inhalation of tobacco smoke and leads to placental abnormalities subjected to birth failure. Our application developed using Image Processing, Nearest Neighbor algorithm (NN) and Genetic Algorithms (GA), automates the study of these proteins to assist pathologists and lab technicians in achieving a more...
We present an efficient genetic algorithm for mining multi-objective rules from large databases. Multi-objectives will conflict with each other, which makes it optimization problem that is very difficult to solve simultaneously. We propose a multi-objective evolutionary algorithm called improved niched Pareto genetic algorithm(INPGA), which not only accurate selects the candidates but also saves selection...
This study proposes a novel classification technique of GA/k-prototypes in combination with a genetic algorithm to take the advantage of k-prototypes clustering mechanism for supporting the classification purpose. A genetic algorithm is used to adjust the weight applied to input attributes in order to enable a majority of the data records in each cluster to be with the same outcome class. We conduct...
An attempt has been made in the paper to find globally optimal cluster centers for remote-sensed images with the proposed Rapid Genetic k-Means algorithm. The idea is to avoid the expensive crossover or fitness to produce valid clusters in pure GA and to improve the convergence time. The drawback of using pure GA in the problem is the usage of an expensive crossover or fitness to produce valid clusters...
In this analysis a process to demarcate areas with analogous wind conditions is shown. For this purpose a dispersion graph between the wind directions will be traced for all stations placed in the studied zone. These distributions will be compared among themselves using the centroids extracted with SOFM algorithm. This information will be used to build a matrix, allowing us working simultaneously...
From the view of granularity, this paper presents a genetic clustering algorithm based on dynamic granularity. In view of a parallel, random search, global optimization and diversity characteristics of genetic algorithm, it is combined with dynamic granularity model. In the process of granularity changing, appropriate granulation can be made by coarsening and refining the granularity, which can ensure...
The decision tree based on the k-means algorithm has recently been proposed. However, the drawback of the k-means algorithm is that the users must determine the number of branches for each node before the decision tree is designed. The users are usually hard to determine the number of branches for each node. In this study, the new decision tree with variable-branches is proposed. The genetic algorithm...
A major problem with text classification problems is the high dimensionality of the feature space. This paper investigates how genetic algorithm and k-means algorithm can help select relevant features in text classification. which uses the genetic algorithm (GA) optimization features to implement global searching, and uses k-means algorithm to selection operation to control the scope of the search,...
To improve the accuracy of clustering classification, the Chaos Genetic Algorithm was proposed. In this algorithm, the ergodic property of chaos phenomenon is used to optimize the initial population, so it can accelerate the convergence of Genetic Algorithms. Chaotic systems are sensitive to initial condition system parameters. In order to escape from local optimums, the chaos operator was applied...
In dealing with such defects of the genetic FCM (Fuzzy C-Means) clustering algorithm as long calculating time and poor clustering results, this paper proposes an improved algorithm which improves the crossover, selection, and mutation parts of the GA (genetic algorithm), enhances its global searching capability and eases the difficulty in setting up genetic parameters. At the same time, this improved...
The clustering ensemble is a new topic in machine learning. It can combine multiple partitions generated by different clustering algorithms into a single clustering solution. Genetic algorithms have been known as methods with high ability to find the solution of optimization problems like the clustering ensemble problem. So far, many contributions have been done to find consensus cluster partition...
That traditional K-mean algorithm is a widely used clustering algorithm, with a wide application. In light of the disadvantage of K-mean algorithm, improvement is made to the traditional K-mean algorithm, a k value learning algorithm is proposed. Using genetic algorithm to optimize the K value, and improve clustering performance.
Traditional Fuzzy c-means (FCM) algorithm is commonly used in unsupervised learning. However, there are some limitations. Cluster number should be determined and the cluster center should be initialized before classification. A new algorithm is proposed in the paper. The best cluster number is obtained by analyzing cluster validity function and the cluster center is initialized by HCM. The data set...
This paper proposes an effective clustering algorithm for databases, which are benchmark data sets of data mining applications. We present a Genetic Clustering Algorithm (GCA) that finds a globally optimal partition of a given data sets into a specified number of clusters. The algorithm is distance-based and creates centroids. To evaluate the proposed algorithm, we use some artificial data sets and...
A novel algorithm, the k-means clustering algorithm based on immune genetic algorithm (KMCIGA) is put forward. To improve the Genetic operators, the conception of concentration in the immune algorithm and the dynamic chromosome coding are used. Strategies and methods of selecting vaccines and constructing an immune operator are also given. KMCIGA is illustrated to be obviously better than the traditional...
In this paper, linking with the basic principle of FCM algorithm, on the basis of theory research, a method of the cluster analysis that FCM and the genetic algorithm are combined together is proposed. Firstly, the approximate optimal solution obtained by the genetic algorithm is taken as the original value of the FCM algorithm, then carrying on the local search to obtain the global optimal solution,...
Aiming to the shortages of fuzzy c-means clustering applied to pattern recognition, an improved method by genetic algorithm is proposed. This method can not only automatically optimizes the classification number, but also search the global optimal solution for the clustering center. The experimental results demonstrate this proposed method is excellent for pattern recognition.
Fuzzy K-prototypes is a very efficient algorithm for processing large scale mixed data set, but the selection of initial clustering center has an important impact on the clustering effect of algorithm. FKP algorithm is improved by using genetic algorithm in this paper. Seeking the initial clustering center for fuzzy K-prototypes algorithm by using genetic algorithm overcomes the shortcoming effectively,...
A constructing method of fuzzy classifier using kernel k-means clustering algorithm is introduced in this paper. This constructing method are divided into three phases, namely clustering phase, fuzzy rule created phase and parameters modified phase. Firstly, the original sample space is mapped into a high dimensional feature space by selecting appropriate kernel function. In the feature space, training...
To select a minimal and effective subset from a mass of bands is the key issue of the study on hyperspectral image classification. This paper put forwards a novel band selection algorithm, which combines mutual information-based grouping method and genetic algorithm. The proposed algorithm reduces the computation cost significantly, as well as keeps a better precision. In addition, resampling based...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.