• Title/Summary/Keyword: generalization-process

Search Result 295, Processing Time 0.024 seconds

A Study on Teaching Methods of Extension of Cosine Rule Using Analogy (유추를 활용한 코사인 법칙의 일반화 지도방안)

  • Kim, Sungsoo;Park, Dal-Won
    • Journal of the Korean School Mathematics Society
    • /
    • v.16 no.4
    • /
    • pp.927-941
    • /
    • 2013
  • In this paper, we investigate and analysis high school students' generalization of cosine rule using analogy, and we study teaching and learning methods improving students' analogical thinking ability to improve mathematical thinking process. When students can reproduce what they have learned through inductive reasoning process or analogical thinking process and when they can justify their own mathematical knowledge through logical inference or deductive reasoning process, they can truly internalize what they learn and have an ability to use it in various situations.

  • PDF

Automated Generation of Multi-Scale Map Database for Web Map Services (웹 지도서비스를 위한 다축척 지도 데이터셋 자동생성 기법 연구)

  • Park, Woo Jin;Bang, Yoon Sik;Yu, Ki Yun
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.5
    • /
    • pp.435-444
    • /
    • 2012
  • Although the multi-scale map database should be constructed for the web map services and location-based services, much part of generation process is based on the manual editing. In this study, the map generalization methodology for automatic construction of multi-scale database from the primary data is proposed. Moreover, the generalization methodology is applied to the real map data and the prototype of multi-scale map dataset is generated. Among the generalization operators, selection/elimination, simplification and amalgamation/aggregation is applied in organized manner. The algorithm and parameters for generalization is determined experimentally considering T$\ddot{o}$pfer's radical law, minimum drawable object of map and visual aspect. The target scale level is five(1:1,000, 1:5,000, 1:25,000, 1:100,000, 1:500,000) and for the target data, new address data and digital topographic map is used.

Diagnostic Software for Wastewater Treatment Plant using Activated-Sludge Process (활성슬러지 폐수처리장 진단 소프트웨어)

  • 손건태;이재은
    • Journal of Environmental Science International
    • /
    • v.8 no.5
    • /
    • pp.611-616
    • /
    • 1999
  • The diagnostic software for the wastewater treatment plant using activated-sluge process is developed in order to increase the efficiency of management of the wastewater treatment plant. This software is based on the expert system and the visualized user interface, including the diagnosis of quantitative and qualitative data. For the generalization of this software, the initialization of each unit process and updating the files can be possible.

  • PDF

A RELATIONSHIP BETWEEN CAYLEY-DICKSON PROCESS AND THE GENERALIZED STUDY DETERMINANT

  • Putri, Pritta Etriana;Wijaya, Laurence Petrus
    • Communications of the Korean Mathematical Society
    • /
    • v.36 no.3
    • /
    • pp.413-422
    • /
    • 2021
  • The Study determinant is known as one of replacements for the determinant of matrices with entries in a noncommutative ring. In this paper, we give a generalization of the Study determinant and show its relationship with the Cayley-Dickson process. We also give some properties of a non-associative ring obtained by the Cayley-Dickson process with a not necessarily commutative, but associative ring as the initial ring.

ANALYZING THE DURATION OF SUCCESS AND FAILURE IN MARKOV-MODULATED BERNOULLI PROCESSES

  • Yoora Kim
    • Journal of the Korean Mathematical Society
    • /
    • v.61 no.4
    • /
    • pp.693-711
    • /
    • 2024
  • A Markov-modulated Bernoulli process is a generalization of a Bernoulli process in which the success probability evolves over time according to a Markov chain. It has been widely applied in various disciplines for modeling and analysis of systems in random environments. This paper focuses on providing analytical characterizations of the Markovmodulated Bernoulli process by introducing key metrics, including success period, failure period, and cycle. We derive expressions for the distributions and the moments of these metrics in terms of the model parameters.

Exploring the Practical Value of Business Games: Analysis with Toulmin's Sensemaking Framework

  • Joo Baek Kim;Edward Watson;Soo Il Shin
    • Asia pacific journal of information systems
    • /
    • v.32 no.4
    • /
    • pp.803-829
    • /
    • 2022
  • With the advances in technology and the trend towards increased computer-based experiential learning in education settings, business games are being increasingly used by business educators. This article utilizes Toulmin's Sensemaking Framework to investigate the sensemaking process of business professionals to reveal how they consciously reason about the value of business games for learning complex business concepts and principles. Using the analysis of responses from 43 business professionals, our study identifies key areas where business professionals find value in business games and the limitations of using business games. First, business games are found to be an effective tool when teaching practical business skill sets to business professionals. Second, business games enhance the overall learning process in professional business training. Third, despite the advantages, some pitfalls in applying business games to practice are found. We also found sub-themes, claims, and argument patterns of how business professionals evaluate the value of business games through a grounded theory qualitative analysis method. Analysis results show several ground-warrant patterns exist in the arguments on values of business games including general principle - causal reasoning, personal experience - generalization, and personal projection - generalization. With these findings, we believe this paper contributes to the theory and practice of business game design, development, and the game playing and learning process.

