• 한국정보통신학회논문지
• /
• 제26권1호
• /
• pp.134-139
• /
• 2022

최근 프로그래밍과 인공지능에 대한 관심이 지속적으로 높아지고 있으며 초등학교부터 필수 교육으로 소프트웨어 교육을 실시하고 있다. 효율적인 프로그래밍 교육을 위해서 기본적으로 학생과 교사에게 적합한 실습실 환경을 구축해야 하지만 노후 컴퓨터와 네트워크 장비 구축 미비 등으로 인한 성능 문제가 있으며 이러한 컴퓨터들의 교체를 통해 성능을 높이는 일은 단기간에 현실적으로 불가능하다. 따라서 본 논문에서는 프로그래밍 실습 환경에 대한 문제 해결을 위해 React와 Spring boot를 사용하여 웹 페이지 기반의 온라인 실습환경 및 알고리즘 경진대회 채점 시스템을 제안한다. 이를 통해 사양이 낮은 컴퓨터에서도 웹 브라우저만을 사용하여 프로그래밍 학습을 진행할 수 있을 것으로 사료된다. 또한 학습하고자 하는 언어와 관계없이 여러 가지 프로그래밍 언어를 학습할 수 있으므로 실습 환경 구축을 위해 시간적 비용을 줄일 수 있을 것으로 사료된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권7호
• /
• pp.2399-2413
• /
• 2021

A recommendation system is an information filter tool, which uses the ratings and reviews of users to generate a personalized recommendation service for users. However, the cold-start problem of users and items is still a major research hotspot on service recommendations. To address this challenge, this paper proposes a high-efficient hybrid recommendation system based on Fuzzy C-Means (FCM) clustering and supervised learning models. The proposed recommendation method includes two aspects: on the one hand, FCM clustering technique has been applied to the item-based collaborative filtering framework to solve the cold start problem; on the other hand, the content information is integrated into the collaborative filtering. The algorithm constructs the user and item membership degree feature vector, and adopts the data representation form of the scoring matrix to the supervised learning algorithm, as well as by combining the subjective membership degree feature vector and the objective membership degree feature vector in a linear combination, the prediction accuracy is significantly improved on the public datasets with different sparsity. The efficiency of the proposed system is illustrated by conducting several experiments on MovieLens dataset.

• 융합신호처리학회논문지
• /
• 제23권3호
• /
• pp.143-149
• /
• 2022

This excerpt delineates a quantitative measure of relationship between a research title and its respective abstract extracted from different journal articles documented through a Korean Citation Index (KCI) database published through various journals. In this paper, we propose a machine learning-based similarity metric that does not assume normality on dataset, realizes the imbalanced dataset problem, and zero-variance problem that affects most of the rule-based algorithms. The advantage of using this algorithm is that, it eliminates the limitations experienced by Pearson correlation coefficient (r) and additionally, it solves imbalanced dataset problem. A total of 107 journal articles collected from the database were used to develop a corpus with authors, year of publication, title, and an abstract per each. Based on the experimental results, the proposed algorithm achieved high correlation coefficient values compared to others which are cosine similarity, euclidean, and pearson correlation coefficients by scoring a maximum correlation of 1, whereas others had obtained non-a-number value to some experiments. With these results, we found that an effective title must have high correlation coefficient with the respective abstract.

• 응용통계연구
• /
• 제24권2호
• /
• pp.425-433
• /
• 2011

Reject inference in credit scoring is a statistical approach to adjust for nonrandom sample bias due to rejected applicants. Function estimation approaches are based on the assumption that rejected applicants are not necessary to be included in the estimation, when the missing data mechanism is missing at random. On the other hand, the density estimation approach by using mixture models indicates that reject inference should include rejected applicants in the model. When mixture models are chosen for reject inference, it is often assumed that data follow a normal distribution. If data include missing values, an application of the normal mixture model to fully observed cases may cause another sample bias due to missing values. We extend reject inference by a multivariate normal mixture model to handle incomplete characteristic variables. A simulation study shows that inclusion of incomplete characteristic variables outperforms the function estimation approaches.

• BMB Reports
• /
• 제44권4호
• /
• pp.250-255
• /
• 2011

In multicellular organisms, including humans, understanding expression specificity at the tissue level is essential for interpreting protein function, such as tissue differentiation. We developed a prediction approach via generated sequence features from overrepresented patterns in housekeeping (HK) and tissue-specific (TS) genes to classify TS expression in humans. Using TS domains and transcriptional factor binding sites (TFBSs), sequence characteristics were used as indices of expressed tissues in a Random Forest algorithm by scoring exclusive patterns considering the biological intuition; TFBSs regulate gene expression, and the domains reflect the functional specificity of a TS gene. Our proposed approach displayed better performance than previous attempts and was validated using computational and experimental methods.

• ETRI Journal
• /
• 제33권2호
• /
• pp.240-250
• /
• 2011

