• Title/Summary/Keyword: Prediction Algorithms

Search Result 1,014, Processing Time 0.033 seconds

Prediction of Water Usage in Pig Farm based on Machine Learning (기계학습을 이용한 돈사 급수량 예측방안 개발)

  • Lee, Woongsup;Ryu, Jongyeol;Ban, Tae-Won;Kim, Seong Hwan;Choi, Heechul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.8
    • /
    • pp.1560-1566
    • /
    • 2017
  • Recently, accumulation of data on pig farm is enabled through the wide spread of smart pig farm equipped with Internet-of-Things based sensors, and various machine learning algorithms are applied on the data in order to improve the productivity of pig farm. Herein, multiple machine learning schemes are used to predict the water usage in pig farm which is known to be one of the most important element in pig farm management. Especially, regression algorithms, which are linear regression, regression tree and AdaBoost regression, and classification algorithms which are logistic classification, decision tree and support vector machine, are applied to derive a prediction scheme which forecast the water usage based on the temperature and humidity of pig farm. Through performance evaluation, we find that the water usage can be predicted with high accuracy. The proposed scheme can be used to detect the malfunction of water system which prevents the death of pigs and reduces the loss of pig farm.

A Study on Fuzzy Searching Algorithm and Conditional-GAN for Crime Prediction System (범죄예측시스템에 대한 퍼지 탐색 알고리즘과 GAN 상태에 관한 연구)

  • Afonso, Carmelita;Yun, Han-Kyung
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.2
    • /
    • pp.149-160
    • /
    • 2021
  • In this study, artificial intelligence-based algorithms were proposed, which included a fuzzy search for matching suspects between current and historical crimes in order to obtain related cases in criminal history, as well as conditional generative adversarial networks for crime prediction system (CPS) using Timor-Leste as a case study. By comparing the data from the criminal records, the built algorithms transform witness descriptions in the form of sketches into realistic face images. The proposed algorithms and CPS's findings confirmed that they are useful for rapidly reducing both the time and successful duties of police officers in dealing with crimes. Since it is difficult to maintain social safety nets with inadequate human resources and budgets, the proposed implemented system would significantly assist in improving the criminal investigation process in Timor-Leste.

Fast Motion Estimation Algorithm using Filters of Multiple Thresholds (다중 문턱치 필터를 이용한 고속 움직임 예측 알고리즘)

  • Kim, Jong-Nam
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.19 no.4
    • /
    • pp.199-205
    • /
    • 2018
  • So many fast motion estimation algorithms for prediction quality and computational reduction have been published due to tremendous computations of full search algorithm. In the paper, we suggest an algorithm that reduces computation effectively, while keeping prediction quality as almost same as that of the full search. The proposed algorithm based on multiple threshold filter calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, removes impossible candidates, and calculates optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain the better performance of calculation speed by reducing unnecessary computations. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.

A Methodology for Bankruptcy Prediction in Imbalanced Datasets using eXplainable AI (데이터 불균형을 고려한 설명 가능한 인공지능 기반 기업부도예측 방법론 연구)

  • Heo, Sun-Woo;Baek, Dong Hyun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.45 no.2
    • /
    • pp.65-76
    • /
    • 2022
  • Recently, not only traditional statistical techniques but also machine learning algorithms have been used to make more accurate bankruptcy predictions. But the insolvency rate of companies dealing with financial institutions is very low, resulting in a data imbalance problem. In particular, since data imbalance negatively affects the performance of artificial intelligence models, it is necessary to first perform the data imbalance process. In additional, as artificial intelligence algorithms are advanced for precise decision-making, regulatory pressure related to securing transparency of Artificial Intelligence models is gradually increasing, such as mandating the installation of explanation functions for Artificial Intelligence models. Therefore, this study aims to present guidelines for eXplainable Artificial Intelligence-based corporate bankruptcy prediction methodology applying SMOTE techniques and LIME algorithms to solve a data imbalance problem and model transparency problem in predicting corporate bankruptcy. The implications of this study are as follows. First, it was confirmed that SMOTE can effectively solve the data imbalance issue, a problem that can be easily overlooked in predicting corporate bankruptcy. Second, through the LIME algorithm, the basis for predicting bankruptcy of the machine learning model was visualized, and derive improvement priorities of financial variables that increase the possibility of bankruptcy of companies. Third, the scope of application of the algorithm in future research was expanded by confirming the possibility of using SMOTE and LIME through case application.

