• Title/Summary/Keyword: Hybrid Genetic Algorithms

Search Result 165, Processing Time 0.023 seconds

Breast Cytology Diagnosis using a Hybrid Case-based Reasoning and Genetic Algorithms Approach

  • Ahn, Hyun-Chul;Kim, Kyoung-Jae
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2007.05a
    • /
    • pp.389-398
    • /
    • 2007
  • Case-based reasoning (CBR) is one of the most popular prediction techniques for medical diagnosis because it is easy to apply, has no possibility of overfitting, and provides a good explanation for the output. However, it has a critical limitation - its prediction performance is generally lower than other artificial intelligence techniques like artificial neural networks (ANNs). In order to obtain accurate results from CBR, effective retrieval and matching of useful prior cases for the problem is essential, but it is still a controversial issue to design a good matching and retrieval mechanism for CBR systems. In this study, we propose a novel approach to enhance the prediction performance of CBR. Our suggestion is the simultaneous optimization of feature weights, instance selection, and the number of neighbors that combine using genetic algorithms (GAs). Our model improves the prediction performance in three ways - (1) measuring similarity between cases more accurately by considering relative importance of each feature, (2) eliminating redundant or erroneous reference cases, and (3) combining several similar cases represent significant patterns. To validate the usefulness of our model, this study applied it to a real-world case for evaluating cytological features derived directly from a digital scan of breast fine needle aspirate (FNA) slides. Experimental results showed that the prediction accuracy of conventional CBR may be improved significantly by using our model. We also found that our proposed model outperformed all the other optimized models for CBR using GA.

  • PDF

Evolutionary-base finite element model updating and damage detection using modal testing results

  • Vahidi, Mehdi;Vahdani, Shahram;Rahimian, Mohammad;Jamshidi, Nima;Kanee, Alireza Taghavee
    • Structural Engineering and Mechanics
    • /
    • v.70 no.3
    • /
    • pp.339-350
    • /
    • 2019
  • This research focuses on finite element model updating and damage assessment of structures at element level based on global nondestructive test results. For this purpose, an optimization system is generated to minimize the structural dynamic parameters discrepancies between numerical and experimental models. Objective functions are selected based on the square of Euclidean norm error of vibration frequencies and modal assurance criterion of mode shapes. In order to update the finite element model and detect local damages within the structural members, modern optimization techniques is implemented according to the evolutionary algorithms to meet the global optimized solution. Using a simulated numerical example, application of genetic algorithm (GA), particle swarm (PSO) and artificial bee colony (ABC) algorithms are investigated in FE model updating and damage detection problems to consider their accuracy and convergence characteristics. Then, a hybrid multi stage optimization method is presented merging advantages of PSO and ABC methods in finding damage location and extent. The efficiency of the methods have been examined using two simulated numerical examples, a laboratory dynamic test and a high-rise building field ambient vibration test results. The implemented evolutionary updating methods show successful results in accuracy and speed considering the incomplete and noisy experimental measured data.

Rule-Based Fuzzy Polynomial Neural Networks in Modeling Software Process Data

  • Park, Byoung-Jun;Lee, Dong-Yoon;Oh, Sung-Kwun
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.3
    • /
    • pp.321-331
    • /
    • 2003
  • Experimental software datasets describing software projects in terms of their complexity and development time have been the subject of intensive modeling. A number of various modeling methodologies and modeling designs have been proposed including such approaches as neural networks, fuzzy, and fuzzy neural network models. In this study, we introduce the concept of the Rule-based fuzzy polynomial neural networks (RFPNN) as a hybrid modeling architecture and discuss its comprehensive design methodology. The development of the RFPNN dwells on the technologies of Computational Intelligence (CI), namely fuzzy sets, neural networks, and genetic algorithms. The architecture of the RFPNN results from a synergistic usage of RFNN and PNN. RFNN contribute to the formation of the premise part of the rule-based structure of the RFPNN. The consequence part of the RFPNN is designed using PNN. We discuss two kinds of RFPNN architectures and propose a comprehensive learning algorithm. In particular, it is shown that this network exhibits a dynamic structure. The experimental results include well-known software data such as the NASA dataset concerning software cost estimation and the one describing software modules of the Medical Imaging System (MIS).

