14466555
Network Optimization based on Genetic Algorithm and Estimation of Distribution Algorithm
Genetic algorithm (GA) is a kind of algorithm that simulates the process and the mechanism of the evolution. Because of its unique biologic feature and its suitability to any function, it becomes very popular and has been used in many problems in many fields. Estimation of distribution algorithm (EDA) is an algorithm that is generated from the GAs. Comparing with GAs, the EDAs replace the crossover and the mutation operations in GAs with learning and sampling the probability distribution of the best individuals of the population at each iteration of the algorithm. Because of its superior, it becomes a hot topic recently. Based on the former researches, this paper mainly focuses on solving the problem of one primary network model named all-terminal network model using the strategies of the evolutionary algorithms.
11689877
A Projection and Search Algorithm for the Bicluster Problem
The advent of microarray technologies has made the experimental study of gene expression faster and more efficient. It is an important task to analyze the gene expression data acquired from the microarray experiments. Biclustering is a popular method to search a subset of genes which exhibit similar expression patterns along a subset of conditions in the gene expression matrix. In this paper, we propose a projection and search algorithm (PSA) for finding biclusters in the gene expression matrix. The algorithm adopts projection method to find a raw submatrix, then refines and extends the raw submatrix into a bicluster using greedy algorithms. We test the algorithm on simulation data and real data. The test results show that the algorithm has good performance on both simulation data and real data. Additionally, compared with other methods, PSA isnpsilat sensitive to noise level.
10188810
Estimation Distribution of Algorithm for Fuzzy Clustering Gene Expression Data
With the rapid development of genome projects, clustering of gene expression data is a crucial step in analyzing gene function and relationship of conditions. In this paper, we put forward an estimation of distribution algorithm for fuzzy clustering gene expression data, which combines estimation of distribution algorithms and fuzzy logic. Comparing with sGA, our method can avoid many parameters and can converge quickly. Tests on real data show that EDA converges ten times as fast as sGA does in clustering gene expression data. For clustering accuracy, EDA can get a more reasonable result than sGA does in the worst situations although both methods can get the best results in the best situations.
27471784
A Novel Greedy Bayesian Network Structure Learning Algorithm for Limited Data
Existing algorithms for learning Bayesian network (BN) require a lot of computation on high dimensional itemsets, which affects accuracy especially on limited datasets and takes up a large amount of time. To alleviate the above problem, we propose a novel BN learning algorithm MRMRG, Max Relevance and Min Redundancy Greedy algorithm. MRMRG algorithm is a variant of K2 algorithm for learning BNs from limited datasets. MRMRG algorithm applies Max Relevance and Min Redundancy feature selection technique and proposes Local Bayesian Increment (LBI) function according to the Bayesian Information Criterion (BIC) formula and the likelihood property of overfitting. Experimental results show that MRMRG algorithm has much better efficiency and accuracy than most of existing BN learning algorithms when learning BNs from limited datasets.
5701196
An Architecture for Supporting Network Fault Recovery Management
Highly available and resilient networks play a decisive role in today's networked world. As network faults are inevitable and networks are becoming constantly intricate, finding effective fault recovery solutions in a timely manner is becoming a challenging task for administrators. Therefore, an automated mechanism to support fault resolution is essential towards efficient fault handling process. In this paper we propose an architecture to support automated fault recovery in terms of traffic engineering, recovery knowledge discovery and automated recovery planning. We base our discussion on an application scenario for recovery from border router failure to maintain optimized configuration of outbound inter-domain traffic.
10413997
The Max-Relevance and Min-Redundancy Greedy Bayesian Network Learning Algorithm
Existing algorithms for learning Bayesian network require a lot of computation on high dimensional itemsets which affects reliability, robustness and accuracy of these algorithms and takes up a large amount of time. To address the above problem, we propose a new Bayesian network learning algorithm MRMRG, Max Relevance-Min Redundancy Greedy. MRMRG algorithm is a variant of K2 which is a well-known BN learning algorithm. We also analyze the time complexity of MRMRG. The experimental results show that MRMRG algorithm has much better efficiency. It is also shown that MRMRG algorithm has better accuracy than most of existing learning algorithms for limited sample datasets.
37555026
Incomplete motion feature tracking algorithm in video sequences
To effectively track incomplete motion features, a novel feature tracking algorithm for motion capture is presented. According to feature attributes and relationship among features, extracted features are classified as four types of features. Then different strategies are applied to track different kinds of features. To verify the tracks, cross correlation test and predicted 3D model based test are used to test and remove outliers. Experimental results demonstrate the effectiveness of our algorithm.
18928608
An Improved Particle Swarm Optimizer for Truss Structure Optimization
This paper presents an improved particle swarm optimizer (IPSO) for solving truss structure optimization problems. The algorithm is based on the particle swarm optimizer with passive congregation (PSOPC) and a harmony search (HS) scheme. It handles the problem-specified constraints using a 'fly-back mechanism' method and the variables' constraints using the harmony search scheme. The IPSO is tested on a planar truss structure optimization problem and is compared with the PSO and the PSOPC algorithm respectively. The result shows that the IPSO method presented in this paper is able to accelerate the convergence rate effectively and has the fastest convergence rate among these three other algorithms