• Journal of Information Processing Systems
• /
• 제15권1호
• /
• pp.116-126
• /
• 2019

In this paper, an improved one-against-one support vector machine algorithm is used to classify multiple power quality disturbances. To solve the problem of parameter selection, an improved particle swarm optimization algorithm is proposed to optimize the parameters of the support vector machine. By proposing a new inertia weight expression, the particle swarm optimization algorithm can effectively conduct a global search at the outset and effectively search locally later in a study, which improves the overall classification accuracy. The experimental results show that the improved particle swarm optimization method is more accurate than a grid search algorithm optimization and other improved particle swarm optimizations with regard to its classification of multiple power quality disturbances. Furthermore, the number of support vectors is reduced.

• Earthquakes and Structures
• /
• 제16권6호
• /
• pp.679-690
• /
• 2019

This paper presents machine learning methods using Support Vector Machine (SVM) and Multilayer Perceptron (MLP) to analyze optimal damper distribution for structural vibration control. Regarding different building structures, a genetic algorithm based optimization method is used to determine optimal damper distributions that are further used as training samples. The structural features, the objective function, the number of dampers, etc. are used as input features, and the distribution of dampers is taken as an output result. In the case of a few number of damper distributions, multi-class prediction can be performed using SVM and MLP respectively. Moreover, MLP can be used for regression prediction in the case where the distribution scheme is uncountable. After suitable post-processing, good results can be obtained. Numerical results show that the proposed method can obtain the optimized damper distributions for different structures under different objective functions, which achieves better control effect than the traditional uniform distribution and greatly improves the optimization efficiency.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2003년도 춘계학술대회 논문집
• /
• pp.504-509
• /
• 2003

In this paper, a multi-step optimization using a G.A.(Genetic Algorithm) with variable penalty function is introduced to the structural design optimization of a high speed machining center. The design problem, in this case, is to find out the best cross-section shapes and dimensions of structural members which minimize the static compliance, the dynamic compliance, and the weight of the machine structure simultaneously. The first step is the cross-section shape optimization, in which only the section members are selected to survive whose cross-section area have above a critical value. The second step is a static design optimization, in which the static compliance and the weight of the machine structure are minimized under some dimensional constraints and deflection limits. The third step is a dynamic design optimization, where the dynamic compliance and the structure weight are minimized under the same constraints as those of the second step. The proposed design optimization method was successful applied to the machining center structural design optimization. As a result, static and dynamic compliances were reduced to 16% and 53% respectively from the initial design, while the weight of the structure are also reduced slightly.

• 전기학회논문지
• /
• 제67권8호
• /
• pp.1071-1079
• /
• 2018

In this study, the design methodology as well as network architecture of Support Vector Machine based Polynomial Neural Network, which is a kind of the dynamically generated neural networks, is introduced. The Support Vector Machine based polynomial neural networks is given as a novel network architecture redesigned with the aid of polynomial neural networks and Support Vector Machine. The generic polynomial neural networks, whose nodes are made of polynomials, are dynamically generated in each layer-wise. The individual nodes of the support vector machine based polynomial neural networks is constructed as a support vector machine, and the nodes as well as layers of the support vector machine based polynomial neural networks are dynamically generated as like the generation process of the generic polynomial neural networks. Support vector machine is well known as a sort of robust pattern classifiers. In addition, in order to enhance the structural flexibility as well as the classification performance of the proposed classifier, multi-objective particle swarm optimization is used. In other words, the optimization algorithm leads to sequentially successive generation of each layer of support vector based polynomial neural networks. The bench mark data sets are used to demonstrate the pattern classification performance of the proposed classifiers through the comparison of the generalization ability of the proposed classifier with some already studied classifiers.

• International Journal of Computer Science & Network Security
• /
• 제23권10호
• /
• pp.49-56
• /
• 2023

Computer architecture serves as a link between application requirements and underlying technology capabilities such as technical, mathematical, medical, and business applications' computational and storage demands are constantly increasing. Machine learning these days grown and used in many fields and it performed better than traditional computing in applications that need to be implemented by using mathematical algorithms. A mathematical algorithm requires more extensive and quicker calculations, higher computer architecture specification, and takes longer execution time. Therefore, there is a need to improve the use of computer hardware such as CPU, memory, etc. optimization has a main role to reduce the execution time and improve the utilization of computer recourses. And for the importance of execution time in implementing machine learning supervised module linear regression, in this paper we focus on optimizing machine learning algorithms, for this purpose we write a (Diabetes prediction program) and applying on it a Practical Swarm Optimization (PSO) to reduce the execution time and improve the utilization of computer resources. Finally, a massive improvement in execution time were observed.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 추계학술대회 논문집
• /
• pp.23-27
• /
• 1997

