• Title/Summary/Keyword: NN Model

Search Result 280, Processing Time 0.028 seconds

Estimating the compressive strength of HPFRC containing metallic fibers using statistical methods and ANNs

  • Perumal, Ramadoss;Prabakaran, V.
    • Advances in concrete construction
    • /
    • v.10 no.6
    • /
    • pp.479-488
    • /
    • 2020
  • The experimental and numerical works were carried out on high performance fiber reinforced concrete (HPFRC) with w/cm ratios ranging from 0.25 to 0.40, fiber volume fraction (Vf)=0-1.5% and 10% silica fume replacement. Improvements in compressive and flexural strengths obtained for HPFRC are moderate and significant, respectively, Empirical equations developed for the compressive strength and flexural strength of HPFRC as a function of fiber volume fraction. A relation between flexural strength and compressive strength of HPFRC with R=0.78 was developed. Due to the complex mix proportions and non-linear relationship between the mix proportions and properties, models with reliable predictive capabilities are not developed and also research on HPFRC was empirical. In this paper due to the inadequacy of present method, a back propagation-neural network (BP-NN) was employed to estimate the 28-day compressive strength of HPFRC mixes. BP-NN model was built to implement the highly non-linear relationship between the mix proportions and their properties. This paper describes the data sets collected, training of ANNs and comparison of the experimental results obtained for various mixtures. On statistical analyses of collected data, a multiple linear regression (MLR) model with R2=0.78 was developed for the prediction of compressive strength of HPFRC mixes, and average absolute error (AAE) obtained is 6.5%. On validation of the data sets by NNs, the error range was within 2% of the actual values. ANN model has given the significant degree of accuracy and reliability compared to the MLR model. ANN approach can be effectively used to estimate the 28-day compressive strength of fibrous concrete mixes and is practical.

A Benchmark of AI Application based on Open Source for Data Mining Environmental Variables in Smart Farm (스마트 시설환경 환경변수 분석을 위한 Open source 기반 인공지능 활용법 분석)

  • Min, Jae-Ki;Lee, DongHoon
    • Proceedings of the Korean Society for Agricultural Machinery Conference
    • /
    • 2017.04a
    • /
    • pp.159-159
    • /
    • 2017
  • 스마트 시설환경은 대표적으로 원예, 축산 분야 등 여러 형태의 농업현장에 정보 통신 및 데이터 분석 기술을 도입하고 있는 시설화된 생산 환경이라 할 수 있다. 근래에 하드웨어적으로 급증한 스마트 시설환경에서 생산되는 방대한 생육/환경 데이터를 올바르고 적합하게 사용하기 위해서는 일반 산업 현장과는 차별화 된 분석기법이 요구된다고 할 수 있다. 소프트웨어 공학 분야에서 연구된 빅데이터 처리 기술을 기계적으로 농업 분야의 빅데이터에 적용하기에는 한계가 있을 수 있다. 시설환경 내/외부의 다양한 환경 변수는 시계열 데이터의 난해성, 비가역성, 불특정성, 비정형 패턴 등에 기인하여 예측 모델 연구가 매우 난해한 대상이기 때문이라 할 수 있다. 본 연구에서는 근래에 관심이 급증하고 있는 인공신경망 연구 소프트웨어인 Tensorflow (www.tensorflow.org)와 대표적인 Open source인 OpenNN (www.openn.net)을 스마트 시설환경 환경변수 상호간 상관성 분석에 응용하였다. 해당 소프트웨어 라이브러리의 운영환경을 살펴보면 Tensorflow 는 Linux(Ubuntu 16.04.4), Max OS X(EL capitan 10.11), Windows (x86 compatible)에서 활용가능하고, OpenNN은 별도의 운영환경에 대한 바이너리를 제공하지 않고 소스코드 전체를 제공하므로, 해당 운영환경에서 바이너리 컴파일 후 활용이 가능하다. 소프트웨어 개발 언어의 경우 Tensorflow는 python이 기본 언어이며 python(v2.7 or v3.N) 가상 환경 내에서 개발이 수행이 된다. 주의 깊게 살펴볼 부분은 이러한 개발 환경의 제약으로 인하여 Tensorflow의 주요한 장점 중에 하나인 고속 연산 기능 수행이 일부 운영 환경에 국한이 되어 제공이 된다는 점이다. GPU(Graphics Processing Unit)의 제공하는 하드웨어 가속기능은 Linux 운영체제에서 활용이 가능하다. 가상 개발 환경에 운영되는 한계로 인하여 실시간 정보 처리에는 한계가 따르므로 이에 대한 고려가 필요하다. 한편 근래(2017.03)에 공개된 Tensorflow API r1.0의 경우 python, C++, Java언어와 함께 Go라는 언어를 새로 지원하여 개발자의 활용 범위를 매우 높였다. OpenNN의 경우 C++ 언어를 기본으로 제공하며 C++ 컴파일러를 지원하는 임의의 개발 환경에서 모두 활용이 가능하다. 특징은 클러스터링 플랫폼과 연동을 통해 하드웨어 가속 기능의 부재를 일부 극복했다는 점이다. 상기 두 가지 패키지를 이용하여 2016년 2월부터 5월 까지 충북 음성군 소재 딸기 온실 내부에서 취득한 온도, 습도, 조도, CO2에 대하여 Large-scale linear model을 실험적(시간단위, 일단위, 주단위 분할)으로 적용하고, 인접한 세그먼트의 환경변수 예측 모델링을 수행하였다. 동일한 조건의 학습을 수행함에 있어, Tensorflow가 개발 소요 시간과 학습 실행 속도 측면에서 매우 우세하였다. OpenNN을 이용하여 대등한 성능을 보이기 위해선 병렬 클러스터링 기술을 활용해야 할 것이다. 오프라인 일괄(Offline batch)처리 방식의 한계가 있는 인공신경망 모델링 기법과 현장 보급이 불가능한 고성능 하드웨어 연산 장치에 대한 대안 마련을 위한 연구가 필요하다.

  • PDF

