• Title/Summary/Keyword: Recommended Algorithm

Search Result 271, Processing Time 0.028 seconds

Usage of coot optimization-based random forests analysis for determining the shallow foundation settlement

  • Yi, Han;Xingliang, Jiang;Ye, Wang;Hui, Wang
    • Geomechanics and Engineering
    • /
    • v.32 no.3
    • /
    • pp.271-291
    • /
    • 2023
  • Settlement estimation in cohesion materials is a crucial topic to tackle because of the complexity of the cohesion soil texture, which could be solved roughly by substituted solutions. The goal of this research was to implement recently developed machine learning features as effective methods to predict settlement (Sm) of shallow foundations over cohesion soil properties. These models include hybridized support vector regression (SVR), random forests (RF), and coot optimization algorithm (COM), and black widow optimization algorithm (BWOA). The results indicate that all created systems accurately simulated the Sm, with an R2 of better than 0.979 and 0.9765 for the train and test data phases, respectively. This indicates extraordinary efficiency and a good correlation between the experimental and simulated Sm. The model's results outperformed those of ANFIS - PSO, and COM - RF findings were much outstanding to those of the literature. By analyzing established designs utilizing different analysis aspects, such as various error criteria, Taylor diagrams, uncertainty analyses, and error distribution, it was feasible to arrive at the final result that the recommended COM - RF was the outperformed approach in the forecasting process of Sm of shallow foundation, while other techniques were also reliable.

LSTM algorithm to determine the state of minimum horizontal stress during well logging operation

  • Arsalan Mahmoodzadeh;Seyed Mehdi Seyed Alizadeh;Adil Hussein Mohammed;Ahmed Babeker Elhag;Hawkar Hashim Ibrahim;Shima Rashidi
    • Geomechanics and Engineering
    • /
    • v.34 no.1
    • /
    • pp.43-49
    • /
    • 2023
  • Knowledge of minimum horizontal stress (Shmin) is a significant step in determining full stress tensor. It provides crucial information for the production of sand, hydraulic fracturing, determination of safe mud weight window, reservoir production behavior, and wellbore stability. Calculating the Shmin using indirect methods has been proved to be awkward because a lot of data are required in all of these models. Also, direct techniques such as hydraulic fracturing are costly and time-consuming. To figure these problems out, this work aims to apply the long-short-term memory (LSTM) algorithm to Shmin time-series prediction. 13956 datasets obtained from an oil well logging operation were applied in the models. 80% of the data were used for training, and 20% of the data were used for testing. In order to achieve the maximum accuracy of the LSTM model, its hyper-parameters were optimized significantly. Through different statistical indices, the LSTM model's performance was compared with with other machine learning methods. Finally, the optimized LSTM model was recommended for Shmin prediction in the well logging operation.

Multi-Purpose Hybrid Recommendation System on Artificial Intelligence to Improve Telemarketing Performance

  • Hyung Su Kim;Sangwon Lee
    • Asia pacific journal of information systems
    • /
    • v.29 no.4
    • /
    • pp.752-770
    • /
    • 2019
  • The purpose of this study is to incorporate telemarketing processes to improve telemarketing performance. For this application, we have attempted to mix the model of machine learning to extract potential customers with personalisation techniques to derive recommended products from actual contact. Most of traditional recommendation systems were mainly in ways such as collaborative filtering, which predicts items with a high likelihood of future purchase, based on existing purchase transactions or preferences for products. But, under these systems, new users or items added to the system do not have sufficient information, and generally cause problems such as a cold start that can not obtain satisfactory recommendation items. Also, indiscriminate telemarketing attempts can backfire as they increase the dissatisfaction and fatigue of customers who do not want to be contacted. To this purpose, this study presented a multi-purpose hybrid recommendation algorithm to achieve two goals: to select customers with high possibility of contact, and to recommend products to selected customers. In addition, we used subscription data from telemarketing agency that handles insurance products to derive realistic applicability of the proposed recommendation system. Our proposed recommendation system would certainly solve the cold start and scarcity problem of existing recommendation algorithm by using contents information such as customer master information and telemarketing history. Also. the model could show excellent performance not only in terms of overall performance but also in terms of the recommendation success rate of the unpopular product.

Development of One-to-One Shortest Path Algorithm Based on Link Flow Speeds on Urban Networks (도시부 가로망에서의 링크 통행속도 기반 One-to-One 최단시간 경로탐색 알고리즘 개발)

  • Kim, Taehyeong;Kim, Taehyung;Park, Bum-Jin;Kim, Hyoungsoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.5
    • /
    • pp.38-45
    • /
    • 2012
  • Finding shortest paths on time dependent networks is an important task for scheduling and routing plan and real-time navigation system in ITS. In this research, one-to-one time dependent shortest path algorithms based on link flow speeds on urban networks are proposed. For this work, first we select three general shortest path algorithms such as Graph growth algorithm with two queues, Dijkstra's algorithm with approximate buckets and Dijkstra's algorithm with double buckets. These algorithms were developed to compute shortest distance paths from one node to all nodes in a network and have proven to be fast and efficient algorithms in real networks. These algorithms are extended to compute a time dependent shortest path from an origin node to a destination node in real urban networks. Three extended algorithms are implemented on a data set from real urban networks to test and evaluate three algorithms. A data set consists of 4 urban street networks for Anaheim, CA, Baltimore, MD, Chicago, IL, and Philadelphia, PA. Based on the computational results, among the three algorithms for TDSP, the extended Dijkstra's algorithm with double buckets is recommended to solve one-to-one time dependent shortest path for urban street networks.

