• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2511-2520
• /
• 2018

In this study, Multi-Radial Basis Function Support Vector Machine (Multi-RBF SVM) classifier is introduced based on a composite kernel function. In the proposed multi-RBF support vector machine classifier, the input space is divided into several local subsets considered for extremely nonlinear classification tasks. Each local subset is expressed as nonlinear classification subspace and mapped into feature space by using kernel function. The composite kernel function employs the dual RBF structure. By capturing the nonlinear distribution knowledge of local subsets, the training data is mapped into higher feature space, then Multi-SVM classifier is realized by using the composite kernel function through optimization procedure similar to conventional SVM classifier. The original training data set is partitioned by using some unsupervised learning methods such as clustering methods. In this study, three types of clustering method are considered such as Affinity propagation (AP), Hard C-Mean (HCM) and Iterative Self-Organizing Data Analysis Technique Algorithm (ISODATA). Experimental results on benchmark machine learning datasets show that the proposed method improves the classification performance efficiently.

• Structural Engineering and Mechanics
• /
• v.72 no.6
• /
• pp.689-712
• /
• 2019

Time-series models like AR-ARX and ARMAX, provide a robust way to capture the dynamic properties of structures, and their residuals can be effectively used as features for damage detection. Even though several research papers discuss the implementation of AR-ARX and ARMAX models for damage diagnosis, they are basically been exploited so far for detecting the time instant of damage and also the spatial location of the damage. However, the inverse problem associated with damage quantification i.e. extent of damage using time series models is not been reported in the literature. In this paper, an approach to detect the extent of damage by combining the ARMAX model by formulating the inverse problem as a multi-constrained optimization problem and solving using a newly developed hybrid adaptive differential search with dynamic interaction is presented. The proposed variant of the differential search technique employs small multiple populations which perform the search independently and exchange the information with the dynamic neighborhood. The adaptive features and local search ability features are built into the algorithm in order to improve the convergence characteristics and also the overall performance of the technique. The multi-constrained optimization formulations of the inverse problem, associated with damage quantification using time series models, attempted here for the first time, can considerably improve the robustness of the search process. Numerical simulation studies have been carried out by considering three numerical examples to demonstrate the effectiveness of the proposed technique in robustly identifying the extent of the damage. Issues related to modeling errors and also measurement noise are also addressed in this paper.

• Smart Structures and Systems
• /
• v.10 no.4_5
• /
• pp.459-470
• /
• 2012

This paper summarizes a study for the modal analysis and model updating conducted using the monitoring data obtained from the Canton Tower of 610 m tall, which was established as an international benchmark problem by the Hong Kong Polytechnic University. Modal properties of the tower were successfully identified using frequency domain decomposition and stochastic subspace identification methods. Finite element model updating using the measurement data was further performed to reduce the modal property differences between the measurements and those of the finite element model. Over-fitting during the model updating was avoided by using an optimization scheme with a regularization term.

• Communications for Statistical Applications and Methods
• /
• v.13 no.2
• /
• pp.233-241
• /
• 2006

Classical principal component analysis (PCA) can be formulated as finding the linear subspace that best accommodates multidimensional data points in the sense that the sum of squared residual distances is minimized. As alternatives to such LS (least squares) fitting approach, we produce LMS (least median of squares) and LTS (least trimmed squares)-type PCA by minimizing the median of squared residual distances and the trimmed sum of squares, in a similar fashion to Rousseeuw (1984)'s alternative approaches to LS linear regression. Proposed methods adopt the data-driven optimization algorithm of Croux and Ruiz-Gazen (1996, 2005) that is conceptually simple and computationally practical. Numerical examples are given.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.3
• /
• pp.162-170
• /
• 2014

Appearance-based subspace models such as eigenfaces have been widely recognized as one of the most successful approaches to face recognition and tracking. The success of eigenfaces mainly has its origins in the benefits offered by principal component analysis (PCA), the representational power of the underlying generative process for high-dimensional noisy facial image data. The sparse extension of PCA (SPCA) has recently received significant attention in the research community. SPCA functions by imposing sparseness constraints on the eigenvectors, a technique that has been shown to yield more robust solutions in many applications. However, when SPCA is applied to facial images, the time and space complexity of PCA learning becomes a critical issue (e.g., real-time tracking). In this paper, we propose a very fast and scalable greedy forward selection algorithm for SPCA. Unlike a recent semidefinite program-relaxation method that suffers from complex optimization, our approach can process several thousands of data dimensions in reasonable time with little accuracy loss. The effectiveness of our proposed method was demonstrated on real-world face recognition and tracking datasets.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.501-506
• /
• 1998