Downscaling Technique of Monthly GCM Using Daily Precipitation Generator (일 강수발생모형을 이용한 월 단위 GCM의 축소기법에 관한 연구)

  • Kyoung, Min Soo;Lee, Jung Ki;Kim, Hung Soo
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.29 no.5B
    • /
    • pp.441-452
    • /
    • 2009
  • This paper describes the evaluation technique for climate change effect on daily precipitation frequency using daily precipitation generator that can use outputs of the climate model offered by IPCC DDC. Seoul station of KMA was selected as a study site. This study developed daily precipitation generation model based on two-state markov chain model which have transition probability, scale parameter, and shape parameter of Gamma-2 distribution. Each parameters were estimated from regression analysis between mentioned parameters and monthly total precipitation. Then the regression equations were applied for computing 4 parameters equal to monthly total precipitation downscaled by K-NN to generate daily precipitation considering climate change. A2 scenario of the BCM2 model was projected based on 20c3m(20th Century climate) scenario and difference of daily rainfall frequency was added to the observed rainfall frequency. Gumbel distribution function was used as a probability density function and parameters were estimated using probability weighted moments method for frequency analysis. As a result, there is a small decrease in 2020s and rainfall frequencies of 2050s, 2080s are little bit increased.

Enhancing Classification Performance of Temporal Keyword Data by Using Moving Average-based Dynamic Time Warping Method (이동 평균 기반 동적 시간 와핑 기법을 이용한 시계열 키워드 데이터의 분류 성능 개선 방안)

  • Jeong, Do-Heon
    • Journal of the Korean Society for information Management
    • /
    • v.36 no.4
    • /
    • pp.83-105
    • /
    • 2019
  • This study aims to suggest an effective method for the automatic classification of keywords with similar patterns by calculating pattern similarity of temporal data. For this, large scale news on the Web were collected and time series data composed of 120 time segments were built. To make training data set for the performance test of the proposed model, 440 representative keywords were manually classified according to 8 types of trend. This study introduces a Dynamic Time Warping(DTW) method which have been commonly used in the field of time series analytics, and proposes an application model, MA-DTW based on a Moving Average(MA) method which gives a good explanation on a tendency of trend curve. As a result of the automatic classification by a k-Nearest Neighbor(kNN) algorithm, Euclidean Distance(ED) and DTW showed 48.2% and 66.6% of maximum micro-averaged F1 score respectively, whereas the proposed model represented 74.3% of the best micro-averaged F1 score. In all respect of the comprehensive experiments, the suggested model outperformed the methods of ED and DTW.