Implementation of Multipoint Communication Service for Multimedia Conference System (멀티미디어 회의 시스템을 위한 다중점 통신 서비스의 구현)

  • Seong, Dong-Su;Hyeon, Dong-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.4
    • /
    • pp.955-962
    • /
    • 1997
  • For the implementation of a multimdia cinference applications in a various communication network,the fun-damental conference services are needed.MCS(Multipoint Sdrvices)is remommended for this purpose.In this paper,the related papers are analyzed for the implementation of MCS that is recommended in inter-national standard for a multimedia confernece.Based on this,the algorithm is proposed and implemented in unix machine and Windows/NT machine.

  • PDF

A Voting Method Selection Support System for GDSS (그룹의사결정지원시스템을 위한 투표기법 선택 지원시스템 개발에 관한 연구)

  • Kim, Seong-Hui;Lee, Jae-Gwang;Lee, Jin-U;Kim, Seon-Uk;Park, Heung-Guk
    • Asia pacific journal of information systems
    • /
    • v.6 no.2
    • /
    • pp.5-17
    • /
    • 1996
  • There are various cases that we vote for making a decision or combining ideas (i.e. human being's opinions) in group meetings. Group Decision Support System(GDSS) provides us with a number of voting methods for decision making or aggregation of the ideas. It is generally difficult to select a voting method appropriate for given a meeting situation, without any aid of experts or computers having a knowledge on voting. In this paper we propose a supporting system for selecting an appropriate voting method. Since the selected method is recommended to the facilitator of GDSS, a part of time and effort related with the voting would be reduced. The knowledge in the system is represented as rules that are inductively generated from examples of voting. We used UNiK-INDUCE with ID3 algorithm so as to learn, which is a tool of developing expert systems.

  • PDF

Small sample tests for two-way contingency tables (2원 분할표의 소표본 검증법)

  • 허명회
    • The Korean Journal of Applied Statistics
    • /
    • v.10 no.2
    • /
    • pp.339-352
    • /
    • 1997
  • Chi-square test based on large sample theory is inappropriate for testing the row homogeneity in two-way contingency table with several sparse cells. For that case, exact testing methods has been developed in the literature and implemented in StatXact(1991). However, considerable computing time is inevitable for moderate size tables. So, Monte Carlo approximation is recommended frequently. In this study, we propose a simple algorithm for generating two-way random tables with fixed row and column margins for small sample chi-square test. Also, we develop “Turkey-type” method for multiple between-row comparisons.

  • PDF

Comparison of multi-stage explicit methods for numerical computation of the unsteady Navier-Stokes equations (비정상 Navier-Stokes 방정식의 수치해석을 위한 다단계 외재법의 성능 비교)

  • Seo,Yong-Gwon
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.21 no.2
    • /
    • pp.202-212
    • /
    • 1997
  • In this study, performance of the multi-stage explicit methods for numerical computation of the unsteady Navier-Stokes equations is investigated. Three methods under consideration are 1 st-, 2 nd-, and 4 th-order Runge-Kutta (R-K) methods. Compared in this estimation is stability, accuracy, and CPU time of each method. The computational codes developed are applied to the two-dimensional flow in a square cavity driven by an oscillating lid. It turned out that at Reynolds number 400, the 1 st-order R-K method is the best, while at 3200 the 2 nd-order R-K is recommended. At higher Reynolds numbers, it is conjectured that the 4 th-order R-K method will be the best algorithm among three due to its highest stability.

A Study on the Improvement of Dynamic Characteristics of ABS Outlet Valve (ABS 출구 밸브의 동특성 향상에 관한 연구)

  • 김병우;송창섭;이용주
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.10 no.1
    • /
    • pp.133-142
    • /
    • 2002
  • To improve the hydraulic control performance of ABS, it is necessary to establish an efficient control algorithm. And also it is necessary to ova]Hate a hydraulic modulator with solenoid valve quantitatively. In this paper, FEM and permeance method are used to analyze dynamic characteristics of outlet valve. In return, mathmatical modeling of a hydraulic modulator and operating pressure is presented, and the model parameters of an outlet valve are moving plunger, spring constant and orifice diameter. This study shows the way to improve the dynamic characteristic of an ABS outlet valve heavily depending on operating pressure. It is recommended that operating pressure should be justified at the first step toward the design to get the optimal design of an outlet valve.

Multiobjective size and topolgy optimization of dome structures

  • Tugrul, Talaslioglu
    • Structural Engineering and Mechanics
    • /
    • v.43 no.6
    • /
    • pp.795-821
    • /
    • 2012
  • The size and topology of geometrically nonlinear dome structures are optimized thereby minimizing both its entire weight & joint (node) displacements and maximizing load-carrying capacity. Design constraints are implemented from provisions of American Petroleum Institute specification (API RP2A-LRFD). In accordance with the proposed design constraints, the member responses computed by use of arc-length technique as a nonlinear structural analysis method are checked at each load increment. Thus, a penalization process utilized for inclusion of unfeasible designations to genetic search is correspondingly neglected. In order to solve this complex design optimization problem with multiple objective functions, Non-dominated Sorting Genetic Algorithm II (NSGA II) approach is employed as a multi-objective optimization tool. Furthermore, the flexibility of proposed optimization is enhanced thereby integrating an automatic dome generating tool. Thus, it is possible to generate three distinct sphere-shaped dome configurations with varying topologies. It is demonstrated that the inclusion of brace (diagonal) members into the geometrical configuration of dome structure provides a weight-saving dome designation with higher load-carrying capacity. The proposed optimization approach is recommended for the design optimization of geometrically nonlinear dome structures.