• Title/Summary/Keyword: Approaches to Learning

Search Result 1,006, Processing Time 0.03 seconds

Study on predictive model and mechanism analysis for martensite transformation temperatures through explainable artificial intelligence (설명가능한 인공지능을 통한 마르텐사이트 변태 온도 예측 모델 및 거동 분석 연구)

  • Junhyub Jeon;Seung Bae Son;Jae-Gil Jung;Seok-Jae Lee
    • Journal of the Korean Society for Heat Treatment
    • /
    • v.37 no.3
    • /
    • pp.103-113
    • /
    • 2024
  • Martensite volume fraction significantly affects the mechanical properties of alloy steels. Martensite start temperature (Ms), transformation temperature for martensite 50 vol.% (M50), and transformation temperature for martensite 90 vol.% (M90) are important transformation temperatures to control the martensite phase fraction. Several researchers proposed empirical equations and machine learning models to predict the Ms temperature. These numerical approaches can easily predict the Ms temperature without additional experiment and cost. However, to control martensite phase fraction more precisely, we need to reduce prediction error of the Ms model and propose prediction models for other martensite transformation temperatures (M50, M90). In the present study, machine learning model was applied to suggest the predictive model for the Ms, M50, M90 temperatures. To explain prediction mechanisms and suggest feature importance on martensite transformation temperature of machine learning models, the explainable artificial intelligence (XAI) is employed. Random forest regression (RFR) showed the best performance for predicting the Ms, M50, M90 temperatures using different machine learning models. The feature importance was proposed and the prediction mechanisms were discussed by XAI.

Adaptive Learning Path Recommendation based on Graph Theory and an Improved Immune Algorithm

  • BIAN, Cun-Ling;WANG, De-Liang;LIU, Shi-Yu;LU, Wei-Gang;DONG, Jun-Yu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2277-2298
    • /
    • 2019
  • Adaptive learning in e-learning has garnered researchers' interest. In it, learning resources could be recommended automatically to achieve a personalized learning experience. There are various ways to realize it. One of the realistic ways is adaptive learning path recommendation, in which learning resources are provided according to learners' requirements. This paper summarizes existing works and proposes an innovative approach. Firstly, a learner-centred concept map is created using graph theory based on the features of the learners and concepts. Then, the approach generates a linear concept sequence from the concept map using the proposed traversal algorithm. Finally, Learning Objects (LOs), which are the smallest concrete units that make up a learning path, are organized based on the concept sequences. In order to realize this step, we model it as a multi-objective combinatorial optimization problem, and an improved immune algorithm (IIA) is proposed to solve it. In the experimental stage, a series of simulated experiments are conducted on nine datasets with different levels of complexity. The results show that the proposed algorithm increases the computational efficiency and effectiveness. Moreover, an empirical study is carried out to validate the proposed approach from a pedagogical view. Compared with a self-selection based approach and the other evolutionary algorithm based approaches, the proposed approach produces better outcomes in terms of learners' homework, final exam grades and satisfaction.

Leveraging Visibility-Based Rewards in DRL-based Worker Travel Path Simulation for Improving the Learning Performance

  • Kim, Minguk;Kim, Tae Wan
    • Korean Journal of Construction Engineering and Management
    • /
    • v.24 no.5
    • /
    • pp.73-82
    • /
    • 2023
  • Optimization of Construction Site Layout Planning (CSLP) heavily relies on workers' travel paths. However, traditional path generation approaches predominantly focus on the shortest path, often neglecting critical variables such as individual wayfinding tendencies, the spatial arrangement of site objects, and potential hazards. These oversights can lead to compromised path simulations, resulting in less reliable site layout plans. While Deep Reinforcement Learning (DRL) has been proposed as a potential alternative to address these issues, it has shown limitations. Despite presenting more realistic travel paths by considering these variables, DRL often struggles with efficiency in complex environments, leading to extended learning times and potential failures. To overcome these challenges, this study introduces a refined model that enhances spatial navigation capabilities and learning performance by integrating workers' visibility into the reward functions. The proposed model demonstrated a 12.47% increase in the pathfinding success rate and notable improvements in the other two performance measures compared to the existing DRL framework. The adoption of this model could greatly enhance the reliability of the results, ultimately improving site operational efficiency and safety management such as by reducing site congestion and accidents. Future research could expand this study by simulating travel paths in dynamic, multi-agent environments that represent different stages of construction.

