• 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.

• Communications for Statistical Applications and Methods
• /
• 제29권6호
• /
• pp.721-733
• /
• 2022

In this paper we compare parameter estimation by Grassmann manifold optimization and sequential candidate set algorithm in a structured principal fitted component (PFC) model. The structured PFC model extends the form of the covariance matrix of a random error to relieve the limits that occur due to too simple form of the matrix. However, unlike other PFC models, structured PFC model does not have a closed form for parameter estimation in dimension reduction which signals the need of numerical computation. The numerical computation can be done through Grassmann manifold optimization and sequential candidate set algorithm. We conducted numerical studies to compare the two methods by computing the results of sequential dimension testing and trace correlation values where we can compare the performance in determining dimension and estimating the basis. We could conclude that Grassmann manifold optimization outperforms sequential candidate set algorithm in dimension determination, while sequential candidate set algorithm is better in basis estimation when conducting dimension reduction. We also applied the methods in real data which derived the same result.

• Journal of Electrical Engineering and Technology
• /
• 제5권2호
• /
• pp.179-190
• /
• 2010

This paper describes a new stochastic heuristic algorithm in engineering problem optimization especially in power system applications. An improved particle swarm optimization (PSO) called adaptive particle swarm optimization (APSO), mixed with simulated annealing (SA), is introduced and referred to as APSO-SA. This algorithm uses a novel PSO algorithm (APSO) to increase the convergence rate and incorporate the ability of SA to avoid being trapped in a local optimum. The APSO-SA algorithm efficiency is verified using some benchmark functions. This paper presents the application of APSO-SA to find the optimal location, type and size of flexible AC transmission system devices. Two types of FACTS devices, the thyristor controlled series capacitor (TCSC) and the static VAR compensator (SVC), are considered. The main objectives of the presented method are increasing the voltage stability index and over load factor, decreasing the cost of investment and total real power losses in the power system. In this regard, two cases are considered: single-type devices (same type of FACTS devices) and multi-type devices (combination of TCSC, SVC). Using the proposed method, the locations, type and sizes of FACTS devices are obtained to reach the optimal objective function. The APSO-SA is used to solve the above non.linear programming optimization problem for better accuracy and fast convergence and its results are compared with results of conventional PSO. The presented method expands the search space, improves performance and accelerates to the speed convergence, in comparison with the conventional PSO algorithm. The optimization results are compared with the standard PSO method. This comparison confirms the efficiency and validity of the proposed method. The proposed approach is examined and tested on IEEE 14 bus systems by MATLAB software. Numerical results demonstrate that the APSO-SA is fast and has a much lower computational cost.

• Structural Engineering and Mechanics
• /
• 제62권3호
• /
• pp.259-272
• /
• 2017

In this study, recently developed swarm intelligence algorithm called Social Spider Optimization (SSO) approach and its enhanced version of SSO algorithm with spider jump techniques is used to develop a structural optimization technique for steel space structures. The improved version of SSO uses adaptive randomness probability in generating new solutions. The objective function of the design optimization problem is taken as the weight of a steel space structure. Constraints' functions are implemented from American Institute of Steel Construction-Load Resistance factor design (AISC-LRFD) and Ad Hoc Committee report and practice which cover strength, serviceability and geometric requirements. Three steel space structures are optimized using both standard SSO and SSO with spider jump (SSO_SJ) algorithms and the results are compared with those available in the literature in order to investigate the performance of the proposed algorithms.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2000년도 추계학술대회 논문집
• /
• pp.1006-1009
• /
• 2000

In this study, a multi-step optimization technique combined with a simple genetic algorithm is introduced in order to minimize the static compliance, the dynamic compliance, and the weight of a high speed machining center simultaneously. Dimensional thicknesses of the eight structural members on the static force loop are adopted as design variables. The first optimization step is a static design optimization, in which the static compliance and the weight are minimized under some dimensional and safety constraints. The second step is a dynamic design optimization, where the dynamic compliance and the weight are minimized under the same constraints. After optimization, the weight of the moving body only was reduced to 57.75% and the weight of the whole machining center was reduced to 46.2% of the initial design respectively. Both static and dynamic compliances of the optimum design are also in the feasible range even though they were slightly increased than before.

