• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.32 no.2
• /
• pp.125-132
• /
• 2019

This paper presents a seismic reliability analysis method for an offshore wind turbine with a twisted tripod support structure under earthquake loading. A three dimensional dynamic finite element model is proposed to consider the nonlinearity of the ground-pile interactions and the geometrical characteristics of the twisted tripod support structure where out-of-plane displacement occurs even under in-plane lateral loadings. For the evaluation of seismic reliability, the failure probability was calculated for the maximum horizontal displacement of the pile head, which is calculated from time history analysis using artificial earthquakes for the design return periods. The application of the subset simulation method using the Markov Chain Monte Carlo(MCMC) sampling is proposed for efficient reliability analysis considering the limit state equation evaluation by the nonlinear time history analysis. The proposed method can be applied to the reliability evaluation and design criteria development of the offshore wind turbine with twisted tripod support structure in which two dimensional models and static analysis can not produce accurate results.

• Journal of Intelligence and Information Systems
• /
• v.20 no.4
• /
• pp.121-139
• /
• 2014

Predicting corporate failure has been an important topic in accounting and finance. The costs associated with bankruptcy are high, so the accuracy of bankruptcy prediction is greatly important for financial institutions. Lots of researchers have dealt with the topic associated with bankruptcy prediction in the past three decades. The current research attempts to use ensemble models for improving the performance of bankruptcy prediction. Ensemble classification is to combine individually trained classifiers in order to gain more accurate prediction than individual models. Ensemble techniques are shown to be very useful for improving the generalization ability of the classifier. Bagging is the most commonly used methods for constructing ensemble classifiers. In bagging, the different training data subsets are randomly drawn with replacement from the original training dataset. Base classifiers are trained on the different bootstrap samples. Instance selection is to select critical instances while deleting and removing irrelevant and harmful instances from the original set. Instance selection and bagging are quite well known in data mining. However, few studies have dealt with the integration of instance selection and bagging. This study proposes an improved bagging ensemble based on instance selection using genetic algorithms (GA) for improving the performance of SVM. GA is an efficient optimization procedure based on the theory of natural selection and evolution. GA uses the idea of survival of the fittest by progressively accepting better solutions to the problems. GA searches by maintaining a population of solutions from which better solutions are created rather than making incremental changes to a single solution to the problem. The initial solution population is generated randomly and evolves into the next generation by genetic operators such as selection, crossover and mutation. The solutions coded by strings are evaluated by the fitness function. The proposed model consists of two phases: GA based Instance Selection and Instance based Bagging. In the first phase, GA is used to select optimal instance subset that is used as input data of bagging model. In this study, the chromosome is encoded as a form of binary string for the instance subset. In this phase, the population size was set to 100 while maximum number of generations was set to 150. We set the crossover rate and mutation rate to 0.7 and 0.1 respectively. We used the prediction accuracy of model as the fitness function of GA. SVM model is trained on training data set using the selected instance subset. The prediction accuracy of SVM model over test data set is used as fitness value in order to avoid overfitting. In the second phase, we used the optimal instance subset selected in the first phase as input data of bagging model. We used SVM model as base classifier for bagging ensemble. The majority voting scheme was used as a combining method in this study. This study applies the proposed model to the bankruptcy prediction problem using a real data set from Korean companies. The research data used in this study contains 1832 externally non-audited firms which filed for bankruptcy (916 cases) and non-bankruptcy (916 cases). Financial ratios categorized as stability, profitability, growth, activity and cash flow were investigated through literature review and basic statistical methods and we selected 8 financial ratios as the final input variables. We separated the whole data into three subsets as training, test and validation data set. In this study, we compared the proposed model with several comparative models including the simple individual SVM model, the simple bagging model and the instance selection based SVM model. The McNemar tests were used to examine whether the proposed model significantly outperforms the other models. The experimental results show that the proposed model outperforms the other models.

• Journal of Radiopharmaceuticals and Molecular Probes
• /
• v.3 no.2
• /
• pp.65-71
• /
• 2017

To assess the effects of filter and reconstruction of Cu-64 PET data on Siemens scanner, the various reconstruction algorithm with various filters were assessed in terms of spatial resolution, non-uniformity (NU), recovery coefficient (RC), and spillover ratio (SOR). Image reconstruction was performed using filtered backprojection (FBP), 2D ordered subset expectation maximization (OSEM), 3D reprojection algorithm (3DRP), and maximum a posteriori algorithms (MAP). For the FBP reconstruction, ramp, butterworth, hamming, hanning, or parzen filters were used. Attenuation or scatter correction were performed to assess the effect of attenuation and scatter correction. Regarding spatial resolution, highest achievable volumetric resolution was $3.08mm^3$ at the center of FOV when MAP (${\beta}=0.1$) reconstruction method was used. SOR was below 4% for FBP when ramp, Hamming, Hanning, or Shepp-logan filter were used. The lowest NU (highest uniform) after attenuation & scatter correction was 5.39% when FBP (parzen filter) was used. Regarding RC, 0.9 < RC < 1.1 was obtained when OSEM (iteration: 10) was used when attenuation and scatter correction were applied. In this study, image quality of Cu-64 on Siemens Inveon PET was investigated. This data will helpful for the quantification of Cu-64 PET data.

• Journal of Korean Neurosurgical Society
• /
• v.41 no.4
• /
• pp.217-223
• /
• 2007

