• Title/Summary/Keyword: Performance based Learning

Search Result 4,682, Processing Time 0.029 seconds

Improving Classification Accuracy in Hierarchical Trees via Greedy Node Expansion

  • Byungjin Lim;Jong Wook Kim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.29 no.6
    • /
    • pp.113-120
    • /
    • 2024
  • With the advancement of information and communication technology, we can easily generate various forms of data in our daily lives. To efficiently manage such a large amount of data, systematic classification into categories is essential. For effective search and navigation, data is organized into a tree-like hierarchical structure known as a category tree, which is commonly seen in news websites and Wikipedia. As a result, various techniques have been proposed to classify large volumes of documents into the terminal nodes of category trees. However, document classification methods using category trees face a problem: as the height of the tree increases, the number of terminal nodes multiplies exponentially, which increases the probability of misclassification and ultimately leads to a reduction in classification accuracy. Therefore, in this paper, we propose a new node expansion-based classification algorithm that satisfies the classification accuracy required by the application, while enabling detailed categorization. The proposed method uses a greedy approach to prioritize the expansion of nodes with high classification accuracy, thereby maximizing the overall classification accuracy of the category tree. Experimental results on real data show that the proposed technique provides improved performance over naive methods.

Detection Model of Fruit Epidermal Defects Using YOLOv3: A Case of Peach (YOLOv3을 이용한 과일표피 불량검출 모델: 복숭아 사례)

  • Hee Jun Lee;Won Seok Lee;In Hyeok Choi;Choong Kwon Lee
    • Information Systems Review
    • /
    • v.22 no.1
    • /
    • pp.113-124
    • /
    • 2020
  • In the operation of farms, it is very important to evaluate the quality of harvested crops and to classify defective products. However, farmers have difficulty coping with the cost and time required for quality assessment due to insufficient capital and manpower. This study thus aims to detect defects by analyzing the epidermis of fruit using deep learning algorithm. We developed a model that can analyze the epidermis by applying YOLOv3 algorithm based on Region Convolutional Neural Network to video images of peach. A total of four classes were selected and trained. Through 97,600 epochs, a high performance detection model was obtained. The crop failure detection model proposed in this study can be used to automate the process of data collection, quality evaluation through analyzed data, and defect detection. In particular, we have developed an analytical model for peach, which is the most vulnerable to external wounds among crops, so it is expected to be applicable to other crops in farming.

Methodology for Variable Optimization in Injection Molding Process (사출 성형 공정에서의 변수 최적화 방법론)

  • Jung, Young Jin;Kang, Tae Ho;Park, Jeong In;Cho, Joong Yeon;Hong, Ji Soo;Kang, Sung Woo
    • Journal of Korean Society for Quality Management
    • /
    • v.52 no.1
    • /
    • pp.43-56
    • /
    • 2024
  • Purpose: The injection molding process, crucial for plastic shaping, encounters difficulties in sustaining product quality when replacing injection machines. Variations in machine types and outputs between different production lines or factories increase the risk of quality deterioration. In response, the study aims to develop a system that optimally adjusts conditions during the replacement of injection machines linked to molds. Methods: Utilizing a dataset of 12 injection process variables and 52 corresponding sensor variables, a predictive model is crafted using Decision Tree, Random Forest, and XGBoost. Model evaluation is conducted using an 80% training data and a 20% test data split. The dependent variable, classified into five characteristics based on temperature and pressure, guides the prediction model. Bayesian optimization, integrated into the selected model, determines optimal values for process variables during the replacement of injection machines. The iterative convergence of sensor prediction values to the optimum range is visually confirmed, aligning them with the target range. Experimental results validate the proposed approach. Results: Post-experiment analysis indicates the superiority of the XGBoost model across all five characteristics, achieving a combined high performance of 0.81 and a Mean Absolute Error (MAE) of 0.77. The study introduces a method for optimizing initial conditions in the injection process during machine replacement, utilizing Bayesian optimization. This streamlined approach reduces both time and costs, thereby enhancing process efficiency. Conclusion: This research contributes practical insights to the optimization literature, offering valuable guidance for industries seeking streamlined and cost-effective methods for machine replacement in injection molding.

