Browsing by Author "Hwang, Shiow-Fen"

Now showing 1 - 7 of 7

A novel intelligent multiobjective simulated annealing algorithm for designing robust PID controllers
(2008-03-01)
Hung, Ming-Hao
;
Shu, Li-Sun
;
Ho, Shinn-Jang
;
Hwang, Shiow-Fen
;
Ho, Shinn-Ying
This paper proposes an intelligent multiobjective simulated annealing algorithm (IMOSA) and its application to an optimal proportional integral derivative (PID) controller design problem. A well-designed PID-type controller should satisfy the following objectives: 1) disturbance attenuation; 2) robust stability; and 3) accurate setpoint tracking. The optimal PID controller design problem is a large-scale multiobjective optimization problem characterized by the following: 1) nonlinear multimodal search space; 2) large-scale search space; 3) three tight constraints; 4) multiple objectives; and 5) expensive objective function evaluations. In contrast to existing multiobjective algorithms of simulated annealing, the high performance in IMOSA arises mainly from a novel multiobjective generation mechanism using a Pareto-based scoring function without using heuristics. The multiobjective generation mechanism operates on a high-score nondominated solution using a systematic reasoning method based on an orthogonal experimental design, which exploits its neighborhood to economically generate a set of well-distributed nondominated solutions by, considering individual and overall objectives. IMOSA is evaluated by using a practical design example of a super-maneuverable fighter aircraft system. An efficient existing multiobjective algorithm, the improved strength Pareto evolutionary algorithm, is also applied to the same example for comparison. Simulation results demonstrate high performance of the IMOSA-based method in designing robust PID controllers.
Accurate prediction of enzyme subfamily class using an adaptive fuzzy k-nearest neighbor method
(2007-09-01)
Huang, Wen-Lin
;
Chen, Hung-Ming
;
Hwang, Shiow-Fen
;
Ho, Shinn-Ying
;
生物科技學系
Amphiphilic pseudo-amino acid composition (Am-Pse-AAC) with extra sequence-order information is a useful feature for representing enzymes. This study first utilizes the k-nearest neighbor (k-NN) rule to analyze the distribution of enzymes in the Am-Pse-AAC feature space. This analysis indicates the distributions of multiple classes of enzymes are highly overlapped. To cope with the overlap problem, this study proposes an efficient non-parametric classifier for predicting enzyme subfamily class using an adaptive fuzzy r-nearest neighbor (AFK-NN) method, where k and a fuzzy strength parameter m are adaptively specified. The fuzzy membership values of a query sample Q are dynamically determined according to the position of Q and its weighted distances to the k nearest neighbors. Using the same enzymes of the oxidoreductases family for comparisons, the prediction accuracy of AFK-NN is 76.6%, which is better than those of Support Vector Machine (73.6%), the decision tree method C5.0 (75.4%) and the existing covariant-discriminate algorithm (70.6%) using a jackknife test. To evaluate the generalization ability of AFK-NN, the datasets for all six families of entirely sequenced enzymes are established from the newly updated SWISS-PROT and ENZYME database. The accuracy of AFK-NN on the new large-scale dataset of oxidoreductases family is 83.3%, and the mean accuracy of the six families is 92.1 %. (c) 2006 Elsevier Ireland Ltd. All rights reserved.
Knowledge acquisition and development of accurate rules for predicting protein stability changes
(2006-12-01)
Huang, Liang-Tsung
;
Gromiha, M. Michael
;
Hwang, Shiow-Fen
;
Ho, Shinn-Ying
;
生物科技學系
Knowing the mechanisms by which protein stability change is one of the most important and valuable tasks in molecular biology. The conventional methods of predicting protein stability changes mainly focus on improving prediction accuracy. However, it is desirable to extract domain knowledge from large databases that is beneficial to accurate prediction of the protein stability change. This paper presents an interpretable prediction tree method (named iPTREE) that produces explanatory rules to explore hidden knowledge accompanied with high prediction accuracy and consequently analyzes the factors influencing the protein stability changes. To evaluate iPTREE and the knowledge upon protein stability changes, a thermodynamic dataset consisting of 1615 mutants led by single point mutation from ProTherm is adopted. Being as a predictor for protein stability changes, the rule-based approach can achieve a prediction accuracy of 87%, which is better than other methods based on artificial neural networks (ANN) and support vector machines (SVM). Besides, these methods lack the ability in biological knowledge discovery. The human-interpretable rules produced by iPTREE reveal that temperature is a factor of concern in predicting protein stability changes. For example, one of interpretable rules with high support is as follows: if the introduced residue type is Alanine and temperature is between 4 degrees C and 40 degrees C, then the stability change will be negative (destabilizing). The present study demonstrates that iPTREE can easily be used in the application of protein stability changes where one requires more understandable knowledge. (c) 2006 Elsevier Ltd. All rights reserved.
Prediction of protein mutant stability using classification and regression tool
(2007-02-01)
Huang, Liang-Tsung
;
Saraboji, K.
;
Ho, Shinn-Ying
;
Hwang, Shiow-Fen
;
Ponnuswamy, M. N.
Prediction of protein stability upon amino acid substitutions is an important problem in molecular biology and the solving of which would help for designing stable mutants. In this work, we have analyzed the stability of protein mutants using two different datasets of 1396 and 2204 mutants obtained from ProTherm database, respectively for free energy change due to thermal (Delta Delta G) and denaturant denaturations (Delta Delta G(H2O)). We have used a set of 48 physical, chemical energetic and conformational properties of amino acid residues and computed the difference of amino acid properties for each mutant in both sets of data. These differences in amino acid properties have been related to protein stability (Delta Delta G and Delta Delta G(H2O)) and are used to train with classification and regression tool for predicting the stability of protein mutants. Further, we have tested the method with 4 fold, 5 fold and 10 fold cross validation procedures. We found that the physical properties, shape and flexibility are important determinants of protein stability. The classification of mutants based on secondary structure (helix, strand, turn and coil) and solvent accessibility (buried, partially buried, partially exposed and exposed) distinguished the stabilizing/destabilizing mutants at an average accuracy of 81% and 80%, respectively for Delta Delta G and Delta Delta G(H2o). The correlation between the experimental and predicted stability change is 0.61 for Delta Delta G and 0.44 for Delta Delta G(H2O). Further, the free energy change due to the replacement of amino acid residue has been predicted within an average error of 1.08 kcal/mol and 1.37 kcal/mol for thermal and chemical denaturation, respectively. The relative importance of secondary structure and solvent accessibility, and the influence of the dataset on prediction of protein mutant stability have been discussed. (c) 2006 Elsevier B.V All rights reserved.
ProLoc-GO: Utilizing informative Gene Ontology terms for sequence-based prediction of protein subcellular localization
(2008-02-01)
Huang, Wen-Lin
;
Tung, Chun-Wei
;
Ho, Shih-Wen
;
Hwang, Shiow-Fen
;
Ho, Shinn-Ying
Background: Gene Ontology (GO) annotation, which describes the function of genes and gene products across species, has recently been used to predict protein subcellular and subnuclear localization. Existing GO-based prediction methods for protein subcellular localization use the known accession numbers of query proteins to obtain their annotated GO terms. An accurate prediction method for predicting subcellular localization of novel proteins without known accession numbers, using only the input sequence, is worth developing. Results: This study proposes an efficient sequence-based method (named ProLoc-GO) by mining informative GO terms for predicting protein subcellular localization. For each protein, BLAST is used to obtain a homology with a known accession number to the protein for retrieving the GO annotation. A large number n of all annotated GO terms that have ever appeared are then obtained from a large set of training proteins. A novel genetic algorithm based method (named GOmining) combined with a classifier of support vector machine (SVM) is proposed to simultaneously identify a small number m out of the n GO terms as input features to SVM, where m << n. The m informative GO terms contain the essential GO terms annotating subcellular compartments such as GO: 0005634 (Nucleus), GO: 0005737 (Cytoplasm) and GO: 0005856 (Cytoskeleton). Two existing data sets SCL12 (human protein with 12 locations) and SCL16 (Eukaryotic proteins with 16 locations) with < 25% sequence identity are used to evaluate ProLoc-GO which has been implemented by using a single SVM classifier with the m = 44 and m = 60 informative GO terms, respectively. ProLoc-GO using input sequences yields test accuracies of 88.1% and 83.3% for SCL12 and SCL16, respectively, which are significantly better than the SVM-based methods, which achieve < 35% test accuracies using amino acid composition (AAC) with acid pairs and AAC with dipedtide composition. For comparison, ProLoc-GO using known accession numbers of query proteins yields test accuracies of 90.6% and 85.7%, which is also better than Hum-PLoc (85.0%) and Euk-OET-PLoc (83.7%) using ensemble classifiers with hybridization of GO terms and amphiphilic pseudo amino acid composition for SCL12 and SCL16, respectively. Conclusion: The growth of Gene Ontology in size and popularity has increased the effectiveness of GO-based features. GOmining can serve as a tool for selecting informative GO terms in solving sequence-based prediction problems. The prediction system using ProLoc-GO with input sequences of query proteins for protein subcellular localization has been implemented (see Availability).
ProLoc: Prediction of protein subnuclear localization using SVM with automatic selection from physicochemical composition features
(2007-09-01)
Huang, Wen-Lin
;
Tung, Chun-Wei
;
Huang, Hui-Ling
;
Hwang, Shiow-Fen
;
Ho, Shinn-Ying
Accurate prediction methods of protein subnuclear localizations rely on the cooperation between informative features and classifier design. Support vector machine (SVM) based learning methods are shown effective for predictions of protein subcellular and subnuclear localizations. This study proposes an evolutionary support vector machine (ESVM) based classifier with automatic selection from a large set of physicochernical composition (PCC) features to design an accurate system for predicting protein subnuclear localization, named ProLoc. ESVM using an inheritable genetic algorithm combined with SVM can automatically determine the best number m of PCC features and identify m out of 526 PCC features simultaneously. To evaluate ESVM, this study uses two datasets SNL6 and SNL9, which have 504 proteins localized in 6 subnuclear compartments and 370 proteins localized in 9 subnuclear compartments. Using a leave-one-out cross-validation, ProLoc utilizing the selected m = 33 and 28 PCC features has accuracies of 56.37% for SNL6 and 72.82% for SNL9, which are better than 51.4% for the SVM-based system using k-peptide composition features applied on SNL6, and 64.32% for an optimized evidence-theoretic k-nearest neighbor classifier utilizing pseudo amino acid composition applied on SNL9, respectively. (C) 2007 Elsevier Ireland Ltd. All rights reserved.
SODOCK: Swarm optimization for highly flexible protein-ligand docking
(2007-01-30)
Chen, Hung-Ming
;
Liu, Bo-Fu
;
Huang, Hui-Ling
;
Hwang, Shiow-Fen
;
Ho, Shinn-Ying
Protein-ligand docking can be formulated as a parameter optimization problem associated with an accurate scoring function, which aims to identify the translation, orientation, and conformation of a docked ligand with the lowest energy. The parameter optimization problem for highly flexible ligands with many rotatable bonds is more difficult than that for less flexible ligands using genetic algorithm (GA)-based approaches, due to the large numbers of parameters and high correlations among these parameters. This investigation presents a novel optimization algorithm SODOCK based on particle swarm optimization (PSO) for solving flexible protein-ligand docking problems. To improve efficiency and robustness of PSO, an efficient local search strategy is incorporated into SODOCK. The implementation of SODOCK adopts the environment and energy function of AutoDock 3.05. Computer simulation results reveal that SODOCK is superior to the Lamarckian genetic algorithm (LGA) of AutoDock. in terms of convergence performance, robustness, and obtained energy, especially for highly flexible ligands. The results also reveal that PSO is more suitable than the conventional GA in dealing with flexible docking problems with high correlations among parameters. This investigation also compared SODOCK with four state-of-the-art docking methods, namely GOLD 1.2, DOCK 4.0, FlexX 1.8, and LGA of AutoDock 3.05. SODOCK obtained the smallest RMSD in 19 of 37 cases. The average 2.29 angstrom of the 37 RMSD values of SODOCK was better than those of other docking programs, which were all above 3.0 angstrom. (C) 2006 Wiley Periodicals, Inc.