A mathematical model is developed to describe the relationship between the manipulated variables (e.g. jacket inlet temperature and feed flow rate) and the important qualities (e.g conversion and weight average molecular weight (Mw)) in a continuous polymerization reactor. The subspace-based identification method for Wiener model is used to retrieve from the discrete sample data the accurate information about both the structure and initial parameter estimates for iterative parameter optimization methods. The comparison of the output of the identified Wiener model with the outputs of a non-linear plant model shows a fairly satisfactory degree of accordance.

• East Asian mathematical journal
• /
• v.5 no.1
• /
• pp.95-110
• /
• 1989

In a general variance component model, nonnegative quadratic estimators of the components of variance are considered which are invariant with respect to mean value translaion and have minimum bias (analogously to estimation theory of mean value parameters). Here the minimum is taken over an appropriate cone of positive semidefinite matrices, after having made a reduction by invariance. Among these estimators, which always exist the one of minimum norm is characterized. This characterization is achieved by systems of necessary and sufficient condition, and by a cone restricted pseudoinverse. In models where the decomposing covariance matrices span a commutative quadratic subspace, a representation of the considered estimator is derived that requires merely to solve an ordinary convex quadratic optimization problem. As an example, we present the two way nested classification random model. An unbiased estimator is derived for the mean squared error of any unbiased or biased estimator that is expressible as a linear combination of independent sums of squares. Further, it is shown that, for the classical balanced variance component models, this estimator is the best invariant unbiased estimator, for the variance of the ANOVA estimator and for the mean squared error of the nonnegative minimum biased estimator. As an example, the balanced two way nested classification model with ramdom effects if considered.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.2
• /
• pp.436-444
• /
• 2010

In this study, we introduce and discuss a concept of a granular-oriented radial basis function neural networks (GRBF NNs). In contrast to the typical architectures encountered in radial basis function neural networks(RBF NNs), our main objective is to develop a design strategy of GRBF NNs as follows : (a) The architecture of the network is fully reflective of the structure encountered in the training data which are granulated with the aid of clustering techniques. More specifically, the output space is granulated with use of K-Means clustering while the information granules in the multidimensional input space are formed by using a so-called context-based Fuzzy C-Means which takes into account the structure being already formed in the output space, (b) The innovative development facet of the network involves a dynamic reduction of dimensionality of the input space in which the information granules are formed in the subspace of the overall input space which is formed by selecting a suitable subset of input variables so that the this subspace retains the structure of the entire space. As this search is of combinatorial character, we use the technique of genetic optimization to determine the optimal input subspaces. A series of numeric studies exploiting some nonlinear process data and a dataset coming from the machine learning repository provide a detailed insight into the nature of the algorithm and its parameters as well as offer some comparative analysis.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.2
• /
• pp.153-163
• /
• 2010

In this paper a frequency response analysis using Krylov subspace-based model reduction and its design sensitivity analysis with respect to design variables are presented. Since the frequency response and its design sensitivity information are necessary for a gradient-based optimization, problems of high computational cost and resource may occur in the case that frequency response of a large sized finite element model is involved in the optimization iterations. In the suggested method model order reduction of finite element models are used to calculate both frequency response and frequency response sensitivity, therefore one can maximize the speed of numerical computation for the frequency response and its design sensitivity. As numerical examples, a semi-monocoque shell and an array-type $4{\times}4$ MEMS resonator are adopted to show the accuracy and efficiency of the suggested approach in calculating the FRF and its design sensitivity. The frequency response sensitivity through the model reduction shows a great time reduction in numerical computation and a good agreement with that from the initial full finite element model.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.524-529
• /
• 2004

In this paper, We described the method which developed the optimal control system for air separation unit to change production rates frequently and rapidly. Control models of the process were developed from actual plant data using subspace identification method which is developed by many researchers in resent years. The model consist of a series connection of linear dynamic block and static nonlinear block (Wiener model). The model is controlled by model based predictive controller. In MPC the input is calculated by on-line optimization of a performance index based on predictions by the model, subject to possible constraints. To calculate the optimal the performance index, conditions are expressed by LMI(Linear Matrix Inequalities).In order to access at the Bailey DCS system, we applied the OPC server and developed the Client program. The OPC sever is a device which can access Bailey DCS system.The Client program is developed based on the Matlab language for easy calculation,data simulation and data logging. Using this program, we can apply the optimal input to the DCS system at real time.