Analysis of Factors Associated with Daytime Sleepiness in Korean Adolescents (대한민국 청소년의 주간 졸음증에 관련된 요인 분석)

  • Eun Jeong Jang;Jung Sun Kim;Kitai Kim;Hye Sun Gwak;Ji Min Han
    • Korean Journal of Clinical Pharmacy
    • /
    • v.34 no.1
    • /
    • pp.21-29
    • /
    • 2024
  • Background: Daytime sleepiness, a common phenomenon among adolescents focused on academics, has negative effects on aspects such as growth and overall learning. However, research on various drugs and diseases affecting daytime sleepiness is lacking in the reality. Therefore, this study aims to investigate the factors influencing daytime sleepiness in adolescents with daytime sleepiness. Methods: This study was conducted through a survey of 2,432 middle and high school students, aged 14 to 19. The questionnaire consisted of information on socio-demographic characteristics, overall health status, and sleep patterns. The Pediatric Daytime Sleepiness Scale (PDSS), translated into Korean, was used to assess daytime sleepiness. Daytime sleepiness was measured by calculating the total score for each item of the PDSS, and divided into two groups based on the cutoff value of 19, which was the upper quartile. Results: We analyzed a total of 1,770 students including 799 boys and 971 girls. Students with a PDSS score of 19 or higher made up 33.3% of boys and 66.7% of girls. In multivariate analyses, females, smoking, poor self-reported health level, sleep after 12 am, not feeling refreshed in the morning, headache, muscle pain, and scoliosis increased the risk of daytime sleepiness significantly. The AUROC of PDSS, including significant factors in multivariate analyses, was 0.751 (95% CI 0.725~0.776). Conclusions: Daytime sleepiness in adolescents affects growth, academic performance, and emotional stability. Therefore, it is important to manage medications, diseases, and other factors that affect daytime sleepiness on a social level.

Comparison of Data Reconstruction Methods for Missing Value Imputation (결측값 대체를 위한 데이터 재현 기법 비교)

  • Cheongho Kim;Kee-Hoon Kang
    • The Journal of the Convergence on Culture Technology
    • /
    • v.10 no.1
    • /
    • pp.603-608
    • /
    • 2024
  • Nonresponse and missing values are caused by sample dropouts and avoidance of answers to surveys. In this case, problems with the possibility of information loss and biased reasoning arise, and a replacement of missing values with appropriate values is required. In this paper, as an alternative to missing values imputation, we compare several replacement methods, which use mean, linear regression, random forest, K-nearest neighbor, autoencoder and denoising autoencoder based on deep learning. These methods of imputing missing values are explained, and each method is compared by using continuous simulation data and real data. The comparison results confirm that in most cases, the performance of the random forest imputation method and the denoising autoencoder imputation method are better than the others.

Seismic Data Processing Using BERT-Based Pretraining: Comparison of Shotgather Arrays (BERT 기반 사전학습을 이용한 탄성파 자료처리: 송신원 모음 배열 비교)

  • Youngjae Shin
    • Geophysics and Geophysical Exploration
    • /
    • v.27 no.3
    • /
    • pp.171-180
    • /
    • 2024
  • The processing of seismic data involves analyzing earthquake wave data to understand the internal structure and characteristics of the Earth, which requires high computational power. Recently, machine learning (ML) techniques have been introduced to address these challenges and have been utilized in various tasks such as noise reduction and velocity model construction. However, most studies have focused on specific seismic data processing tasks, limiting the full utilization of similar features and structures inherent in the datasets. In this study, we compared the efficacy of using receiver-wise time-series data ("receiver array") and synchronized receiver signals ("time array") from shotgathers for pretraining a Bidirectional Encoder Representations from Transformers (BERT) model. To this end, shotgather data generated from a synthetic model containing faults was used to perform noise reduction, velocity prediction, and fault detection tasks. In the task of random noise reduction, both the receiver and time arrays showed good performance. However, for tasks requiring the identification of spatial distributions, such as velocity estimation and fault detection, the results from the time array were superior.