Objective : The apparent increase in the incidence of the intracranial meningiomas in the elderly is due in part to improved diagnostic tools and improved span of life. The authors carried out a retrospect study to validate the use of the Clinical-Radiological Grading System [CRGS] as a clinical tool to orientate surgical decision making in elderly patients and to explore prognostic factors of survival. Methods : From January 1997 to January 2006, the authors consecutively recruited and surgically treated 20 patients older than 65 years of age with radiologic findings of intracranial meningiomas and a preoperative evaluation based on the CRGS. Results : High CRGS score was associated with a higher probability of good outcome [p=0.004] and a lower probability of postoperative complications [p=0.049]. Among the different subset items of the CRGS score, larger maximum tumor diameters [$D{\geqq}4cm$] and the presence of a severe peritumoral edema were associated with incidence rate of postoperative poor outcome and complications [p<0.05]. Additionally, the critical location of the tumor was also correlated with poor outcome [p<0.05]. Conclusion : A CRGS score higher than 13 is a good prognostic indication of survival. The CRGS score is a useful and practical tool for the selection of elderly patients affected by intracranial meningiomas as surgical candidates.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.5
• /
• pp.437-446
• /
• 2016

Feature selection has become an essential technique to reduce the dimensionality of data sets. Many features are frequently irrelevant or redundant for the classification tasks. The purpose of feature selection is to select relevant features and remove irrelevant and redundant features. Applications of the feature selection range from text processing, face recognition, bioinformatics, speaker verification, and medical diagnosis to financial domains. In this study, we focus on filter methods based on information entropy : IG (Information Gain), FCBF (Fast Correlation Based Filter), and mRMR (minimum Redundancy Maximum Relevance). FCBF has the advantage of reducing computational burden by eliminating the redundant features that satisfy the condition of approximate Markov blanket. However, FCBF considers only the relevance between the feature and the class in order to select the best features, thus failing to take into consideration the interaction between features. In this paper, we propose an improved FCBF to overcome this shortcoming. We also perform a comparative study to evaluate the performance of the proposed method.

• Communications for Statistical Applications and Methods
• /
• v.24 no.4
• /
• pp.383-396
• /
• 2017

The model in our approach assumes that computer responses are a realization of a Gaussian processes superimposed on a regression model called a Gaussian process regression model (GPRM). Selecting a subset of variables or building a good reduced model in classical regression is an important process to identify variables influential to responses and for further analysis such as prediction or classification. One reason to select some variables in the prediction aspect is to prevent the over-fitting or under-fitting to data. The same reasoning and approach can be applicable to GPRM. However, only a few works on the variable selection in GPRM were done. In this paper, we propose a new algorithm to build a good prediction model among some GPRMs. It is a post-work of the algorithm that includes the Welch method suggested by previous researchers. The proposed algorithms select some non-zero regression coefficients (${\beta}^{\prime}s$) using forward and backward methods along with the Lasso guided approach. During this process, the fixed were covariance parameters (${\theta}^{\prime}s$) that were pre-selected by the Welch algorithm. We illustrated the superiority of our proposed models over the Welch method and non-selection models using four test functions and one real data example. Future extensions are also discussed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4476-4490
• /
• 2017

The aim of image annotation is to determine labels that can accurately describe the semantic information of images. Many approaches have been proposed to automate the image annotation task while achieving good performance. However, in most cases, the semantic similarities of images are ignored. Towards this end, we propose a novel Visual-Semantic Nearest Neighbor (VS-KNN) method by collectively exploring visual and semantic similarities for image annotation. First, for each label, visual nearest neighbors of a given test image are constructed from training images associated with this label. Second, each neighboring subset is determined by mining the semantic similarity and the visual similarity. Finally, the relevance between the images and labels is determined based on maximum a posteriori estimation. Extensive experiments were conducted using three widely used image datasets. The experimental results show the effectiveness of the proposed method in comparison with state-of-the-arts methods.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.233-238
• /
• 2007

An approach to identify Chinese event types is proposed in this paper which combines a good feature selection policy and a Maximum Entropy (ME) model. The approach not only effectively alleviates the problem that classifier performs poorly on the small and difficult types, but improve overall performance. Experiments on the ACE2005 corpus show that performance is satisfying with the 83.5% macro - average F measure. The main characters and ideas of the approach are: (1) Optimal feature set is built for each type according to local feature selection, which fully ensures the performance of each type. (2) Positive and negative features are explicitly discriminated and combined by using one - sided metrics, which makes use of both features' advantages. (3) Wrapper methods are used to search new features and evaluate the various feature subsets to obtain the optimal feature subset.

• Journal of Satellite, Information and Communications
• /
• v.12 no.2
• /
• pp.51-55
• /
• 2017

This paper aims to maximize the energy harvesting rate and channel capacity in RF-energy harvesting networks (RF-EHNs) under the constraints of maximum transmit power and minimum quality of service (QoS) in terms of rate capacity for each user. We study a multi-user RF-EHN with frequency division multiple access (FDMA) in a Rayleigh channel. An access point (AP) simultaneously transmitting wireless information and power in the RF-EHN serves a subset of active users which have a power-splitting antenna. To gauge the network performance, we define energy efficiency (EE) and propose an optimization solution for maximizing EE with Lagrangian dual decomposition theory. In simulation results, we confirm that the EE is effectively maximized by the proposed solution with satisfying the given constraints.

• The Korean Journal of Applied Statistics
• /
• v.33 no.6
• /
• pp.683-696
• /
• 2020

The aim of this research is to find an optimal gene set that provides highly accurate multi-class classification with a minimum number of genes. A two-stage procedure is proposed: Based on minimum redundancy and maximum relevance (mRMR) framework, several statistics to rank differential expression genes and K-means clustering to reduce redundancy between genes are used for data filtering procedure. And a particle swarm optimization is modified to select a small subset of informative genes. Two well known multi-class microarray data sets, ALL and SRBCT, are analyzed to indicate the effectiveness of this hybrid method.