Call Admission Control in ATM by Neural Networks and Fuzzy Pattern Estimator (신경망과 퍼지 패턴 추정기를 이용한 ATM의 호 수락 제어)

  • Lee, Jin-Lee
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.8
    • /
    • pp.2188-2195
    • /
    • 1999
  • This paper proposes a new call admission control scheme utilizing an inverse fuzzy vector quantizer(IFVQ) and neuralnet, which combines benefits of IFVQ and flexibilities of FCM(Fuzzy-C-Means) arithmetics, to decide whether a requested call not to be trained in learning phase to be connected or not. The system generates the estimated traffic pattern for the cell stream of a new call, using feasible/infeasible patterns in codebook, fuzzy membership values that represent the degree to which each pattern of codebook matches input pattern, and FCM arithmetics. The input to the NN is the vector consisted of traffic parameters which are the means and variances of the number of cells arriving in decision as to whether to accept or reject a new call depends on whether the NN is used for decision threshold(+0.5). This method is a new technique for call admission control using the membership values as traffic parameter which declared to CAC at the call set up stage, and this is valid for a very general traffic model in which the calls of a stream can belong to an unlimited number of traffic classes. Through the simulations, it is founded the performance of the suggested method outperforms compared to the conventional NN method.

  • PDF

Development of Autonomous Algorithm Using an Online Feedback-Error Learning Based Neural Network for Nonholonomic Mobile Robots (온라인 피드백 에러 학습을 이용한 이동 로봇의 자율주행 알고리즘 개발)

  • Lee, Hyun-Dong;Myung, Byung-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.5
    • /
    • pp.602-608
    • /
    • 2011
  • In this study, a method of designing a neurointerface using neural network (NN) is proposed for controlling nonholonomic mobile robots. According to the concept of virtual master-slave robots, in particular, a partially stable inverse dynamic model of the master robot is acquired online through the NN by applying a feedback-error learning method, in which the feedback controller is assumed to be based on a PD compensator for such a nonholonomic robot. The NN for the online feedback-error learning can composed that the input layer consists of six units for the inputs $x_i$, i=1~6, the hidden layer consists of two hidden units for hidden outputs $o_j$, j=1~2, and the output layer consists of two units for the outputs ${\tau}_k$, k=1~2. A tracking control problem is demonstrated by some simulations for a nonholonomic mobile robot with two-independent driving wheels. The initial q value was set to [0, 5, ${\pi}$].

Machine Learning Model for Predicting the Residual Useful Lifetime of the CNC Milling Insert (공작기계의 절삭용 인서트의 잔여 유효 수명 예측 모형)

  • Won-Gun Choi;Heungseob Kim;Bong Jin Ko
    • Journal of Advanced Navigation Technology
    • /
    • v.27 no.1
    • /
    • pp.111-118
    • /
    • 2023
  • For the implementation of a smart factory, it is necessary to collect data by connecting various sensors and devices in the manufacturing environment and to diagnose or predict failures in production facilities through data analysis. In this paper, to predict the residual useful lifetime of milling insert used for machining products in CNC machine, weight k-NN algorithm, Decision Tree, SVR, XGBoost, Random forest, 1D-CNN, and frequency spectrum based on vibration signal are investigated. As the results of the paper, the frequency spectrum does not provide a reliable criterion for an accurate prediction of the residual useful lifetime of an insert. And the weighted k-nearest neighbor algorithm performed best with an MAE of 0.0013, MSE of 0.004, and RMSE of 0.0192. This is an error of 0.001 seconds of the remaining useful lifetime of the insert predicted by the weighted-nearest neighbor algorithm, and it is considered to be a level that can be applied to actual industrial sites.