This paper introduces the structural design optimization of a high speed machining center using multi-step optimization combined with G.A.(Genetic Algorithm) and Weighted Method. In this case, the design problem is to find out the best design variables which minimize the static compliance, the dynamic compliance, and the weight of the machine structure simultaneously. Dimensional thicknesses of the thirteen structural members of the machine structure are adopted as design variables. The first step is the cross-section configuration optimization, in which the area moment of inertia of the cross-section for each structural member is maximized while its area is kept constant The second step is a static design optimization, In which the static compliance and the weight of the machine structure are minimized under some dimensional and safety constraints. The third step IS a dynamic design optimization, where the dynamic compliance and the structure weight are minimized under the same constraints. After optunization, static and dynamic compliances were reduced to 62.3% and 95.7% Eorn the initial design, while the weight of the moving bodies are also in the feaslble range.

• Journal of Electrical Engineering and Technology
• /
• 제7권4호
• /
• pp.530-537
• /
• 2012

In the recent past, genetic algorithm (GA) and evolutionary optimization scheme have become increasingly popular for the design of electromagnetic (EM) devices. However, the conventional GA suffers from computational drawback and parameter dependency when applied to a computationally expensive problem, such as practical EM optimization design. To overcome these issues, a hybrid optimization scheme using GA in conjunction with Kriging is proposed. The algorithm is validated by using two mathematical problems and by optimizing rotor structure of interior permanent magnet synchronous machine.

• 한국공간구조학회논문집
• /
• 제21권4호
• /
• pp.39-48
• /
• 2021

In this paper, a GAN-based data augmentation method is proposed for topology optimization. In machine learning techniques, a total amount of dataset determines the accuracy and robustness of the trained neural network architectures, especially, supervised learning networks. Because the insufficient data tends to lead to overfitting or underfitting of the architectures, a data augmentation method is need to increase the amount of data for reducing overfitting when training a machine learning model. In this study, the Ganerative Adversarial Network (GAN) is used to augment the topology optimization dataset. The produced dataset has been compared with the original dataset.

• ETRI Journal
• /
• 제44권5호
• /
• pp.837-848
• /
• 2022

Analog circuit design is comparatively more complex than its digital counterpart due to its nonlinearity and low level of abstraction. This study proposes a novel low-level hybrid of the sine-cosine algorithm (SCA) and modified grey-wolf optimization (mGWO) algorithm for machine learning-based design automation of CMOS analog circuits using an all-CMOS voltage reference circuit in 40-nm standard process. The optimization algorithm's efficiency is further tested using classical functions, showing that it outperforms other competing algorithms. The objective of the optimization is to minimize the variation and power usage, while satisfying all the design limitations. Through the interchange of scripts for information exchange between two environments, the SCA-mGWO algorithm is implemented and simultaneously simulated. The results show the robustness of analog circuit design generated using the SCA-mGWO algorithm, over various corners, resulting in a percentage variation of 0.85%. Monte Carlo analysis is also performed on the presented analog circuit for output voltage and percentage variation resulting in significantly low mean and standard deviation.

• International Journal of Computer Science & Network Security
• /
• 제23권4호
• /
• pp.116-122
• /
• 2023

Sentiment categorization technique be commonly isolated interested in threes significant classifications name Machine Learning Procedure (ML), Lexicon Based Method (LB) also finally, the Hybrid Method. In Machine Learning Methods (ML) utilizes phonetic highlights with apply notable ML algorithm. In this paper, in classification and identification be complete base under in optimizations technique called sequential minimal optimization with Random Forest algorithm (SMORF) for expanding the exhibition and proficiency of sentiment classification framework. The three existing classification algorithms are compared with proposed SMORF algorithm. Imitation result within experiential structure is Precisions (P), recalls (R), F-measures (F) and accuracy metric. The proposed sequential minimal optimization with Random Forest (SMORF) provides the great accuracy.