• 대한기계학회논문집A
• /
• 제29권8호
• /
• pp.1061-1069
• /
• 2005

In part I of this papter Nonlinear Response Optimization using Equivalent Static Loads (NROESL) method/algorithm is developed to conduct optimization for nonlinear behavior structures. The method/algorithm is also verified to show its convergency and optimality. In this present paper, the NROESL algorithm is applied to several structural problems with geometric and/or material nonlinearity. Conventional optimization with sensitivity analysis using the finite difference method is also applied to the same examples. The results of the optimizations are compared. The proposed method is very efficient and derives good solutions.

• 한국정밀공학회지
• /
• 제18권11호
• /
• pp.155-160
• /
• 2001

To achieve high precision cutting as well as production capability in the machine tool, it is needed to develop excellent rigidity statically, dynamically and thermally as well. In order to predict the qualitative behavior of a machine tool, simultaneous analysis of mechanics and heat transfer is required. Generally, machine tool designers have solved designing problems based on partial estimation of the specified rigidity. This study clears the inter-relationship between therm, and propose multi-phase optimization of machine tool structure using a genetic algorithm. The multi-phase solution method is consists of a series of mechanical design problem. At this first phase of static design problem, multi-objective optimization for the purpose of minimization of the total weight and static compliance minimization is solved using the Pareto Genetic Algorithm.

• Smart Structures and Systems
• /
• 제20권5호
• /
• pp.607-618
• /
• 2017

In this research, a newly developed nature-inspired optimization method, the Lion Pride Optimization algorithm (LPOA), is utilized for optimal design of composite steel box girder bridges. A composite box girder bridge is one of the common types of bridges used for medium spans due to their economic, aesthetic, and structural benefits. The aim of the present optimization procedure is to provide a feasible set of design variables in order to minimize the weight of the steel trapezoidal box girders. The solution space is delimited by different types of design constraints specified by the American Association of State Highway and Transportation Officials. Additionally, the optimal solution obtained by LPOA is compared to the results of other well-established meta-heuristic algorithms, namely Gray Wolf Optimization (GWO), Ant Lion Optimizer (ALO) and the results of former researches. By this comparison the capability of the LPOA in optimal design of composite steel box girder bridges is demonstrated.

• Steel and Composite Structures
• /
• 제33권5호
• /
• pp.747-753
• /
• 2019

Metaheuristic algorithm is used to solve the weight minimization problem of truss structures considering shape, and sizing design variables. The cross-sectional areas of the line element in trusses are the design variables for size optimization and the changeable joint coordinates are the shape optimization used in this study. The design of plane and spatial truss structures are optimized by metaheuristic technique named Teaching-Learning-Based Optimization (TLBO). Finite element analyses of structures and optimization process are carried out by the computer program visually developed by the authors coded in MATLAB. The four benchmark problems (trusses 2D ten-bar, 3D thirty-seven-bar, 3D seventy-two-bar and 2D two-hundred-bar) taken from literature are optimized and the optimal solution compared the results given by previous studies.

• 대한기계학회논문집A
• /
• 제29권1호
• /
• pp.45-52
• /
• 2005

A general approximate optimization technique by sequential design domain(SDD) did not save response values for getting an approximate function in each step. It has a disadvantage at aspect of an expense. In this paper, previous response values are recycled for constructing an approximate function. For this reason, approximation function is more accurate. Accordingly, even if we did not determine move limit, a system is converged to the optimal design. Size and shape optimization using approximate optimization technique is carried out with SDD. Algorithm executing Pro/Engineer and ANSYS are automatically adopted in the approximate optimization program by SDD. Convergence criterion is defined such that optimal point must be located within SDD during the three steps. The PLBA(Pshenichny-Lim-Belegundu-Arora) algorithm is used to solve approximate optimization problems. This algorithm uses the second-order information in the direction finding problem and uses the active set strategy.