• Educational Technology International
• /
• v.18 no.2
• /
• pp.131-157
• /
• 2017

The purposes of the study were to investigate the participation of artists in paper circuit computing learning and to conduct an in-depth study on the formation and development of practical knowledge. To do this, we selected as research participants six artists who participated in the learning program of an art museum, and used various methods such as pre-open questionnaires, participation observation, and individual interviews to collect data. The collected data were analyzed based on community of practice theory. Results showed that the artists participated in the learning based on a desire to use new technology or find a new work production method for interacting with their audiences. In addition, the artists actively formed practical knowledge in the curriculum and tried to apply paper circuit computing to their works. To continuously develop the research, participants formed a study group or set up a practical goal through planned exhibitions. The results of this study can provide implications for practical approaches to, and utilization of, paper circuit computing.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1408-1414
• /
• 2019

Deep artificial neural network with transfer learning is applied to compressed sensing cardiovascular MRI. Transfer learning is a method that utilizes structure, filter kernels, and weights of the network used in prior learning for current learning or application. The transfer learning is useful in accelerating learning speed, and in generalization of the neural network when learning data is limited. From a cardiac MRI experiment, with 8 healthy volunteers, the neural network with transfer learning was able to reduce learning time by a factor of more than five compared to that with standalone learning. Using test data set, reconstructed images with transfer learning showed lower normalized mean square error and better image quality compared to those without transfer learning.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.12
• /
• pp.411-418
• /
• 2020

In the field of information security, IDS(Intrusion Detection System) is normally classified in two different categories: signature-based IDS and anomaly-based IDS. Many studies in anomaly-based IDS have been conducted that analyze network traffic data generated in cyberspace by machine learning algorithms. In this paper, we studied pre-processing methods to overcome performance degradation problems cashed by rare classes. We experimented classification performance of a Machine Learning algorithm by reconstructing data set based on rare classes and semi rare classes. After reconstructing data into three different sets, wrapper and filter feature selection methods are applied continuously. Each data set is regularized by a quantile scaler. Depp neural network model is used for learning and validation. The evaluation results are compared by true positive values and false negative values. We acquired improved classification performances on all of three data sets.

• Journal of dental hygiene science
• /
• v.20 no.4
• /
• pp.206-212
• /
• 2020

Background: A Teachable Machine is a kind of machine learning web-based tool for general persons. In this paper, the feasibility of Google's Teachable Machine (ver. 2.0) was studied in the diagnosis of the tooth-marked tongue. Methods: For machine learning of tooth-marked tongue diagnosis, a total of 1,250 tongue images were used on Kaggle's web site. Ninety percent of the images were used for the training data set, and the remaining 10% were used for the test data set. Using Google's Teachable Machine (ver. 2.0), machine learning was performed using separated images. To optimize the machine learning parameters, I measured the diagnosis accuracies according to the value of epoch, batch size, and learning rate. After hyper-parameter tuning, the ROC (receiver operating characteristic) analysis method determined the sensitivity (true positive rate, TPR) and specificity (false positive rate, FPR) of the machine learning model to diagnose the tooth-marked tongue. Results: To evaluate the usefulness of the Teachable Machine in clinical application, I used 634 tooth-marked tongue images and 491 no-marked tongue images for machine learning. When the epoch, batch size, and learning rate as hyper-parameters were 75, 0.0001, and 128, respectively, the accuracy of the tooth-marked tongue's diagnosis was best. The accuracies for the tooth-marked tongue and the no-marked tongue were 92.1% and 72.6%, respectively. And, the sensitivity (TPR) and specificity (FPR) were 0.92 and 0.28, respectively. Conclusion: These results are more accurate than Li's experimental results calculated with convolution neural network. Google's Teachable Machines show good performance by hyper-parameters tuning in the diagnosis of the tooth-marked tongue. We confirmed that the tool is useful for several clinical applications.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.7
• /
• pp.271-278
• /
• 2021

As the current cyber attacks become more intelligent, the existing Intrusion Detection System is difficult for detecting intelligent attacks that deviate from the existing stored patterns. In an attempt to solve this, a model of a deep learning-based intrusion detection system that analyzes the pattern of intelligent attacks through data learning has emerged. Intrusion detection systems are divided into host-based and network-based depending on the installation location. Unlike network-based intrusion detection systems, host-based intrusion detection systems have the disadvantage of having to observe the inside and outside of the system as a whole. However, it has the advantage of being able to detect intrusions that cannot be detected by a network-based intrusion detection system. Therefore, in this study, we conducted a study on a host-based intrusion detection system. In order to evaluate and improve the performance of the host-based intrusion detection system model, we used the host-based Leipzig Intrusion Detection-Data Set (LID-DS) published in 2018. In the performance evaluation of the model using that data set, in order to confirm the similarity of each data and reconstructed to identify whether it is normal data or abnormal data, 1D vector data is converted to 3D image data. Also, the deep learning model has the drawback of having to re-learn every time a new cyber attack method is seen. In other words, it is not efficient because it takes a long time to learn a large amount of data. To solve this problem, this paper proposes the Siamese Convolutional Neural Network (Siamese-CNN) to use the Few-Shot Learning method that shows excellent performance by learning the little amount of data. Siamese-CNN determines whether the attacks are of the same type by the similarity score of each sample of cyber attacks converted into images. The accuracy was calculated using Few-Shot Learning technique, and the performance of Vanilla Convolutional Neural Network (Vanilla-CNN) and Siamese-CNN was compared to confirm the performance of Siamese-CNN. As a result of measuring Accuracy, Precision, Recall and F1-Score index, it was confirmed that the recall of the Siamese-CNN model proposed in this study was increased by about 6% from the Vanilla-CNN model.