To enable a relevance feedback paradigm to evolve itself by users' feedback, a reinforcement learning method is proposed. The feature space of the medical images is partitioned into positive and negative hypercubes by the system. Each hypercube constitutes an individual in a genetic algorithm infrastructure. The rules take recombination and mutation operators to make new rules for better exploring the feature space. The effectiveness of the rules is checked by a scoring method by which the ineffective rules will be omitted gradually and the effective ones survive. Our experiments on a set of 10,004 images from the IRMA database show that the proposed approach can better describe the semantic content of images for image retrieval with respect to other existing approaches in the literature.

• 산업경영시스템학회지
• /
• 제36권1호
• /
• pp.44-52
• /
• 2013

For evaluating participation in collaboration project, the peer assement method is mostly used and various scoring methods have been proposed. But, the reliability and validity of the peer assessment method are still doubted for all most method. In order to overcome these weaknesss, some guidelines and training methods have been recommended. In this article, however, statistical technique is proposed for measuring individual contributions to collaboration projects considering each assessor's reliability. The gist of our proposed algorithm is that an assessor's reliability depends on the evaluation policy, and this reliability is evaluated by an analysis of variance of the scores assigned by the assessor. We also show that the proposed method is very efficient by case study in university class.

• Journal of applied mathematics & informatics
• /
• 제41권5호
• /
• pp.973-988
• /
• 2023

In real-life scenarios, we may have to deal with real numbers or numbers in intervals or a combination of both to solve multi-criteria decision-making (MCDM) problems. Also, we may come across a situation where we must combine this interval and actual number membership values into a single real number. The most significant factor in combining these membership values into a single value is by using aggregation operators or scoring algorithms. To overcome such a situation, we suggest the cubic hypersoft set (CHSS) concept as a workaround. Ultimately, this makes it simple for the decision-maker to obtain information without misconceptions. The primary aim of this study is to establish some operational laws for the cubic hypersoft set, present the fundamental properties of aggregation operators and propose an algorithm by using the technique of order of preference by similarity to the ideal solution (TOPSIS) technique based on correlation coefficients to analyze the stress-coping skills of workers.

• International Journal of Control, Automation, and Systems
• /
• 제6권6호
• /
• pp.809-817
• /
• 2008

Program plagiarism is widespread due to intelligent software and the global Internet environment. Consequently the detection of plagiarized source code and software is becoming important especially in academic field. Though numerous studies have been reported for detecting plagiarized pairs of codes, we cannot find any profound work on understanding the underlying mechanisms of plagiarism. In this paper, we study the evolutionary process of source codes regarding that the plagiarism procedure can be considered as evolutionary steps of source codes. The final goal of our paper is to reconstruct a tree depicting the evolution process in the source code. To this end, we extend the well-known bioinformatics approach, a local alignment approach, to detect a region of similar code with an adaptive scoring matrix. The asymmetric code similarity based on the local alignment can be considered as one of the main contribution of this paper. The phylogenetic tree or evolution tree of source codes can be reconstructed using this asymmetric measure. To show the effectiveness and efficiency of the phylogeny construction algorithm, we conducted experiments with more than 100 real source codes which were obtained from East-Asia ICPC(International Collegiate Programming Contest). Our experiments showed that the proposed algorithm is quite successful in reconstructing the evolutionary direction, which enables us to identify plagiarized codes more accurately and reliably. Also, the phylogeny construction algorithm is successfully implemented on top of the plagiarism detection system of an automatic program evaluation system.

• Nuclear Engineering and Technology
• /
• 제55권10호
• /
• pp.3913-3923
• /
• 2023

Todays, medium energy resolution detectors are preferably used in radioisotope identification devices(RID) in nuclear and radioactive material categorization. However, there is still a need to develop or enhance « automated identifiers » for the useful RID algorithms. To decide whether any material is SNM or NORM, a key parameter is the better energy resolution of the detector. Although masking, shielding and gain shift/stabilization and other affecting parameters on site are also important for successful operations, the suitability of the RID algorithm is also a critical point to enhance the identification reliability while extracting the features from the spectral analysis. In this study, a RID algorithm based on Bayesian statistical method has been modified for medium energy resolution detectors and applied to the uranium gamma-ray spectra taken by a LaBr3:Ce detector. The present Bayesian RID algorithm covers up to 2000 keV energy range. It uses the peak centroids, the peak areas from the measured gamma-ray spectra. The extraction features are derived from the peak-based Bayesian classifiers to estimate a posterior probability for each isotope in the ANSI library. The program operations were tested under a MATLAB platform. The present peak based Bayesian RID algorithm was validated by using single isotopes(²⁴¹Am, ⁵⁷Co, ¹³⁷Cs, ⁵⁴Mn, ⁶⁰Co), and then applied to five standard nuclear materials(0.32-4.51% at.²³⁵U), as well as natural U- and Th-ores. The ID performance of the RID algorithm was quantified in terms of F-score for each isotope. The posterior probability is calculated to be 54.5-74.4% for ²³⁸U and 4.7-10.5% for ²³⁵U in EC-NRM171 uranium materials. For the case of the more complex gamma-ray spectra from CRMs, the total scoring (ST) method was preferred for its ID performance evaluation. It was shown that the present peak based Bayesian RID algorithm can be applied to identify ²³⁵U and ²³⁸U isotopes in LEU or natural U-Th samples if a medium energy resolution detector is was in the measurements.