The Development of Hybrid Model and Empirical Study for the Several Inductive Approaches (여러 가지 Inductive 방법에 대한 통합모델 개발과 그 실증적 유효성에 대한 연구)

  • 김광용
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.23 no.3
    • /
    • pp.185-207
    • /
    • 1998
  • This research investigates computer generated hybrid second-order model of two numerically based approaches to risk classification : discriminant analysis and neural networks. The hybrid second-order models are derived by rule induction using the ID3 and tested in the several different kinds of data. This new hybrid approach is designed to combine the high prediction accuracy and robustness of DA or NN with perspicuity of ID3. The hybrid model also eliminates the problem of contradictory inputs of ID3. After doing empirical test for the validity of hybrid model using small and medium companies' bankrupt data, hybrid model shows high perspicuity, high prediction accuracy for bankrupt, and simplicity for rules. The hybrid model also shows high performance regardless the type of data such as numeric data, non-numeric data, and combined data.

  • PDF

Hybrid Learning Architectures for Advanced Data Mining:An Application to Binary Classification for Fraud Management (개선된 데이터마이닝을 위한 혼합 학습구조의 제시)

  • Kim, Steven H.;Shin, Sung-Woo
    • Journal of Information Technology Application
    • /
    • v.1
    • /
    • pp.173-211
    • /
    • 1999
  • The task of classification permeates all walks of life, from business and economics to science and public policy. In this context, nonlinear techniques from artificial intelligence have often proven to be more effective than the methods of classical statistics. The objective of knowledge discovery and data mining is to support decision making through the effective use of information. The automated approach to knowledge discovery is especially useful when dealing with large data sets or complex relationships. For many applications, automated software may find subtle patterns which escape the notice of manual analysis, or whose complexity exceeds the cognitive capabilities of humans. This paper explores the utility of a collaborative learning approach involving integrated models in the preprocessing and postprocessing stages. For instance, a genetic algorithm effects feature-weight optimization in a preprocessing module. Moreover, an inductive tree, artificial neural network (ANN), and k-nearest neighbor (kNN) techniques serve as postprocessing modules. More specifically, the postprocessors act as second0order classifiers which determine the best first-order classifier on a case-by-case basis. In addition to the second-order models, a voting scheme is investigated as a simple, but efficient, postprocessing model. The first-order models consist of statistical and machine learning models such as logistic regression (logit), multivariate discriminant analysis (MDA), ANN, and kNN. The genetic algorithm, inductive decision tree, and voting scheme act as kernel modules for collaborative learning. These ideas are explored against the background of a practical application relating to financial fraud management which exemplifies a binary classification problem.

  • PDF

Spectral Clustering with Sparse Graph Construction Based on Markov Random Walk

  • Cao, Jiangzhong;Chen, Pei;Ling, Bingo Wing-Kuen;Yang, Zhijing;Dai, Qingyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.7
    • /
    • pp.2568-2584
    • /
    • 2015
  • Spectral clustering has become one of the most popular clustering approaches in recent years. Similarity graph constructed on the data is one of the key factors that influence the performance of spectral clustering. However, the similarity graphs constructed by existing methods usually contain some unreliable edges. To construct reliable similarity graph for spectral clustering, an efficient method based on Markov random walk (MRW) is proposed in this paper. In the proposed method, theMRW model is defined on the raw k-NN graph and the neighbors of each sample are determined by the probability of the MRW. Since the high order transition probabilities carry complex relationships among data, the neighbors in the graph determined by our proposed method are more reliable than those of the existing methods. Experiments are performed on the synthetic and real-world datasets for performance evaluation and comparison. The results show that the graph obtained by our proposed method reflects the structure of the data better than those of the state-of-the-art methods and can effectively improve the performance of spectral clustering.