• Title/Summary/Keyword: Machine knowledge

Search Result 646, Processing Time 0.025 seconds

Ensemble Deep Learning Model using Random Forest for Patient Shock Detection

  • Minsu Jeong;Namhwa Lee;Byuk Sung Ko;Inwhee Joe
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.4
    • /
    • pp.1080-1099
    • /
    • 2023
  • Digital healthcare combined with telemedicine services in the form of convergence with digital technology and AI is developing rapidly. Digital healthcare research is being conducted on many conditions including shock. However, the causes of shock are diverse, and the treatment is very complicated, requiring a high level of medical knowledge. In this paper, we propose a shock detection method based on the correlation between shock and data extracted from hemodynamic monitoring equipment. From the various parameters expressed by this equipment, four parameters closely related to patient shock were used as the input data for a machine learning model in order to detect the shock. Using the four parameters as input data, that is, feature values, a random forest-based ensemble machine learning model was constructed. The value of the mean arterial pressure was used as the correct answer value, the so called label value, to detect the patient's shock state. The performance was then compared with the decision tree and logistic regression model using a confusion matrix. The average accuracy of the random forest model was 92.80%, which shows superior performance compared to other models. We look forward to our work playing a role in helping medical staff by making recommendations for the diagnosis and treatment of complex and difficult cases of shock.

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.

Recent advances in few-shot learning for image domain: a survey (이미지 분석을 위한 퓨샷 학습의 최신 연구동향)

  • Ho-Sik Seok
    • Journal of IKEEE
    • /
    • v.27 no.4
    • /
    • pp.537-547
    • /
    • 2023
  • In many domains, lack of data inhibits adoption of advanced machine learning models. Recently, Few-Shot Learning (FSL) has been actively studied to tackle this problem. Utilizing prior knowledge obtained through observations on related domains, FSL achieved significant performance with only a few samples. In this paper, we present a survey on FSL in terms of data augmentation, embedding and metric learning, and meta-learning. In addition to interesting researches, we also introduce major benchmark datasets. FSL is widely adopted in various domains, but we focus on image analysis in this paper.

FAULT DIAGNOSIS OF ROLLING BEARINGS USING UNSUPERVISED DYNAMIC TIME WARPING-AIDED ARTIFICIAL IMMUNE SYSTEM

  • LUCAS VERONEZ GOULART FERREIRA;LAXMI RATHOUR;DEVIKA DABKE;FABIO ROBERTO CHAVARETTE;VISHNU NARAYAN MISHRA
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.6
    • /
    • pp.1257-1274
    • /
    • 2023
  • Rotating machines heavily rely on an intricate network of interconnected sub-components, with bearing failures accounting for a substantial proportion (40% to 90%) of all such failures. To address this issue, intelligent algorithms have been developed to evaluate vibrational signals and accurately detect faults, thereby reducing the reliance on expert knowledge and lowering maintenance costs. Within the field of machine learning, Artificial Immune Systems (AIS) have exhibited notable potential, with applications ranging from malware detection in computer systems to fault detection in bearings, which is the primary focus of this study. In pursuit of this objective, we propose a novel procedure for detecting novel instances of anomalies in varying operating conditions, utilizing only the signals derived from the healthy state of the analyzed machine. Our approach incorporates AIS augmented by Dynamic Time Warping (DTW). The experimental outcomes demonstrate that the AIS-DTW method yields a considerable improvement in anomaly detection rates (up to 53.83%) compared to the conventional AIS. In summary, our findings indicate that our method represents a significant advancement in enhancing the resilience of AIS-based novelty detection, thereby bolstering the reliability of rotating machines and reducing the need for expertise in bearing fault detection.

A Study on Detecting Fake Reviews Using Machine Learning: Focusing on User Behavior Analysis (머신러닝을 활용한 가짜리뷰 탐지 연구: 사용자 행동 분석을 중심으로)

  • Lee, Min Cheol;Yoon, Hyun Shik
    • Knowledge Management Research
    • /
    • v.21 no.3
    • /
    • pp.177-195
    • /
    • 2020
  • The social consciousness on fake reviews has triggered researchers to suggest ways to cope with them by analyzing contents of fake reviews or finding ways to discover them by means of structural characteristics of them. This research tried to collect data from blog posts in Naver and detect habitual patterns users use unconsciously by variables extracted from blogs and blog posts by a machine learning model and wanted to use the technique in predicting fake reviews. Data analysis showed that there was a very high relationship between the number of all the posts registered in the blog of the writer of the related writing and the date when it was registered. And, it was found that, as model to detect advertising reviews, Random Forest is the most suitable. If a review is predicted to be an advertising one by the model suggested in this research, it is very likely that it is fake review, and that it violates the guidelines on investigation into markings and advertising regarding recommendation and guarantee in the Law of Marking and Advertising. The fact that, instead of using analysis of morphemes in contents of writings, this research adopts behavior analysis of the writer, and, based on such an approach, collects characteristic data of blogs and blog posts not by manual works, but by automated system, and discerns whether a certain writing is advertising or not is expected to have positive effects on improving efficiency and effectiveness in detecting fake reviews.