Characteristics and Development Processes of Early Elementary Students' Mathematical Symbolizing (초등학교 저학년의 수학적 상징화 방법의 발전 과정과 특징에 관한 연구)

  • Kim Nam Gyun
    • School Mathematics
    • /
    • v.7 no.1
    • /
    • pp.55-75
    • /
    • 2005
  • Mathematical symbolizing is an important part of mathematics learning. But many students have difficulties m symbolizing mathematical ideas formally. If students had experiences inventing their own mathematical symbols and developing them to conventional ones natural way, i.e. learning mathematical symbols via expressive approaches, they could understand and use formal mathematical symbols meaningfully. These experiences are especially valuable for students who meet mathematical symbols for the first time. Hence, there are needs to investigate how early elementary school students can and should experience meaningful mathematical symbolizing. The purpose of this study was to analyze students' mathematical symbolizing processes and characteristics of theses. We carried out teaching experiments that promoted meaningful mathematical symbolizing among eight first graders. And then we analyzed students' symbolizing processes and characteristics of expressive approaches to mathematical symbols in early elementary students. As a result, we could places mathematical symbolizing processes developed in the teaching experiments under five categories. And we extracted and discussed several characteristics of early elementary students' meaningful mathematical symbolizing processes.

  • PDF

Image classification and captioning model considering a CAM-based disagreement loss

  • Yoon, Yeo Chan;Park, So Young;Park, Soo Myoung;Lim, Heuiseok
    • ETRI Journal
    • /
    • v.42 no.1
    • /
    • pp.67-77
    • /
    • 2020
  • Image captioning has received significant interest in recent years, and notable results have been achieved. Most previous approaches have focused on generating visual descriptions from images, whereas a few approaches have exploited visual descriptions for image classification. This study demonstrates that a good performance can be achieved for both description generation and image classification through an end-to-end joint learning approach with a loss function, which encourages each task to reach a consensus. When given images and visual descriptions, the proposed model learns a multimodal intermediate embedding, which can represent both the textual and visual characteristics of an object. The performance can be improved for both tasks by sharing the multimodal embedding. Through a novel loss function based on class activation mapping, which localizes the discriminative image region of a model, we achieve a higher score when the captioning and classification model reaches a consensus on the key parts of the object. Using the proposed model, we established a substantially improved performance for each task on the UCSD Birds and Oxford Flowers datasets.

Developing APC for Weighting Quality Attributes (품질 속성의 가중치 선정을 위한 APC에 관한 연구)

  • Song, Hae Geun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.36 no.3
    • /
    • pp.8-16
    • /
    • 2013
  • Determining relative importance among many quality attributes under financial constraints is an important task. The weighted value of an attribute particularly in QFD, will influence on engineering characteristics and this will eventually influence the whole manufacturing process such as parts deployment, process planning, and production planning. Several scholars have suggested weighting formulas using CSC (Customer Satisfaction Coefficient) in the Kano model. However, previous research shows that the validity of the CSC approaches has not been proved systematically. The aim of the present study is to address drawbacks of CSC and to develop APC (Average Potential Coefficient), a new approach for weighting of quality attributes. For this, the current study investigated 33 quality attributes of e-learning and conducted a survey of 375 university students for the results of APC, the Kano model, and the direct importance of the quality attributes. The results show that the proposed APC is better than other approaches based on the correlation analysis with the results of direct importance. An analysis of e-leaning's quality perceptions using the Kano model and suggestions for improving e-learning's service quality are also included in this study.

