• Title/Summary/Keyword: Algorithm Selection Process

Search Result 455, Processing Time 0.038 seconds

A Bayesian Approach for Record Value Statistics Model Using Nonhomogeneous Poisson Process

  • Kiheon Choi;Hee chual Kim
    • Communications for Statistical Applications and Methods
    • /
    • v.4 no.1
    • /
    • pp.259-269
    • /
    • 1997
  • Bayesian inference for a record value statistics(RVS) model of nonhomogeneous Poisson process is considered. We seal with Bayesian inference for double exponential, Gamma, Rayleigh, Gumble RVS models using Gibbs sampling and Metropolis algorithm and also explore Bayesian computation and model selection.

  • PDF

Concept Optimization for Mechanical Product Using Genetic Algorithm

  • Huang Hong Zhong;Bo Rui Feng;Fan Xiang Feng
    • Journal of Mechanical Science and Technology
    • /
    • v.19 no.5
    • /
    • pp.1072-1079
    • /
    • 2005
  • Conceptual design is the first step in the overall process of product design. Its intrinsic uncertainty, imprecision, and lack of information lead to the fact that current conceptual design activities in engineering have not been computerized and very few CAD systems are available to support conceptual design. In most of the current intelligent design systems, approach of principle synthesis, such as morphology matrix, bond graphic, or design catalogues, is usually adopted to deal with the concept generation, in which optional concepts are generally combined and enumerated through function analysis. However, as a large number of concepts are generated, it is difficult to evaluate and optimize these design candidates using regular algorithm. It is necessary to develop a new approach or a tool to solve the concept generation. Generally speaking, concept generation is a problem of concept synthesis. In substance, this process of developing design candidate is a combinatorial optimization process, viz., the process of concept generation can be regarded as a solution for a state-place composed of multi-concepts. In this paper, genetic algorithm is utilized as a feasible tool to solve the problem of combinatorial optimization in concept generation, in which the encoding method of morphology matrix based on function analysis is applied, and a sequence of optimal concepts are generated through the search and iterative process which is controlled by genetic operators, including selection, crossover, mutation, and reproduction in GA. Several crucial problems on GA are discussed in this paper, such as the calculation of fitness value and the criteria for heredity termination, which have a heavy effect on selection of better concepts. The feasibility and intellectualization of the proposed approach are demonstrated with an engineering case. In this work concept generation is implemented using GA, which can facilitate not only generating several better concepts, but also selecting the best concept. Thus optimal concepts can be conveniently developed and design efficiency can be greatly improved.

Simulated Annealing Algorithm for Optimum Design of Space Truss Structures (입체 트러스구조물의 최적설계를 위한 SA기법)

  • 정제원;박효선
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1999.04a
    • /
    • pp.102-109
    • /
    • 1999
  • Two phase simulated annealing algorithm is presented as a structural optimization technique and applied to minimum weight design of space trusses subjected to stress and displacement constraints under multiple loading conditions. Univariate searching algorithm is adopted for automatic selection of initial values of design variables for SA algorithm. The proper values of cooling factors and reasonable stopping criteria for optimum design of space truss structures are proposed to enhance the performance of optimization process. Optimum weights and design solutions are presented for two well-blown example structures and compared with those reported in the literature.

  • PDF

Detection for JPEG steganography based on evolutionary feature selection and classifier ensemble selection

  • Ma, Xiaofeng;Zhang, Yi;Song, Xiangfeng;Fan, Chao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5592-5609
    • /
    • 2017
  • JPEG steganography detection is an active research topic in the field of information hiding due to the wide use of JPEG image in social network, image-sharing websites, and Internet communication, etc. In this paper, a new steganalysis method for content-adaptive JPEG steganography is proposed by integrating the evolutionary feature selection and classifier ensemble selection. First, the whole framework of the proposed steganalysis method is presented and then the characteristic of the proposed method is analyzed. Second, the feature selection method based on genetic algorithm is given and the implement process is described in detail. Third, the method of classifier ensemble selection is proposed based on Pareto evolutionary optimization. The experimental results indicate the proposed steganalysis method can achieve a competitive detection performance by compared with the state-of-the-art steganalysis methods when used for the detection of the latest content-adaptive JPEG steganography algorithms.