Learning Opposite Concept for Incomplete Domain Theory (불완전한 영역이론을 위한 반대개념의 학습)

  • Tae, Gang-Su
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.8
    • /
    • pp.1010-1017
    • /
    • 1999
  • 불완전한 계획 영역 이론은 오류 영역(noisy domain)에서 하나의 상태에 상반된 연산자들이 적용되는 불일치성 문제를 야기할 수 있다. 이 문제를 해결하기 위해서 본 논문은 상태를 기술하기 위해 다치 논리를 도입하여 제어지식으로서의 부정적 선행조건을 학습하는 새로운 방법을 제안한다. 기계에는 알려지지 않은 이러한 제어지식이 인간에게는 반대개념으로 잠재적으로 사용되고 있다. 이러한 잠재된 개념을 학습하기 위해 본 논문은 반대 연산자들로 구성된 사이클을 영역이론으로부터 기계적으로 생성하고, 이 연산자들에 대한 실험을 통해 반대 리터럴(literal)들을 추출한다. 학습된 규칙은 불일치성을 방지하면서 동시에 중복된 선행조건을 제거하여 연산자를 단순화시킬 수 있다.Abstract An incomplete planning domain theory can cause an inconsistency problem in a noisy domain, allowing two opposite operators to be applied to a state. To solve the problem, we present a novel method to learn a negative precondition as control knowledge by introducing a three-valued logic for state description. However, even though the control knowledge is unknown to a machine, it is implicitly known as opposite concept to a human. To learn the implicit concept, we mechanically generate a cycle composed of opposite operators from a domain theory and extract opposite literals through experimenting the operators. A learned rule can simplify the operator by removing a redundant precondition while preventing inconsistency.

A Four-Layer Robust Storage in Cloud using Privacy Preserving Technique with Reliable Computational Intelligence in Fog-Edge

  • Nirmala, E.;Muthurajkumar, S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3870-3884
    • /
    • 2020
  • The proposed framework of Four Layer Robust Storage in Cloud (FLRSC) architecture involves host server, local host and edge devices in addition to Virtual Machine Monitoring (VMM). The goal is to protect the privacy of stored data at edge devices. The computational intelligence (CI) part of our algorithm distributes blocks of data to three different layers by partially encoded and forwarded for decoding to the next layer using hash and greed Solomon algorithms. VMM monitoring uses snapshot algorithm to detect intrusion. The proposed system is compared with Tiang Wang method to validate efficiency of data transfer with security. Hence, security is proven against the indexed efficiency. It is an important study to integrate communication between local host software and nearer edge devices through different channels by verifying snapshot using lamport mechanism to ensure integrity and security at software level thereby reducing the latency. It also provides thorough knowledge and understanding about data communication at software level with VMM. The performance evaluation and feasibility study of security in FLRSC against three-layered approach is proven over 232 blocks of data with 98% accuracy. Practical implications and contributions to the growing knowledge base are highlighted along with directions for further research.

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

Theory Refinements in Knowledge-based Artificial Neural Networks by Adding Hidden Nodes (지식기반신경망에서 은닉노드삽입을 이용한 영역이론정련화)

  • Sim, Dong-Hui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1773-1780
    • /
    • 1996
  • KBANN (knowledge-based artificial neural network) combining the symbolic approach and the numerical approach has been shown to be more effective than other machine learning models. However KBANN doesn't have the theory refinement ability because the topology of network can't be altered dynamically. Although TopGen was proposed to extend the ability of KABNN in this respect, it also had some defects due to the link-ing of hidden nodes to input nodes and the use of beam search. The algorithm which could solve this TopGen's defects, by adding the hidden nodes linked to next layer nodes and using hill-climbing search with backtracking, is designed.

  • PDF

An Approximation Method in Bayesian Prediction of Nuclear Power Plant Accidents (원자력 발전소 사고의 근사적인 베이지안 예측기법)

  • Yang, Hee-Joong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.16 no.2
    • /
    • pp.135-147
    • /
    • 1990
  • A nuclear power plant can be viewed as a large complex man-machine system where high system reliability is obtained by ensuring that sub-systems are designed to operate at a very high level of performance. The chance of severe accident involving at least partial core-melt is very low but once it happens the consequence is very catastrophic. The prediction of risk in low probability, high-risk incidents must be examined in the contest of general engineering knowledge and operational experience. Engineering knowledge forms part of the prior information that must be quantified and then updated by statistical evidence gathered from operational experience. Recently, Bayesian procedures have been used to estimate rate of accident and to predict future risks. The Bayesian procedure has advantages in that it efficiently incorporates experts opinions and, if properly applied, it adaptively updates the model parameters such as the rate or probability of accidents. But at the same time it has the disadvantages of computational complexity. The predictive distribution for the time to next incident can not always be expected to end up with a nice closed form even with conjugate priors. Thus we often encounter a numerical integration problem with high dimensions to obtain a predictive distribution, which is practically unsolvable for a model that involves many parameters. In order to circumvent this difficulty, we propose a method of approximation that essentially breaks down a problem involving many integrations into several repetitive steps so that each step involves only a small number of integrations.

  • PDF