Design of hetero-hybridized feed-forward neural networks with information granules using evolutionary algorithm

  • Roh Seok-Beom;Oh Sung-Kwun;Ahn Tae-Chon
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2005.11a
    • /
    • pp.483-487
    • /
    • 2005
  • We introduce a new architecture of hetero-hybridized feed-forward neural networks composed of fuzzy set-based polynomial neural networks (FSPNN) and polynomial neural networks (PM) that are based on a genetically optimized multi-layer perceptron and develop their comprehensive design methodology involving mechanisms of genetic optimization and Information Granulation. The construction of Information Granulation based HFSPNN (IG-HFSPNN) exploits fundamental technologies of Computational Intelligence(Cl), namely fuzzy sets, neural networks, and genetic algorithms(GAs) and Information Granulation. The architecture of the resulting genetically optimized Information Granulation based HFSPNN (namely IG-gHFSPNN) results from a synergistic usage of the hybrid system generated by combining new fuzzy set based polynomial neurons (FPNs)-based Fuzzy Neural Networks(PM) with polynomial neurons (PNs)-based Polynomial Neural Networks(PM). The design of the conventional genetically optimized HFPNN exploits the extended Group Method of Data Handling(GMDH) with some essential parameters of the network being tuned by using Genetie Algorithms throughout the overall development process. However, the new proposed IG-HFSPNN adopts a new method called as Information Granulation to deal with Information Granules which are included in the real system, and a new type of fuzzy polynomial neuron called as fuzzy set based polynomial neuron. The performance of the IG-gHFPNN is quantified through experimentation.

  • PDF

Two dimensional reduction technique of Support Vector Machines for Bankruptcy Prediction

  • Ahn, Hyun-Chul;Kim, Kyoung-Jae;Lee, Ki-Chun
    • 한국경영정보학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.608-613
    • /
    • 2007
  • Prediction of corporate bankruptcies has long been an important topic and has been studied extensively in the finance and management literature because it is an essential basis for the risk management of financial institutions. Recently, support vector machines (SVMs) are becoming popular as a tool for bankruptcy prediction because they use a risk function consisting of the empirical error and a regularized term which is derived from the structural risk minimization principle. In addition, they don't require huge training samples and have little possibility of overfitting. However. in order to Use SVM, a user should determine several factors such as the parameters ofa kernel function, appropriate feature subset, and proper instance subset by heuristics, which hinders accurate prediction results when using SVM In this study, we propose a novel hybrid SVM classifier with simultaneous optimization of feature subsets, instance subsets, and kernel parameters. This study introduces genetic algorithms (GAs) to optimize the feature selection, instance selection, and kernel parameters simultaneously. Our study applies the proposed model to the real-world case for bankruptcy prediction. Experimental results show that the prediction accuracy of conventional SVM may be improved significantly by using our model.

  • PDF

Improving an Ensemble Model Using Instance Selection Method (사례 선택 기법을 활용한 앙상블 모형의 성능 개선)

  • Min, Sung-Hwan
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.39 no.1
    • /
    • pp.105-115
    • /
    • 2016
  • Ensemble classification involves combining individually trained classifiers to yield more accurate prediction, compared with individual models. Ensemble techniques are very useful for improving the generalization ability of classifiers. The random subspace ensemble technique is a simple but effective method for constructing ensemble classifiers; it involves randomly drawing some of the features from each classifier in the ensemble. The instance selection technique involves selecting critical instances while deleting and removing irrelevant and noisy instances from the original dataset. The instance selection and random subspace methods are both well known in the field of data mining and have proven to be very effective in many applications. However, few studies have focused on integrating the instance selection and random subspace methods. Therefore, this study proposed a new hybrid ensemble model that integrates instance selection and random subspace techniques using genetic algorithms (GAs) to improve the performance of a random subspace ensemble model. GAs are used to select optimal (or near optimal) instances, which are used as input data for the random subspace ensemble model. The proposed model was applied to both Kaggle credit data and corporate credit data, and the results were compared with those of other models to investigate performance in terms of classification accuracy, levels of diversity, and average classification rates of base classifiers in the ensemble. The experimental results demonstrated that the proposed model outperformed other models including the single model, the instance selection model, and the original random subspace ensemble model.