Self-optimizing feature selection algorithm for enhancing campaign effectiveness (캠페인 효과 제고를 위한 자기 최적화 변수 선택 알고리즘)

  • Seo, Jeoung-soo;Ahn, Hyunchul
    • Journal of Intelligence and Information Systems
    • /
    • v.26 no.4
    • /
    • pp.173-198
    • /
    • 2020
  • For a long time, many studies have been conducted on predicting the success of campaigns for customers in academia, and prediction models applying various techniques are still being studied. Recently, as campaign channels have been expanded in various ways due to the rapid revitalization of online, various types of campaigns are being carried out by companies at a level that cannot be compared to the past. However, customers tend to perceive it as spam as the fatigue of campaigns due to duplicate exposure increases. Also, from a corporate standpoint, there is a problem that the effectiveness of the campaign itself is decreasing, such as increasing the cost of investing in the campaign, which leads to the low actual campaign success rate. Accordingly, various studies are ongoing to improve the effectiveness of the campaign in practice. This campaign system has the ultimate purpose to increase the success rate of various campaigns by collecting and analyzing various data related to customers and using them for campaigns. In particular, recent attempts to make various predictions related to the response of campaigns using machine learning have been made. It is very important to select appropriate features due to the various features of campaign data. If all of the input data are used in the process of classifying a large amount of data, it takes a lot of learning time as the classification class expands, so the minimum input data set must be extracted and used from the entire data. In addition, when a trained model is generated by using too many features, prediction accuracy may be degraded due to overfitting or correlation between features. Therefore, in order to improve accuracy, a feature selection technique that removes features close to noise should be applied, and feature selection is a necessary process in order to analyze a high-dimensional data set. Among the greedy algorithms, SFS (Sequential Forward Selection), SBS (Sequential Backward Selection), SFFS (Sequential Floating Forward Selection), etc. are widely used as traditional feature selection techniques. It is also true that if there are many risks and many features, there is a limitation in that the performance for classification prediction is poor and it takes a lot of learning time. Therefore, in this study, we propose an improved feature selection algorithm to enhance the effectiveness of the existing campaign. The purpose of this study is to improve the existing SFFS sequential method in the process of searching for feature subsets that are the basis for improving machine learning model performance using statistical characteristics of the data to be processed in the campaign system. Through this, features that have a lot of influence on performance are first derived, features that have a negative effect are removed, and then the sequential method is applied to increase the efficiency for search performance and to apply an improved algorithm to enable generalized prediction. Through this, it was confirmed that the proposed model showed better search and prediction performance than the traditional greed algorithm. Compared with the original data set, greed algorithm, genetic algorithm (GA), and recursive feature elimination (RFE), the campaign success prediction was higher. In addition, when performing campaign success prediction, the improved feature selection algorithm was found to be helpful in analyzing and interpreting the prediction results by providing the importance of the derived features. This is important features such as age, customer rating, and sales, which were previously known statistically. Unlike the previous campaign planners, features such as the combined product name, average 3-month data consumption rate, and the last 3-month wireless data usage were unexpectedly selected as important features for the campaign response, which they rarely used to select campaign targets. It was confirmed that base attributes can also be very important features depending on the type of campaign. Through this, it is possible to analyze and understand the important characteristics of each campaign type.

Real-time processing system for embedded hardware genetic algorithm (임베디드 하드웨어 유전자 알고리즘을 위한 실시간 처리 시스템)

  • Park Se-hyun;Seo Ki-sung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.7
    • /
    • pp.1553-1557
    • /
    • 2004
  • A real-time processing system for embedded hardware genetic algorithm is suggested. In order to operate basic module of genetic algorithm in parallel, such as selection, crossover, mutation and evaluation, dual processors based architecture is implemented. The system consists of two Xscale processors and two FPGA with evolvable hardware, which enables to process genetic algorithm efficiently by distributing the computational load of hardware genetic algorithm to each processors equally. The hardware genetic algorithm runs on Linux OS and the resulted chromosome is executed on evolvable hardware in FPGA. Furthermore, the suggested architecture can be extended easily for a couple of connected processors in serial, making it accelerate to compute a real-time hardware genetic algorithm. To investigate the effect of proposed approach, performance comparisons is experimented for an typical computation of genetic algorithm.

