Clustering problem is one of the hottest issues in wireless sensor networks (WSNs). The strategy for selection of cluster head has not been sufficiently investigated. In this paper, we propose a hormone-based clusteri...
详细信息
In the process of supply chain (SC) management, time inventory management problem is extremely important. In terms of academic methods, quantitative methods are very popular as the researchers could calculate the inve...
详细信息
Appropriate dealing with boundary conditions is very important for SPH. Current boundary treatment methods like boundary force method, ghost particle method and virtual boundary layer method, when dealing with complex...
详细信息
Associative memory schemes have been developed for Evolutionary Algorithms (EAs) to solve Dynamic Optimization Problems (DOPs), and demonstrated powerful performance. In these schemes, how to update the memory could b...
详细信息
ISBN:
(纸本)9781424463343
Associative memory schemes have been developed for Evolutionary Algorithms (EAs) to solve Dynamic Optimization Problems (DOPs), and demonstrated powerful performance. In these schemes, how to update the memory could be important for their performance. However, little work has been done about the associative memory updating strategies. In this paper, a novel updating strategy is proposed for associative memory schemes. In this strategy, the memory point whose associated environmental information is most similar to the current environmental information is first picked out from the memory. Then, the selected memory individual is updated according to the fitness value, and the associated environmental information is updated according to the matching degree between environmental information and individuals. This updating strategy is embedded into a stateof-the-art algorithm, i.e. the MPBIL, and tested by experiments. Experimental results demonstrate that the proposed updating strategy is helpful for associative memory schemes to enhance their search ability in cyclic dynamic environments.
Scalable video coding (SVC), together with adaptive modulation and coding (AMC), can improve wireless multicast streaming video by jointly performing radio resource allocation and modulation and coding scheme (MCS) se...
详细信息
Cluster analysis is a major method to study gene function and gene regulation information for there is a lack of prior knowledge for gene data. Many clustering methods existed at present usually need manual operat...
详细信息
ISBN:
(纸本)9781424468126;9780769540306
Cluster analysis is a major method to study gene function and gene regulation information for there is a lack of prior knowledge for gene data. Many clustering methods existed at present usually need manual operations or predetermined parameters, which are difficult for gene data. Besides, gene data possess their own characteristics, such as large scale, high-dimension, and noise. Therefore, a systematic clustering algorithm should be proposed to effectively deal with gene data. In this paper, a novel genetic programming (GP) clustering system for gene data based on hierarchical statistical model (HS-model) is proposed. And an appropriate fitness function is also proposed in this system. This clustering system can largely eliminate the infection of data scale and dimension. The proposed GP clustering system is applied to cluster the whole intact yeast gene data without dimensionality reduction. The experimental results indicate that the algorithm is highly efficient and can effectively deal with missing values in gene dataset
Recently, the characterization of community structures in complex networks has received a considerable amount of attentions. Effective identification of these communities or clusters is a general problem in the fi...
详细信息
ISBN:
(纸本)9781424468126;9780769540306
Recently, the characterization of community structures in complex networks has received a considerable amount of attentions. Effective identification of these communities or clusters is a general problem in the field of data mining. In this paper we present a /ast hierarchical agglomerative algorithm based on community closeness (FHACC) algorithm, for detecting community structure which is very efficient and faster than many other competing algorithms. FHACC tends to agglomerate such communities that share the most common vertices into larger ones. Its running time on a sparse network with n vertices and m edges is O(mk + mt), where k denotes the mean vertex degree, and t is the iteration times of community agglomeration in FHACC algorithm. The algorithm was tested on several real-world networks and proved to be high efficient and effective in community finding.
Interactive population-based incremental learning (IPBIL) is an effective method to solve optimization problems with implicit performance indices. It can significantly reduce user fatigue compared with interactive evo...
详细信息
ISBN:
(纸本)9781424463473
Interactive population-based incremental learning (IPBIL) is an effective method to solve optimization problems with implicit performance indices. It can significantly reduce user fatigue compared with interactive evolutionary computation (IEC). However,each run of IPBIL can only find one solution or some similar solutions. Thus it is not suitable for multimodal optimization problems with implicit performance indices. To solve this problem,we propose an IPBIL with multiple probability vectors (IPBIL-MPV) in this work. The key idea is to utilize multiple probability vectors to catch different search directions and thus find more than one solutions. We perform a subjective experiment in which IPBIL-MPV is applied to a fashion design problem. The experimental results show that IPBIL-MPV can find several distinct solutions in a run. Thus it is an effective method to solve multimodal optimization problems with implicit performance indices.
Clustering problem is one of the hottest issues in wireless sensor networks (WSNs). The strategy for selection of cluster head has not been sufficiently investigated. In this paper,we propose a hormone-based clusterin...
详细信息
Clustering problem is one of the hottest issues in wireless sensor networks (WSNs). The strategy for selection of cluster head has not been sufficiently investigated. In this paper,we propose a hormone-based clustering algorithm (HCA) inspired by the communication mechanism of bioendocrine system to prolong the lifetime of the sensor nodes. Two kinds of hormones,cluster hormone and member hormone,are used in the algorithm. Hormone message can promote a node to become a cluster head or a member node. Comparative experiment shows that the proposed algorithm has effectively prolong the lifetime of WSN compared with LEACH[1] and HEED[2].
暂无评论