Improving Generalization Performance of Neural Networks using Natural Pruning and Bayesian Selection (자연 프루닝과 베이시안 선택에 의한 신경회로망 일반화 성능 향상)

  • 이현진;박혜영;이일병
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.3_4
    • /
    • pp.326-338
    • /
    • 2003
  • The objective of a neural network design and model selection is to construct an optimal network with a good generalization performance. However, training data include noises, and the number of training data is not sufficient, which results in the difference between the true probability distribution and the empirical one. The difference makes the teaming parameters to over-fit only to training data and to deviate from the true distribution of data, which is called the overfitting phenomenon. The overfilled neural network shows good approximations for the training data, but gives bad predictions to untrained new data. As the complexity of the neural network increases, this overfitting phenomenon also becomes more severe. In this paper, by taking statistical viewpoint, we proposed an integrative process for neural network design and model selection method in order to improve generalization performance. At first, by using the natural gradient learning with adaptive regularization, we try to obtain optimal parameters that are not overfilled to training data with fast convergence. By adopting the natural pruning to the obtained optimal parameters, we generate several candidates of network model with different sizes. Finally, we select an optimal model among candidate models based on the Bayesian Information Criteria. Through the computer simulation on benchmark problems, we confirm the generalization and structure optimization performance of the proposed integrative process of teaming and model selection.

A Study on Training Ensembles of Neural Networks - A Case of Stock Price Prediction (신경망 학습앙상블에 관한 연구 - 주가예측을 중심으로 -)

  • 이영찬;곽수환
    • Journal of Intelligence and Information Systems
    • /
    • v.5 no.1
    • /
    • pp.95-101
    • /
    • 1999
  • In this paper, a comparison between different methods to combine predictions from neural networks will be given. These methods are bagging, bumping, and balancing. Those are based on the analysis of the ensemble generalization error into an ambiguity term and a term incorporating generalization performances of individual networks. Neural Networks and AI machine learning models are prone to overfitting. A strategy to prevent a neural network from overfitting, is to stop training in early stage of the learning process. The complete data set is spilt up into a training set and a validation set. Training is stopped when the error on the validation set starts increasing. The stability of the networks is highly dependent on the division in training and validation set, and also on the random initial weights and the chosen minimization procedure. This causes early stopped networks to be rather unstable: a small change in the data or different initial conditions can produce large changes in the prediction. Therefore, it is advisable to apply the same procedure several times starting from different initial weights. This technique is often referred to as training ensembles of neural networks. In this paper, we presented a comparison of three statistical methods to prevent overfitting of neural network.

  • PDF

A Study on the Data Reduction Techniques for Small Scale Map Production (소축적 지도제작을 위한 데이터 감축 기법에 관한 연구)

  • 곽강율;이호남;김명배
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.13 no.1
    • /
    • pp.77-83
    • /
    • 1995
  • This paper is concentrated on map generalization in digital environment for automated multi-scale map pro-duction using conventional hardcopy maps. Line generalization is urgently required process to prepare small scale digital map database when large scale map databases are available. This paper outlines a new approach to the line generalization when preparing small scale map on the basis of existing large scale distal map. Line generalizations are conducted based on zero-crossing algorithm using six sheets of 115,000 scale YEOSU area which produced by National Geographic Institute. The results are compared to Douglas-Peucker algorithm and manual method. The study gives full details of the data reduction rates and alternatives based on the proposed algorithm.

  • PDF

Support vector machine for prediction of the compressive strength of no-slump concrete

  • Sobhani, J.;Khanzadi, M.;Movahedian, A.H.
    • Computers and Concrete
    • /
    • v.11 no.4
    • /
    • pp.337-350
    • /
    • 2013
  • The sensitivity of compressive strength of no-slump concrete to its ingredient materials and proportions, necessitate the use of robust models to guarantee both estimation and generalization features. It was known that the problem of compressive strength prediction owes high degree of complexity and uncertainty due to the variable nature of materials, workmanship quality, etc. Moreover, using the chemical and mineral additives, superimposes the problem's complexity. Traditionally this property of concrete is predicted by conventional linear or nonlinear regression models. In general, these models comprise lower accuracy and in most cases they fail to meet the extrapolation accuracy and generalization requirements. Recently, artificial intelligence-based robust systems have been successfully implemented in this area. In this regard, this paper aims to investigate the use of optimized support vector machine (SVM) to predict the compressive strength of no-slump concrete and compare with optimized neural network (ANN). The results showed that after optimization process, both models are applicable for prediction purposes with similar high-qualities of estimation and generalization norms; however, it was indicated that optimization and modeling with SVM is very rapid than ANN models.