Enhancing prediction of the moment-rotation behavior in flush end plate connections using Multi-Gene Genetic Programming (MGGP)

  • Amirmohammad Rabbani;Amir Reza Ghiami Azad;Hossein Rahami
    • Structural Engineering and Mechanics
    • /
    • v.91 no.6
    • /
    • pp.643-656
    • /
    • 2024
  • The prediction of the moment rotation behavior of semi-rigid connections has been the subject of extensive research. However, to improve the accuracy of these predictions, there is a growing interest in employing machine learning algorithms. This paper investigates the effectiveness of using Multi-gene genetic programming (MGGP) to predict the moment-rotation behavior of flush-end plate connections compared to that of artificial neural networks (ANN) and previous studies. It aims to automate the process of determining the most suitable equations to accurately describe the behavior of these types of connections. Experimental data was used to train ANN and MGGP. The performance of the models was assessed by comparing the values of coefficient of determination (R2), maximum absolute error (MAE), and root-mean-square error (RMSE). The results showed that MGGP produced more accurate, reliable, and general predictions compared to ANN and previous studies with an R2 exceeding 0.99, an RMSE of 6.97, and an MAE of 38.68, highlighting its advantages over other models. The use of MGGP can lead to better modeling and more precise predictions in structural design. Additionally, an experimentally-based regression analysis was conducted to obtain the rotational capacity of FECs. A new equation was proposed and compared to previous ones, showing significant improvement in accuracy with an R2 score of 0.738, an RMSE of 0.014, and an MAE of 0.024.

The development of four efficient optimal neural network methods in forecasting shallow foundation's bearing capacity

  • Hossein Moayedi;Binh Nguyen Le
    • Computers and Concrete
    • /
    • v.34 no.2
    • /
    • pp.151-168
    • /
    • 2024
  • This research aimed to appraise the effectiveness of four optimization approaches - cuckoo optimization algorithm (COA), multi-verse optimization (MVO), particle swarm optimization (PSO), and teaching-learning-based optimization (TLBO) - that were enhanced with an artificial neural network (ANN) in predicting the bearing capacity of shallow foundations located on cohesionless soils. The study utilized a database of 97 laboratory experiments, with 68 experiments for training data sets and 29 for testing data sets. The ANN algorithms were optimized by adjusting various variables, such as population size and number of neurons in each hidden layer, through trial-and-error techniques. Input parameters used for analysis included width, depth, geometry, unit weight, and angle of shearing resistance. After performing sensitivity analysis, it was determined that the optimized architecture for the ANN structure was 5×5×1. The study found that all four models demonstrated exceptional prediction performance: COA-MLP, MVO-MLP, PSO-MLP, and TLBO-MLP. It is worth noting that the MVO-MLP model exhibited superior accuracy in generating network outputs for predicting measured values compared to the other models. The training data sets showed R2 and RMSE values of (0.07184 and 0.9819), (0.04536 and 0.9928), (0.09194 and 0.9702), and (0.04714 and 0.9923) for COA-MLP, MVO-MLP, PSO-MLP, and TLBO-MLP methods respectively. Similarly, the testing data sets produced R2 and RMSE values of (0.08126 and 0.07218), (0.07218 and 0.9814), (0.10827 and 0.95764), and (0.09886 and 0.96481) for COA-MLP, MVO-MLP, PSO-MLP, and TLBO-MLP methods respectively.

