An Improved Genetic Algorithm with Average-bound Crossover and Wavelet Mutation Operations

This paper presents a real-coded genetic algorithm (RCGA) with new genetic operations (crossover and mutation). They are called the average-bound crossover and wavelet mutation. By introducing the proposed genetic operations, both the solution quality and stability are better than the RCGA with conventional genetic operations. A suite of benchmark test functions are used to evaluate the performance of the proposed algorithm. Application examples on economic load dispatch and tuning an associative-memory neural network are used to show the performance of the proposed RCGA.     

A support vector regression based prediction model of affective responses for product form design

In this paper, a state-of-the-art machine learning approach known as support vector regression (SVR) is introduced to develop a model that predicts consumers’ affective responses (CARs) for product form design. First, pairwise adjectives were used to describe the CARs toward product samples. Second, the product form features (PFFs) were examined systematically and then stored them either as continuous or discrete attributes. The adjective evaluation data of consumers were gathered from questionnaires. Finally, prediction models based on different adjectives were constructed using SVR, which trained a series of PFFs and the average CAR rating of all the respondents. The real-coded genetic algorithm (RCGA) was used to determine the optimal training parameters of SVR. The predictive performance of the SVR with RCGA (SVR–RCGA) is compared to that of SVR with 5-fold cross-validation (SVR–5FCV) and a back-propagation neural network (BPNN) with 5-fold cross-validation (BPNN–5FCV). The experimental results using the data sets on mobile phones and electronic scooters show that SVR performs better than BPNN. Moreover, the RCGA for optimizing training parameters for SVR is more convenient for practical usage in product form design than the timeconsuming CV.     

Generalizing self-organizing map for categorical data

The self-organizing map (SOM) is an unsupervised neural network which projects high-dimensional data onto a low-dimensional grid and visually reveals the topological order of the original data. Self-organizing maps have been successfully applied to many fields, including engineering and business domains. However, the conventional SOM training algorithm handles only numeric data. Categorical data are usually converted to a set of binary data before training of an SOM takes place. If a simple transformation scheme is adopted, the similarity information embedded between categorical values may be lost. Consequently, the trained SOM is unable to reflect the correct topological order. This paper proposes a generalized self-organizing map model that offers an intuitive method of specifying the similarity between categorical values via distance hierarchies and, hence, enables the direct process of categorical values during training. In fact, distance hierarchy unifies the distance computation of both numeric and categorical values. The unification is done by mapping the values to distance hierarchies and then measuring the distance in the hierarchies. Experiments on synthetic and real datasets were conducted, and the results demonstrated the effectiveness of the generalized SOM model.     

一种自动抽取图像中可判别区域的新方法

图像分割是图像处理中的一个难题，为了自动抽取图像中的可差别区域，提出了一种基于自组织图归约算法的区域抽取新方法，首先，利用包括颜色、纹理以及位置在内的多模特征抽算法，原始图像被转换成特征，接着，通过自组织映射学习算法，特征图映射成自组织图，然后，对自组织图实施归纳算法得到一族约简的自组织图谱系；最后，利用一个 综合的聚类有效性分析指标从约简的自组织图谱系中得到一个最优约简的自组织图，以此实现图像区域的分割，新方法的有效性通过两个评价实验得到了验证。     

SOM神经网络改进及在遥感图像分类中的应用*

针对自组织特征神经网络自身算法的特点和缺陷,采用遗传算法对网络进行改进,形成了基于遗传算法的自组织特征神经网络,并从输入向量、竞争层神经元数量设置和初始权向量设定三方面,结合遥感图像的特性对自组织特征映射网络遥感图像分类的方法进行了改进。将该方法应用于择西安地区的ETM+卫星遥感图像进行分类试验,结果表明,基于遗传算法的自组织特征映射网络使得遥感图像的分类精度更高,且该算法实现简单,具有一定的工程应用价值。     

Nonconvex economic load dispatch using an efficient real-coded genetic algorithm

An efficient optimisation procedure based on real-coded genetic algorithm (RCGA) is proposed for the solution of economic load dispatch (ELD) problem with continuous and nonsmooth/nonconvex cost function and with various constraints being considered. The effectiveness of the proposed algorithm has been demonstrated on different systems considering the transmission losses and valve point loading effect in thermal units. The proposed algorithm is equipped with an effective constraint handling technique, which eliminates the need for penalty parameters. For the purpose of comparison, the same problem has also been solved using binary-coded genetic algorithm (BCGA) and three other popular RCGAs. In the proposed RCGA, simulated binary crossover and polynomial mutation are used against the single point crossover and bit-flipping mutation in BCGA. It has been observed from the test results that the proposed RCGA is more efficient in terms of thermal cost minimisation and execution time for ELD problem with continuous search space than BCGA and some other popular RCGAs.     

基于粒子群优化的自组织特征映射神经网络及应用

采用粒子群优化(PSO)算法优化权重失真指数(LW D I),提出了基于粒子群优化的SOM(PSO-SOM)训练算法.用该算法取代K ohonen提出的启发式训练算法,同时引进核函数,以加强PSO-SOM算法的非线性聚类能力.以某工厂丙烯腈反应器数据为聚类应用研究对象,研究结果表明,与启发式训练算法相比,PSO-SOM算法能够得到较优的聚类,而且该算法实现简单、便于工程应用,对丙烯腈反应器参数调整以及收率监测具有显著的指导作用.     

