اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Hybrid Multi Objective Particle Swarm Optimization Method to Discover Biclusters in Microarray Data
201
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In recent years, with the development of microarray technique, discovery of useful knowledge from microarray data has become very important. Biclustering is a very useful data mining technique for discovering genes which have similar behavior. In microarray data, several objectives have to be optimized simultaneously and often these objectives are in conflict with each other. A Multi Objective model is capable of solving such problems. Our method proposes a Hybrid algorithm which is based on the Multi Objective Particle Swarm Optimization for discovering biclusters in gene expression data. In our method, we will consider a low level of overlapping amongst the biclusters and try to cover all elements of the gene expression matrix. Experimental results in the bench mark database show a significant improvement in both overlap among biclusters and coverage of elements in the gene expression matrix.
قيم البحث
اقرأ أيضاً
We consider an optimization deployment problem of multistatic radar system (MSRS). Through the antenna placing and the transmitted power allocating, we optimally deploy the MSRS for two goals: 1) the first one is to improve the coverage ratio of surv
eillance region; 2) the second goal is to get a even distribution of signal energy in surveillance region. In two typical working modes of MSRS, we formulate the optimization problem by introducing two objective functions according to the two mentioned goals, respectively. Addressing on two main challenges of applying multi-objective particle swarm optimization (MOPSO) in solving the proposed optimization problem, we propose a deployment algorithm based on multiobjective particle swarm optimization with non-dominated relative crowding distance (MOPSO-NRCD). For the challenge of value difference, we propose a novel selection method with a non-dominated relative crowding distance. For the challenge of particle allocation, a multi-swarm structure of MOPSO is also introduced. Finally, simulation results are given out to prove the advantages and validity of the proposed deployment algorithm. It is shown that with same number of employed particles, the proposed MOPSO-NRCD algorithm can achieve better optimization performance than that of traditional multiobjective particle swarm optimization with crowding distance (MOPSO-CD).
In transportation planning and development, transport network design problem seeks to optimize specific objectives (e.g. total travel time) through choosing among a given set of projects while keeping consumption of resources (e.g. budget) within the
ir limits. Due to the numerous cases of choosing projects, solving such a problem is very difficult and time-consuming. Based on particle swarm optimization (PSO) technique, a heuristic solution algorithm for the bi-level problem is designed. This paper evaluates the algorithm performance in the response of changing certain basic PSO parameters.
Application of the multi-objective particle swarm optimisation (MOPSO) algorithm to design of water distribution systems is described. An earlier MOPSO algorithm is augmented with (a) local search, (b) a modified strategy for assigning the leader, an
d (c) a modified mutation scheme. For one of the benchmark problems described in the literature, the effect of each of the above features on the algorithm performance is demonstrated. The augmented MOPSO algorithm (called MOPSO+) is applied to five benchmark problems, and in each case, it finds non-dominated solutions not reported earlier. In addition, for the purpose of comparing Pareto fronts (sets of non-dominated solutions) obtained by different algorithms, a new criterion is suggested, and its usefulness is pointed out with an example. Finally, some suggestions regarding future research directions are made.
Machine learning techniques have been developed to learn from complete data. When missing values exist in a dataset, the incomplete data should be preprocessed separately by removing data points with missing values or imputation. In this paper, we pr
opose an online approach to handle missing values while a classification model is learnt. To reach this goal, we develop a multi-objective optimization model with two objective functions for imputation and model selection. We also propose three formulations for imputation objective function. We use an evolutionary algorithm based on NSGA II to find the optimal solutions as the Pareto solutions. We investigate the reliability and robustness of the proposed model using experiments by defining several scenarios in dealing with missing values and classification. We also describe how the proposed model can contribute to medical informatics. We compare the performance of three different formulations via experimental results. The proposed model results get validated by comparing with a comparable literature.
This paper provides an extended level set (X-LS) based topology optimiza- tion method for multi material design. In the proposed method, each zero level set of a level set function {phi}ij represents the boundary between materials i and j. Each incre
ase or decrease of {phi}ij corresponds to a material change between the two materials. This approach reduces the dependence of the initial configuration in the optimization calculation and simplifies the sensitivity analysis. First, the topology optimization problem is formulated in the X-LS representation. Next, the reaction-diffusion equation that updates the level set function is introduced, and an optimization algorithm that solves the equilibrium equations and the reaction-diffusion equation using the fi- nite element method is constructed. Finally, the validity and utility of the proposed topology optimization method are confirmed using two- and three- dimensional numerical examples.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