Discrimination of dicentric chromosome from radiation exposure patient data using a pretrained deep learning model

  • Soon Woo Kwon;Won Il Jang;Mi-Sook Kim;Ki Moon Seong;Yang Hee Lee;Hyo Jin Yoon;Susan Yang;Younghyun Lee;Hyung Jin Shim
    • Nuclear Engineering and Technology
    • /
    • v.56 no.8
    • /
    • pp.3123-3128
    • /
    • 2024
  • The dicentric chromosome assay is a gold standard method to estimate radiation exposure by calculating the ratio of dicentric chromosomes existing in cells. The objective of this study was to propose an automatic dicentric chromosome discrimination method based on deep convolutional neural networks using radiation exposure patient data. From 45 patients with radiation exposure, conventional Giemsa-stained images of 116,258 normal and 2800 dicentric chromosomes were confirmed. ImageNet was used to pre-train VGG19, which was modified and fine-tuned. The proposed modified VGG19 demonstrated dicentric chromosome discrimination performance, with a true positive rate of 0.927, a true negative rate of 0.997, a positive predictive value of 0.882, a negative predictive value of 0.998, and an area under the receiver operating characteristic curve of 0.997.

Investigating Dynamic Mutation Process of Issues Using Unstructured Text Analysis (부도예측을 위한 KNN 앙상블 모형의 동시 최적화)

  • Min, Sung-Hwan
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.1
    • /
    • pp.139-157
    • /
    • 2016
  • Bankruptcy involves considerable costs, so it can have significant effects on a country's economy. Thus, bankruptcy prediction is an important issue. Over the past several decades, many researchers have addressed topics associated with bankruptcy prediction. Early research on bankruptcy prediction employed conventional statistical methods such as univariate analysis, discriminant analysis, multiple regression, and logistic regression. Later on, many studies began utilizing artificial intelligence techniques such as inductive learning, neural networks, and case-based reasoning. Currently, ensemble models are being utilized to enhance the accuracy of bankruptcy prediction. Ensemble classification involves combining multiple classifiers to obtain more accurate predictions than those obtained using individual models. Ensemble learning techniques are known to be very useful for improving the generalization ability of the classifier. Base classifiers in the ensemble must be as accurate and diverse as possible in order to enhance the generalization ability of an ensemble model. Commonly used methods for constructing ensemble classifiers include bagging, boosting, and random subspace. The random subspace method selects a random feature subset for each classifier from the original feature space to diversify the base classifiers of an ensemble. Each ensemble member is trained by a randomly chosen feature subspace from the original feature set, and predictions from each ensemble member are combined by an aggregation method. The k-nearest neighbors (KNN) classifier is robust with respect to variations in the dataset but is very sensitive to changes in the feature space. For this reason, KNN is a good classifier for the random subspace method. The KNN random subspace ensemble model has been shown to be very effective for improving an individual KNN model. The k parameter of KNN base classifiers and selected feature subsets for base classifiers play an important role in determining the performance of the KNN ensemble model. However, few studies have focused on optimizing the k parameter and feature subsets of base classifiers in the ensemble. This study proposed a new ensemble method that improves upon the performance KNN ensemble model by optimizing both k parameters and feature subsets of base classifiers. A genetic algorithm was used to optimize the KNN ensemble model and improve the prediction accuracy of the ensemble model. The proposed model was applied to a bankruptcy prediction problem by using a real dataset from Korean companies. The research data included 1800 externally non-audited firms that filed for bankruptcy (900 cases) or non-bankruptcy (900 cases). Initially, the dataset consisted of 134 financial ratios. Prior to the experiments, 75 financial ratios were selected based on an independent sample t-test of each financial ratio as an input variable and bankruptcy or non-bankruptcy as an output variable. Of these, 24 financial ratios were selected by using a logistic regression backward feature selection method. The complete dataset was separated into two parts: training and validation. The training dataset was further divided into two portions: one for the training model and the other to avoid overfitting. The prediction accuracy against this dataset was used to determine the fitness value in order to avoid overfitting. The validation dataset was used to evaluate the effectiveness of the final model. A 10-fold cross-validation was implemented to compare the performances of the proposed model and other models. To evaluate the effectiveness of the proposed model, the classification accuracy of the proposed model was compared with that of other models. The Q-statistic values and average classification accuracies of base classifiers were investigated. The experimental results showed that the proposed model outperformed other models, such as the single model and random subspace ensemble model.