Adaptive directed mutation for real-coded genetic algorithms

Adaptive directed mutation (ADM) operator, a novel, simple, and efficient real-coded genetic algorithm (RCGA) is proposed and then employed to solve complex function optimization problems. The suggested ADM operator enhances the abilities of GAs in searching global optima as well as in speeding convergence by integrating the local directional search strategy and the adaptive random search strategies. Using 41 benchmark global optimization test functions, the performance of the new algorithm is compared with five conventional mutation operators and then with six genetic algorithms (GAs) reported in literature. Results indicate that the proposed ADM-RCGA is fast, accurate, and reliable, and outperforms all the other GAs considered in the present study.     

A simple and efficient real-coded genetic algorithm for constrained optimization

This paper presents a simple and efficient real-coded genetic algorithm (RCGA) for constrained real-parameter optimization. Different from some conventional RCGAs that operate evolutionary operators in a series framework, the proposed RCGA implements three specially designed evolutionary operators, named the ranking selection (RS), direction-based crossover (DBX), and the dynamic random mutation (DRM), to mimic a specific evolutionary process that has a parallel-structured inner loop. A variety of benchmark constrained optimization problems (COPs) are used to evaluate the effectiveness and the applicability of the proposed RCGA. Besides, some existing state-of-the-art optimization algorithms in the same category of the proposed algorithm are considered and utilized as a rigorous base of performance evaluation. Extensive comparison results reveal that the proposed RCGA is superior to most of the comparison algorithms in providing a much faster convergence speed as well as a better solution accuracy, especially for problems subject to stringent equality constraints. Finally, as a specific application, the proposed RCGA is applied to optimize the GaAs film growth of a horizontal metal-organic chemical vapor deposition reactor. Simulation studies have confirmed the superior performance of the proposed RCGA in solving COPs.     

Face Matching in Large Database by Self-Organizing Maps

A novel self-organizing map (SOM) based retrieval system is proposed for performing face matching in large database. The proposed system provides a small subset of faces that are most similar to a given query face, from which user can easily verify the matched images. The architecture of the proposed system consists of two major parts. First, the system provides a generalized integration of multiple feature-sets using multiple self-organizing maps. Multiple feature-sets are obtained from different feature extraction methods like Gabor filter, Local Autocorrelation Coefficients, etc. In this platform, multiple facial features are integrated to form a compressed feature vector without concerning scaling and length of individual feature set. Second, an SOM is trained to organize all the face images in a database through using the compressed feature vector. Using the organized map, similar faces to a query can be efficiently identified. Furthermore, the system includes a relevance feedback to enhance the face retrieval performance. The proposed method is computationally efficient. Comparative results show that the proposed approach is promising for identifying face in a given large image database.     

Self-organizing maps by difference of convex functions optimization

We offer an efficient approach based on difference of convex functions (DC) optimization for self-organizing maps (SOM). We consider SOM as an optimization problem with a nonsmooth, nonconvex energy function and investigated DC programming and DC algorithm (DCA), an innovative approach in nonconvex optimization framework to effectively solve this problem. Furthermore an appropriate training version of this algorithm is proposed. The numerical results on many real-world datasets show the efficiency of the proposed DCA based algorithms on both quality of solutions and topographic maps.     

SOM网络的改进及其在储粮害虫分类中的应用

自组织特征映射神经网络(SOM网络)在分类方面存在的不足是训练时间长、分类精度不高以及学习过程容易发生振荡。为了改善SOM网络的分类性能,达到提高和分类精度的目的,提出了SOM网络的工作原理及算法,得出影响SOM网络分类性能的主要因素,包括学习率、初始权值、训练次数及邻域设置等,并分别提出了改进方法。利用改进后的SOM网络,通过3折分层交叉验证方法对储粮害虫数据进行分类验证,仿真实验结果表明,改进后的SOM分类器在学习速度和分类精度方面都得到了较大提高,证明提出的改进方法是有效的和可行的。     

Soft-Decoding SOM for VQ Over Wireless Channels

A self-organizing map (SOM) approach for vector quantization (VQ) over wireless channels is presented. We introduce a soft decoding SOM-based robust VQ (RVQ) approach with performance comparable to that of the conventional channel optimized VQ (COVQ) approach. In particular, our SOM approach avoids the time-consuming index assignment process in traditional RVQs and does not require a reliable feedback channel for COVQ-like training. Simulation results show that our approach can offer potential performance gain over the conventional COVQ approach. For data sources with Gaussian distribution, the gain of our approach is demonstrated to be in the range of 1–4 dB. For image data, our approach gives a performance comparable to a sufficiently trained COVQ, and is superior with a similar number of training epoches. To further improve the performance, a SOM–based COVQ approach is also discussed.     

融合差分进化和SOM的组合文本聚类算法