A Bayesian Method to Semiparametric Hierarchical Selection Models (준모수적 계층적 선택모형에 대한 베이지안 방법)

  • 정윤식;장정훈
    • The Korean Journal of Applied Statistics
    • /
    • v.14 no.1
    • /
    • pp.161-175
    • /
    • 2001
  • Meta-analysis refers to quantitative methods for combining results from independent studies in order to draw overall conclusions. Hierarchical models including selection models are introduced and shown to be useful in such Bayesian meta-analysis. Semiparametric hierarchical models are proposed using the Dirichlet process prior. These rich class of models combine the information of independent studies, allowing investigation of variability both between and within studies, and weight function. Here we investigate sensitivity of results to unobserved studies by considering a hierachical selection model with including unknown weight function and use Markov chain Monte Carlo methods to develop inference for the parameters of interest. Using Bayesian method, this model is used on a meta-analysis of twelve studies comparing the effectiveness of two different types of flouride, in preventing cavities. Clinical informative prior is assumed. Summaries and plots of model parameters are analyzed to address questions of interest.

  • PDF

Anthropomorphic Animal Face Masking using Deep Convolutional Neural Network based Animal Face Classification

  • Khan, Rafiul Hasan;Lee, Youngsuk;Lee, Suk-Hwan;Kwon, Oh-Jun;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.5
    • /
    • pp.558-572
    • /
    • 2019
  • Anthropomorphism is the attribution of human traits, emotions, or intentions to non-human entities. Anthropomorphic animal face masking is the process by which human characteristics are plotted on the animal kind. In this research, we are proposing a compact system which finds the resemblance between a human face and animal face using Deep Convolutional Neural Network (DCNN) and later applies morphism between them. The whole process is done by firstly finding which animal most resembles the particular human face through a DCNN based animal face classification. And secondly, doing triangulation based morphing between the particular human face and the most resembled animal face. Compared to the conventional manual Control Point Selection system using an animator, we are proposing a Viola-Jones algorithm based Control Point selection process which detects facial features for the human face and takes the Control Points automatically. To initiate our approach, we built our own dataset containing ten thousand animal faces and a fourteen layer DCNN. The simulation results firstly demonstrate that the accuracy of our proposed DCNN architecture outperforms the related methods for the animal face classification. Secondly, the proposed morphing method manages to complete the morphing process with less deformation and without any human assistance.

Structural damage identification based on modified Cuckoo Search algorithm

  • Xu, H.J.;Liu, J.K.;Lv, Z.R.
    • Structural Engineering and Mechanics
    • /
    • v.58 no.1
    • /
    • pp.163-179
    • /
    • 2016
  • The Cuckoo search (CS) algorithm is a simple and efficient global optimization algorithm and it has been applied to figure out large range of real-world optimization problem. In this paper, a new formula is introduced to the discovering probability process to improve the convergence rate and the Tournament Selection Strategy is adopted to enhance global search ability of the certain algorithm. Then an approach for structural damage identification based on modified Cuckoo search (MCS) is presented. Meanwhile, we take frequency residual error and the modal assurance criterion (MAC) as indexes of damage detection in view of the crack damage, and the MCS algorithm is utilized to identifying the structural damage. A simply supported beam and a 31-bar truss are studied as numerical example to illustrate the correctness and efficiency of the propose method. Besides, a laboratory work is also conducted to further verification. Studies show that, the proposed method can judge the damage location and degree of structures more accurately than its counterpart even under measurement noise, which demonstrates the MCS algorithm has a higher damage diagnosis precision.