• Journal of KIISE:Software and Applications
• /
• v.27 no.2
• /
• pp.97-107
• /
• 2000

Incremental learning generally reduces training time and increases the generalization of a neural network by selecting training data incrementally during the training. However, the existing methods of incremental learning repeatedly evaluate the importance of training data every time they select additional data. In this paper, an incremental learning algorithm is proposed for pattern classification problems. It evaluates the importance of each piece of data only once before starting the training. The importance of the data depends on how close they are to the decision boundary. The current paper presents an algorithm which orders the data according to their distance to the decision boundary by using clustering. Experimental results of two artificial and real world classification problems show that this proposed incremental learning method significantly reduces the size of the training set without decreasing generalization performance.

• Journal of Korean Academy of Nursing
• /
• v.26 no.2
• /
• pp.281-289
• /
• 1996

Neural networks have recently attracted considerable attention in the field of classification and other areas. The purpose of this study was to demonstrate an experiment using back-propagation neural network model applied to nursing diagnosis. The network's structure has three layers ; one input layer for representing signs and symptoms and one output layer for nursing diagnosis as well as one hidden layer. The first prototype of a nursing diagnosis system for patients with stomach cancer was developed with 254 nodes for the input layer and 20 nodes for the output layer of 20 nursing diagnoses, by utilizing learning data set collected from 118 patients with stomach cancer. It showed a hitting ratio of .93 when the model was developed with 20,000 times of learning, 6 nodes of hidden layer, 0.5 of momentum and 0.5 of learning coefficient. The system was primarily designed to be an aid in the clinical reasoning process. It was intended to simplify the use of nursing diagnoses for clinical practitioners. In order to validate the developed model, a set of test data from 20 patients with stomach cancer was applied to the diagnosis system. The data for 17 patients were concurrent with the result produced from the nursing diagnosis system which shows the hitting ratio of 85％. Future research is needed to develop a system with more nursing diagnoses and an evaluation process, and to expand the system to be applicable to other groups of patients.

• The Journal of Information Technology and Database
• /
• v.2 no.2
• /
• pp.71-85
• /
• 1995

Many research results conducted by neural network researchers have claimed that the classification accuracy of neural networks is superior to, or at least equal to that of conventional methods. However, in series of neural network classifications, it was found that the classification accuracy strongly depends on the characteristics of training data set. Even though there are many research reports that the classification accuracy of neural networks can be different, depending on the composition and architecture of the networks, training algorithm, and test data set, very few research addressed the problem of classification accuracy when the basic assumption of data monotonicity is violated, In this research, development project of automated credit evaluation system is described. The finding was that arrangement of training data is critical to successful implementation of neural training to maintain monotonicity of the data set, for enhancing classification accuracy of neural networks.

• Asia pacific journal of information systems
• /
• v.28 no.4
• /
• pp.308-319
• /
• 2018

This paper aims at providing valuable insights on Financial Fraud Detection on a mobile money transactional activity. We have predicted and classified the transaction as normal or fraud with a small sample and massive data set using Azure and Spark ML, which are traditional systems and Big Data respectively. Experimenting with sample dataset in Azure, we found that the Decision Forest model is the most accurate to proceed in terms of the recall value. For the massive data set using Spark ML, it is found that the Random Forest classifier algorithm of the classification model proves to be the best algorithm. It is presented that the Spark cluster gets much faster to build and evaluate models as adding more servers to the cluster with the same accuracy, which proves that the large scale data set can be predictable using Big Data platform. Finally, we reached a recall score with 0.73, which implies a satisfying prediction quality in predicting fraudulent transactions.

• The KIPS Transactions:PartB
• /
• v.14B no.4
• /
• pp.303-310
• /
• 2007

In machine learning, the ensemble classifier that is a set of classifiers have been introduced for higher accuracy than individual classifiers. We propose a new ensemble learning method that employs a set of region based classifiers. To show the performance of the proposed method. we compared its performance with that of bagging and boosting, which ard existing ensemble methods. Since the distribution of data can be different in different regions in the feature space, we split the data and generate classifiers based on each region and apply a weighted voting among the classifiers. We used 11 data sets from the UCI Machine Learning Repository to compare the performance of our new ensemble method with that of individual classifiers as well as existing ensemble methods such as bagging and boosting. As a result, we found that our method produced improved performance, particularly when the base learner is Naive Bayes or SVM.