Use of learning method to generate of motion pattern for robot (학습기법을 이용한 로봇의 모션패턴 생성 연구)

  • Kim, Dong-won
    • Journal of Platform Technology
    • /
    • v.6 no.3
    • /
    • pp.23-30
    • /
    • 2018
  • A motion pattern generation is a process of calculating a certain stable motion trajectory for stably operating a certain motion. A motion control is to make a posture of a robot stable by eliminating occurring disturbances while a robot is in operation using a pre-generated motion pattern. In this paper, a general method of motion pattern generation for a biped walking robot using universal approximator, learning neural networks, is proposed. Existing techniques are numerical methods using recursive computation and approximating methods which generate an approximation of a motion pattern by simplifying a robot's upper body structure. In near future other approaches for the motion pattern generations will be applied and compared as to be done.

Purchase Prediction by Analyzing Users' Online Behaviors Using Machine Learning and Information Theory Approaches

  • Kim, Minsung;Im, Il;Han, Sangman
    • Asia pacific journal of information systems
    • /
    • v.26 no.1
    • /
    • pp.66-79
    • /
    • 2016
  • The availability of detailed data on customers' online behaviors and advances in big data analysis techniques enable us to predict consumer behaviors. In the past, researchers have built purchase prediction models by analyzing clickstream data; however, these clickstream-based prediction models have had several limitations. In this study, we propose a new method for purchase prediction that combines information theory with machine learning techniques. Clickstreams from 5,000 panel members and data on their purchases of electronics, fashion, and cosmetics products were analyzed. Clickstreams were summarized using the 'entropy' concept from information theory, while 'random forests' method was applied to build prediction models. The results show that prediction accuracy of this new method ranges from 0.56 to 0.83, which is a significant improvement over values for clickstream-based prediction models presented in the past. The results indicate further that consumers' information search behaviors differ significantly across product categories.

Data-Driven-Based Beam Selection for Hybrid Beamforming in Ultra-Dense Networks

  • Ju, Sang-Lim;Kim, Kyung-Seok
    • International journal of advanced smart convergence
    • /
    • v.9 no.2
    • /
    • pp.58-67
    • /
    • 2020
  • In this paper, we propose a data-driven-based beam selection scheme for massive multiple-input and multiple-output (MIMO) systems in ultra-dense networks (UDN), which is capable of addressing the problem of high computational cost of conventional coordinated beamforming approaches. We consider highly dense small-cell scenarios with more small cells than mobile stations, in the millimetre-wave band. The analog beam selection for hybrid beamforming is a key issue in realizing millimetre-wave UDN MIMO systems. To reduce the computation complexity for the analog beam selection, in this paper, two deep neural network models are used. The channel samples, channel gains, and radio frequency beamforming vectors between the access points and mobile stations are collected at the central/cloud unit that is connected to all the small-cell access points, and are used to train the networks. The proposed machine-learning-based scheme provides an approach for the effective implementation of massive MIMO system in UDN environment.

Greedy Learning of Sparse Eigenfaces for Face Recognition and Tracking

  • Kim, Minyoung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.14 no.3
    • /
    • pp.162-170
    • /
    • 2014
  • Appearance-based subspace models such as eigenfaces have been widely recognized as one of the most successful approaches to face recognition and tracking. The success of eigenfaces mainly has its origins in the benefits offered by principal component analysis (PCA), the representational power of the underlying generative process for high-dimensional noisy facial image data. The sparse extension of PCA (SPCA) has recently received significant attention in the research community. SPCA functions by imposing sparseness constraints on the eigenvectors, a technique that has been shown to yield more robust solutions in many applications. However, when SPCA is applied to facial images, the time and space complexity of PCA learning becomes a critical issue (e.g., real-time tracking). In this paper, we propose a very fast and scalable greedy forward selection algorithm for SPCA. Unlike a recent semidefinite program-relaxation method that suffers from complex optimization, our approach can process several thousands of data dimensions in reasonable time with little accuracy loss. The effectiveness of our proposed method was demonstrated on real-world face recognition and tracking datasets.