A new algorithm for constrained multi-objective optimization is presented. The algorithm treats the constraints as an objective and the immune clone and immune memory mechanism are introduced. Therefore, the new algor...
详细信息
A new algorithm for constrained multi-objective optimization is presented. The algorithm treats the constraints as an objective and the immune clone and immune memory mechanism are introduced. Therefore, the new algorithm could find the Pareto-optimal solutions from the feasible region and the edge of the infeasible region, which assures both the convergence and diversity of the obtained solutions. Simulation results show that the new algorithm has much better performance in finding a much better spread of solutions, in maintaining a better uniformity of the solutions and in obtaining a better convergence.
This paper proposes a novel inductive semi-supervised algorithm for web page classification named GCo-training, exploiting texts in web pages and hyperlinks among them. GCo-training iteratively trains two classifiers-...
详细信息
This paper proposes a novel inductive semi-supervised algorithm for web page classification named GCo-training, exploiting texts in web pages and hyperlinks among them. GCo-training iteratively trains two classifiers-a graph-based semi-supervised classifier based on hyperlinks among web pages and a Bayes classifier based on texts in web pages, under the framework of Co-training. On the one hand, the graph-based semi-supervised classifier obtains high accuracy based on a small set of labeled examples through exploiting links among web pages and can augment labeled examples for the Bayes classifier. On the other hand, the Bayes classifier can also provide labeled example for the graph-based classifier after it learning on labeled set augmented by the graph-based classifier. Therefore, the two classifiers help each other and improve their respective performance during the process of training. Finally, the Bayes classifier can classify a large number of unseen examples. We test GCo-training algorithm, Co-training algorithm based on words occurring on web pages and words occurring in hyperlinks and Bayes algorithm based on EM on the Web&KB dataset. Experimental results show GCo-training performs much better than the other algorithms.
Evolutionary multi-objective optimization (EMO), whose main task is to deal with multi-objective optimization problems by evolutionary computation, has become a hot topic in evolutionary computation community. After s...
详细信息
This paper presents a strong noise image enhancement method based on intrascale dependencies of the second generation curvelet transform. Observing that the immediate four neighbor coefficients bear the most important...
详细信息
Because of noise and clutter, the infrared target detection even becomes more difficult. In this paper, we present an automatic seed selection method based on an improved mountain cluster algorithm to be employed in i...
详细信息
Based on the antibody clonal selection theory of immunology, an artificial immune system algorithm, clonal selection algorithm based on anti-idiotype (AICSA), is proposed to deal with complex multi-modal optimization ...
详细信息
In this study, a novel clustering-based selection strategy of nondominated individuals for evolutionary multi-objective optimization is proposed. The new strategy partitions the nondominated individuals in current Par...
详细信息
ISBN:
(纸本)9781424447374;9781424447541
In this study, a novel clustering-based selection strategy of nondominated individuals for evolutionary multi-objective optimization is proposed. The new strategy partitions the nondominated individuals in current Pareto front adaptively into desired clusters. Then one representative individual will be selected in each cluster for pruning nondominated individuals. In order to evaluate the validity of the new strategy, we apply it into one state of the art multi-objective evolutionary algorithm. The experimental results based on thirteen benchmark problems show that the new strategy improves the performance obviously in terms of breadth and uniformity of nondominated solutions.
By inspiration of the granular evolutionary algorithm, a Granular Agent Evolutionary algorithm for Classification (GAEC) is proposed. The method uses the granular agent to denote the set of examples that have similar ...
详细信息
By inspiration of the granular evolutionary algorithm, a Granular Agent Evolutionary algorithm for Classification (GAEC) is proposed. The method uses the granular agent to denote the set of examples that have similar attributions and the knowledge base guides the evolutionary of granular agent. Also some granular evolutionary operators are designed for classification problem. Assimilation operator, exchange operator, and differentiation operator reflect the competitive, cooperative and self-learning ability of agent respectively. Finally, some classification rules are extracted from granular agents by some strategies to forecast the sort of new data. Empirical studies show that the algorithm has a good classification prediction, and only need a small price for the training time. In most UCI datasets, the performance of GAEC is better than G-NET, OCEC and C4.5, which have good performance.
A new general network model for two complex networks with time-varying delay coupling is presented. Then we investigate its synchronization phenomena. The two complex networks of the model differ in dynamic nodes, the...
详细信息
A new general network model for two complex networks with time-varying delay coupling is presented. Then we investigate its synchronization phenomena. The two complex networks of the model differ in dynamic nodes, the number of nodes and the coupling connections. By using adaptive controllers, a synchronization criterion is derived. Numerical examples are given to demonstrate the effectiveness of the obtained synchronization criterion. This study may widen the application range of synchronization, such as in chaotic secure communication.
This paper proposes an image coding method based on adaptive downsampling which not only uses the pixel redundancy but also considers visual redundancy. At the encoder side, codec adaptively chooses some smooth region...
详细信息
ISBN:
(纸本)9781424456536;9781424456543
This paper proposes an image coding method based on adaptive downsampling which not only uses the pixel redundancy but also considers visual redundancy. At the encoder side, codec adaptively chooses some smooth regions of the original image to downsample, and then overlapped transform with selectivity, block DCT and adaptive-shape DCT (SA-DCT) are used against the image after being downsampled. For the incomplete transformed image, OB-SPECK is adopted to code. At the decoder side, in order to reduce the computational complexity, we use the simple cubic interpolation which not only is very suitable to the downsampled regions but also enhances greatly the real time of this coding system. Experimental results show the proposed method outperforms JPEG2000, SPECK, SPIHT, and LT+SPECK at low bit rates.
暂无评论