scholarly journals Evolutionary Algorithms for Robust Density-Based Data Clustering

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Amit Banerjee

Density-based clustering methods are known to be robust against outliers in data; however, they are sensitive to user-specified parameters, the selection of which is not trivial. Moreover, relational data clustering is an area that has received considerably less attention than object data clustering. In this paper, two approaches to robust density-based clustering for relational data using evolutionary computation are investigated.

2021 ◽  
Vol 22 (S6) ◽  
Author(s):  
Rui-Yi Li ◽  
Jihong Guan ◽  
Shuigeng Zhou

Abstract Background The rapid development of single-cell RNA sequencing (scRNA-seq) enables the exploration of cell heterogeneity, which is usually done by scRNA-seq data clustering. The essence of scRNA-seq data clustering is to group cells by measuring the similarities among genes/transcripts of cells. And the selection of features for cell similarity evaluation is of great importance, which will significantly impact clustering effectiveness and efficiency. Results In this paper, we propose a novel method called CaFew to select genes based on cluster-aware feature weighting. By optimizing the clustering objective function, CaFew obtains a feature weight matrix, which is further used for feature selection. The genes have large weights in at least one cluster or the genes whose weights vary greatly in different clusters are selected. Experiments on 8 real scRNA-seq datasets show that CaFew can obviously improve the clustering performance of existing scRNA-seq data clustering methods. Particularly, the combination of CaFew with SC3 achieves the state-of-art performance. Furthermore, CaFew also benefits the visualization of scRNA-seq data. Conclusion CaFew is an effective scRNA-seq data clustering method due to its gene selection mechanism based on cluster-aware feature weighting, and it is a useful tool for scRNA-seq data analysis.


1996 ◽  
Vol 4 (1) ◽  
pp. 1-32 ◽  
Author(s):  
Zbigniew Michalewicz ◽  
Marc Schoenauer

Evolutionary computation techniques have received a great deal of attention regarding their potential as optimization techniques for complex numerical functions. However, they have not produced a significant breakthrough in the area of nonlinear programming due to the fact that they have not addressed the issue of constraints in a systematic way. Only recently have several methods been proposed for handling nonlinear constraints by evolutionary algorithms for numerical optimization problems; however, these methods have several drawbacks, and the experimental results on many test cases have been disappointing. In this paper we (1) discuss difficulties connected with solving the general nonlinear programming problem; (2) survey several approaches that have emerged in the evolutionary computation community; and (3) provide a set of 11 interesting test cases that may serve as a handy reference for future methods.


2016 ◽  
Vol 24 (4) ◽  
pp. 667-694 ◽  
Author(s):  
Stjepan Picek ◽  
Claude Carlet ◽  
Sylvain Guilley ◽  
Julian F. Miller ◽  
Domagoj Jakobovic

The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.


2018 ◽  
Vol 33 (3) ◽  
pp. 193-212
Author(s):  
Bùi Thu Lâm

Evolutionary computation (EC) has been a fascinating branch of computation inspiredby a natural phenomenal of evolution. EC enables computer scientists to design eective algorithmsdealing dicult problems. This paper focuses on a special class problem called multi-objective optimizationproblems and evolutionary algorithms designed for it. We will overview the development ofmulti-objective evolutionary algorithms (MOEAs) over the years and problem diculties and thenindicate the open problems in this area. Our chief goal is to provide readers reference material in thearea of multi-objective evolutionary algorithms


Sign in / Sign up

Export Citation Format

Share Document