EDNN based prediction of strength and durability properties of HPC using fibres & copper slag

  • Gupta, Mohit;Raj, Ritu;Sahu, Anil Kumar
    • Advances in concrete construction
    • /
    • v.14 no.3
    • /
    • pp.185-194
    • /
    • 2022
  • For producing cement and concrete, the construction field has been encouraged by the usage of industrial soil waste (or) secondary materials since it decreases the utilization of natural resources. Simultaneously, for ensuring the quality, the analyses of the strength along with durability properties of that sort of cement and concrete are required. The prediction of strength along with other properties of High-Performance Concrete (HPC) by optimization and machine learning algorithms are focused by already available research methods. However, an error and accuracy issue are possessed. Therefore, the Enhanced Deep Neural Network (EDNN) based strength along with durability prediction of HPC was utilized by this research method. Initially, the data is gathered in the proposed work. Then, the data's pre-processing is done by the elimination of missing data along with normalization. Next, from the pre-processed data, the features are extracted. Hence, the data input to the EDNN algorithm which predicts the strength along with durability properties of the specific mixing input designs. Using the Switched Multi-Objective Jellyfish Optimization (SMOJO) algorithm, the weight value is initialized in the EDNN. The Gaussian radial function is utilized as the activation function. The proposed EDNN's performance is examined with the already available algorithms in the experimental analysis. Based on the RMSE, MAE, MAPE, and R2 metrics, the performance of the proposed EDNN is compared to the existing DNN, CNN, ANN, and SVM methods. Further, according to the metrices, the proposed EDNN performs better. Moreover, the effectiveness of proposed EDNN is examined based on the accuracy, precision, recall, and F-Measure metrics. With the already-existing algorithms i.e., JO, GWO, PSO, and GA, the fitness for the proposed SMOJO algorithm is also examined. The proposed SMOJO algorithm achieves a higher fitness value than the already available algorithm.

Implementation of Face Recognition Pipeline Model using Caffe (Caffe를 이용한 얼굴 인식 파이프라인 모델 구현)

  • Park, Jin-Hwan;Kim, Chang-Bok
    • Journal of Advanced Navigation Technology
    • /
    • v.24 no.5
    • /
    • pp.430-437
    • /
    • 2020
  • The proposed model implements a model that improves the face prediction rate and recognition rate through learning with an artificial neural network using face detection, landmark and face recognition algorithms. After landmarking in the face images of a specific person, the proposed model use the previously learned Caffe model to extract face detection and embedding vector 128D. The learning is learned by building machine learning algorithms such as support vector machine (SVM) and deep neural network (DNN). Face recognition is tested with a face image different from the learned figure using the learned model. As a result of the experiment, the result of learning with DNN rather than SVM showed better prediction rate and recognition rate. However, when the hidden layer of DNN is increased, the prediction rate increases but the recognition rate decreases. This is judged as overfitting caused by a small number of objects to be recognized. As a result of learning by adding a clear face image to the proposed model, it is confirmed that the result of high prediction rate and recognition rate can be obtained. This research will be able to obtain better recognition and prediction rates through effective deep learning establishment by utilizing more face image data.

A Prediction Method using WRC(Weighted Rate Control Algorithm) in DTN (DTN에서 노드의 속성 정보 변화율과 가중치를 이용한 이동 예측 기법)

  • Jeon, Il-Kyu;Oh, Young-jun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.113-115
    • /
    • 2015
  • In this paper, we proposed an algorithm based on movement prediction using rate of change of the attribute information of nodes what is called WRC(Weighted Rate Control) in delay tolerant networks(DTNs). Existing DTN routing algorithms based on movement prediction communicate by selecting relay nodes increasing connectivity with destination node. Thus, because the mobile nodes are in flux, the prediction algorithms that do not reflect the newest attribute information of node decrease reliability. In this paper, proposed algorithm approximate speed and direction of attribute information of node and analysis rate of change of attribute information of node. Then, it predict movement path of node using proposed weight. As the result, proposed algorithm show that network overhead and transmission delay time decreased by predicting movement path of node.

  • PDF