自组织映射算法是一种重要的聚类模型,能够有效提高搜索引擎的精确性。为克服自组织映射网络对于初始连接权值敏感的不足,提出一种改进的差分进化和SOM相结合的组合文档聚类算法IDE-SOM,首先引入一种改进的差分进化算法对文档集进行一次粗聚类,旨在对SOM网络的初始连接权值进行优化,然后将这个连接权值初始化SOM网络进行细聚类。仿真实验表明,该算法在F-measure、熵等评价指标上都获得了较好的聚类效果。     

Fuzzy optimized self-organizing maps and their application to document clustering

In this paper, an approach using fuzzy logic techniques and self-organizing maps (SOM) is presented in order to manage conceptual aspects in document clusters and to reduce the training time. In order to measure the presence degree of a concept in a document, a concept frequency formula is introduced. This formula is based on new fuzzy formulas to calculate the polysemy degree of terms and the synonymy degree between terms. In this approach, new fuzzy improvements such as automatic choice of the topology, heuristic map initialization, a fuzzy similarity measure and a keywords extraction process are used. Some experiments have been carried out in order to compare the proposed system with classic SOM approaches by means of Reuters collection. The system performance has been measured in terms of F-measure and training time. The experimental results show that the proposed approach generates good results with less training time compared to classic SOM techniques.     

An Efficient Adaptive Real Coded Genetic Algorithm to Solve the Portfolio Choice Problem Under Cumulative Prospect Theory

Cumulative prospect theory (CPT) has become one of the most popular approaches for evaluating the behavior of decision makers under conditions of uncertainty. Substantial experimental evidence suggests that human behavior may significantly deviate from the traditional expected utility maximization framework when faced with uncertainty. The problem of portfolio selection should be revised when the investor’s preference is for CPT instead of expected utility theory. However, because of the complexity of the CPT function, little research has investigated the portfolio choice problem based on CPT. In this paper, we present an operational model for portfolio selection under CPT, and propose a real-coded genetic algorithm (RCGA) to solve the problem of portfolio choice. To overcome the limitations of RCGA and improve its performance, we introduce an adaptive method and propose a new selection operator. Computational results show that the proposed method is a rapid, effective, and stable genetic algorithm.     

Ranked centroid projection: a data visualization approach with self-organizing maps

The self-organizing map (SOM) is an efficient tool for visualizing high-dimensional data. In this paper, the clustering and visualization capabilities of the SOM, especially in the analysis of textual data, i.e., document collections, are reviewed and further developed. A novel clustering and visualization approach based on the SOM is proposed for the task of text mining. The proposed approach first transforms the document space into a multidimensional vector space by means of document encoding. Afterwards, a growing hierarchical SOM (GHSOM) is trained and used as a baseline structure to automatically produce maps with various levels of detail. Following the GHSOM training, the new projection method, namely the ranked centroid projection (RCP), is applied to project the input vectors to a hierarchy of 2-D output maps. The RCP is used as a data analysis tool as well as a direct interface to the data. In a set of simulations, the proposed approach is applied to an illustrative data set and two real-world scientific document collections to demonstrate its applicability.     

A neuro-immune model for discriminating and visualizing anomalies

A model that can detect anomalies, even when trained only with normal samples, and can learn from encounters with new anomalies is proposed. The model combines a negative selection algorithm and a self-organizing map (SOM) in an immune inspired architecture. One of the main advantages of the proposed system is that it is able to produce a visual representation of the self/non-self feature space, thanks to the topological two-dimensional map produced by the SOM. Experimental results with anomaly and classification data are presented and discussed.     

Recognizing partially occluded, expression variant faces from single training image per person with SOM and soft k-NN ensemble

Most classical template-based frontal face recognition techniques assume that multiple images per person are available for training, while in many real-world applications only one training image per person is available and the test images may be partially occluded or may vary in expressions. This paper addresses those problems by extending a previous local probabilistic approach presented by Martinez, using the self-organizing map (SOM) instead of a mixture of Gaussians to learn the subspace that represented each individual. Based on the localization of the training images, two strategies of learning the SOM topological space are proposed, namely to train a single SOM map for all the samples and to train a separate SOM map for each class, respectively. A soft k nearest neighbor (soft k-NN) ensemble method, which can effectively exploit the outputs of the SOM topological space, is also proposed to identify the unlabeled subjects. Experiments show that the proposed method exhibits high robust performance against the partial occlusions and variant expressions.     

Parallel Implementation of Self-Organizing Map on the Partial Tree Shape Neurocomputer

A parallel mapping of self-organizing map (SOM) algorithm is presented for a partial tree shape neurocomputer (PARNEU). PARNEU is a general purpose parallel neurocomputer that is designed for soft computing applications. Practical scalability and a reconfigurable partial tree network are the main architectural features. The presented neuron parallel mapping of SOM with on-line learning illustrates a parallel winner neuron search and a coordinate transfer that are performed in the partial tree network. Phase times are measured to analyse speedup and scalability of the mapping. The performance of the learning phase in SOM with a four processor PARNEU configuration is about 26 MCUPS and the recall phase performs 30 MCPS. Compared to other mappings done for general purpose neurocomputers, PARNEU's performance is very good.