A Solution of Production Scheduling Problem adapting Fast Model of Parallel Heuristics (병렬 휴리스틱법의 고속화모델을 적용한 생산 스케쥴링 문제의 해법)

  • Hong, Seong-Chan;Jo, Byeong-Jun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.959-968
    • /
    • 1999
  • several papers have reported that parallel heuristics or hybrid approaches combining several heuristics can get better results. However, the parallelization and hybridization of any search methods on the single CPU type computer need enormous computation time. that case, we need more elegant combination method. For this purpose, we propose Fast Model of Parallel Heuristics(FMPH). FMPH is based on the island model of parallel genetic algorithms and takes local search to the elite solution obtained form each island(sub group). In this paper we introduce how can we adapt FMPH to the job-shop scheduling problem notorious as the most difficult NP-hard problem and report the excellent results of several famous benchmark problems.

  • PDF

Genetically Optimized Hybrid Fuzzy Neural Networks Based on Linear Fuzzy Inference Rules

  • Oh Sung-Kwun;Park Byoung-Jun;Kim Hyun-Ki
    • International Journal of Control, Automation, and Systems
    • /
    • v.3 no.2
    • /
    • pp.183-194
    • /
    • 2005
  • In this study, we introduce an advanced architecture of genetically optimized Hybrid Fuzzy Neural Networks (gHFNN) and develop a comprehensive design methodology supporting their construction. A series of numeric experiments is included to illustrate the performance of the networks. The construction of gHFNN exploits fundamental technologies of Computational Intelligence (CI), namely fuzzy sets, neural networks, and genetic algorithms (GAs). The architecture of the gHFNNs results from a synergistic usage of the genetic optimization-driven hybrid system generated by combining Fuzzy Neural Networks (FNN) with Polynomial Neural Networks (PNN). In this tandem, a FNN supports the formation of the premise part of the rule-based structure of the gHFNN. The consequence part of the gHFNN is designed using PNNs. We distinguish between two types of the linear fuzzy inference rule-based FNN structures showing how this taxonomy depends upon the type of a fuzzy partition of input variables. As to the consequence part of the gHFNN, the development of the PNN dwells on two general optimization mechanisms: the structural optimization is realized via GAs whereas in case of the parametric optimization we proceed with a standard least square method-based learning. To evaluate the performance of the gHFNN, the models are experimented with a representative numerical example. A comparative analysis demonstrates that the proposed gHFNN come with higher accuracy as well as superb predictive capabilities when comparing with other neurofuzzy models.

The Optimal Design of HFC by means of GAs (유전자 알고리즘을 이용한 HFC의 최적설계)

  • 이대근;오성권;장성환
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.369-369
    • /
    • 2000
  • Control system by means of fuzzy theory has demonstrated its robustness in applying to the high-order and nonlinear dynamic system in that it can utilizes the human expert knowledges in system design. In this paper, first, the design methodology of HFC combined PID controller with fuzzy controller by membership function of weighting coefficient is proposed. Second, Second, an auto-tuning algorithms utilizing the simplified reasoning method and genetic algorithms is presented to improve the performance of hybrid fuzzy controller. Especially, in order to obtain the optimal scaling factors and PID parameters of HFC using GA based on advanced initial individual, three kinds of estimation modes such as basic, contraction, and expansion mode are effectively utilized. The proposed HFC is evaluated and discussed in ITAE, overshoot and rising time to show applicability and superiority with simulation results.

  • PDF

MEMBERSHIP FUNCTION TUNING OF FUZZY NEURAL NETWORKS BY IMMUNE ALGORITHM

  • Kim, Dong-Hwa
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.3
    • /
    • pp.261-268
    • /
    • 2002
  • This paper represents that auto tunings of membership functions and weights in the fuzzy neural networks are effectively performed by immune algorithm. A number of hybrid methods in fuzzy-neural networks are considered in the context of tuning of learning method, a general view is provided that they are the special cases of either the membership functions or the gain modification in the neural networks by genetic algorithms. On the other hand, since the immune network system possesses a self organizing and distributed memory, it is thus adaptive to its external environment and allows a PDP (parallel distributed processing) network to complete patterns against the environmental situation. Also, it can provide optimal solution. Simulation results reveal that immune algorithms are effective approaches to search for optimal or near optimal fuzzy rules and weights.