Classification Model of Types of Crime based on Random-Forest Algorithms and Monitoring Interface Design Factors for Real-time Crime Prediction (실시간 범죄 예측을 위한 랜덤포레스트 알고리즘 기반의 범죄 유형 분류모델 및 모니터링 인터페이스 디자인 요소 제안)

  • Park, Joonyoung;Chae, Myungsu;Jung, Sungkwan
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.9
    • /
    • pp.455-460
    • /
    • 2016
  • Recently, with more severe types felonies such as robbery and sexual violence, the importance of crime prediction and prevention is emphasized. For accurate and prompt crime prediction and prevention, both a classification model of crime with high accuracy based on past criminal records and well-designed system interface are required. However previous studies on the analysis of crime factors have limitations in terms of accuracy due to the difficulty of data preprocessing. In addition, existing crime monitoring systems merely offer a vast amount of crime analysis results, thereby they fail to provide users with functions for more effective monitoring. In this paper, we propose a classification model for types of crime based on random-forest algorithms and system design factors for real-time crime prediction. From our experiments, we proved that our proposed classification model is superior to others that only use criminal records in terms of accuracy. Through the analysis of existing crime monitoring systems, we also designed and developed a system for real-time crime monitoring.

Prediction Technique of Energy Consumption based on Reinforcement Learning in Microgrids (마이크로그리드에서 강화학습 기반 에너지 사용량 예측 기법)

  • Sun, Young-Ghyu;Lee, Jiyoung;Kim, Soo-Hyun;Kim, Soohwan;Lee, Heung-Jae;Kim, Jin-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.3
    • /
    • pp.175-181
    • /
    • 2021
  • This paper analyzes the artificial intelligence-based approach for short-term energy consumption prediction. In this paper, we employ the reinforcement learning algorithms to improve the limitation of the supervised learning algorithms which usually utilize to the short-term energy consumption prediction technologies. The supervised learning algorithm-based approaches have high complexity because the approaches require contextual information as well as energy consumption data for sufficient performance. We propose a deep reinforcement learning algorithm based on multi-agent to predict energy consumption only with energy consumption data for improving the complexity of data and learning models. The proposed scheme is simulated using public energy consumption data and confirmed the performance. The proposed scheme can predict a similar value to the actual value except for the outlier data.

Interference-Prediction based Online Routing Aglorithm for MPLS Traffic Engineering (MPLS 트래픽 엔지니어링을 위한 간섭 예측 기반의 online 라우팅 알고리듬)

  • Lee, Dong-Hoon;Lee, Sung-Chang;Ye, Byung-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.9-16
    • /
    • 2005
  • A new online routing algerian is proposed in this paper, which use the interference-prediction to solve the network congestion originated from extension of Internet scope and increasing amount of traffic. The end-to-end QoS has to be guaranteed in order to satisfy service level agreements (SLAs) in the integrated networks of next generation. For this purpose, bandwidth is allocated dynamically and effectively, moreover the path selection algorithm is required while considering the network performance. The proposed algorithm predicts the level of how much the amount of current demand interferes the future potential traffic, and then minimizes it. The proposed algorithm considers the bandwidth on demand, link state, and the information about ingress-egress pairs to maximize the network performance and to prevent the waste of the limited resources. In addition, the interference-prediction supports the bandwidth guarantee in dynamic network to accept more requests. In the result, the proposed algorithm performs the effective admission control and QoS routing. In this paper, we analyze the required conditions of routing algorithms, the aspect of recent research, and the representative algorithms to propose the optimized path selection algorithm adequate to Internet franc engineering. Based on these results, we analyze the problems of existing algorithms and propose our algorithm. The simulation shows improved performance by comparing with other algorithms and analyzing them.