• Journal of The Korean Association of Information Education
• /
• v.25 no.6
• /
• pp.1005-1013
• /
• 2021

With the prolonged COVID-19, the existing academic gap is widening. The purpose of this study is to provide homeroom teachers with a visual confirmation of the academic achievement gap in grades and classrooms through academic achievement analysis, and to use this to help them design lessons and explore ways to improve the academic achievement gap. The data of students' Korean and math diagnostic evaluation scores at the beginning of the school year were visualized as clusters using the K-means algorithm, and as a result, it was confirmed that a meaningful clusters were formed. In addition, through the results of the teacher interview, it was confirmed that this system was meaningful in improving the academic achievement gap, such as checking the learning level and academic achievement of students, and designing classes such as individual supplementary instruction and level-specific learning. This means that this academic achievement data analysis system helps to improve the academic gap. This study provides practical help to homeroom teachers in exploring ways to improve the academic gap in grades and classes, and is expected to ultimately contribute to improving the academic gap.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.1
• /
• pp.58-64
• /
• 2016

In this paper presents Robust k-means clustering-based high-speed bar code decoding method to blur and lighting. for fast operation speed and robust decoding to blur, proposed method uses adaptive local threshold binarization methods that calculate threshold value by dividing blur region and a non-blurred region. Also, in order to prevent decoding fail from the noise, decoder based on k-means clustering algorithm is implemented using area data summed pixel width line of the same number of element. Results of simulation using samples taken at various worst case environment, the average success rate of proposed method is 98.47%. it showed the highest decoding success rate among the three comparison programs.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.15 no.4
• /
• pp.7-17
• /
• 2019

Machine learning is one of the most accurate techniques to predict and analyze various phenomena. K-means clustering is a kind of machine learning technique that classifies given data into clusters of similar data. Because it is desirable to perform an analysis based on a lot of data for better performance, K-means clustering can be performed in a model with a server that calculates the centroids of the clusters, and a number of clients that provide data to server. However, this model has the problem that if the clients' data are associated with private information, the server can infringe clients' privacy. In this paper, to solve this problem in a model with a number of clients, we propose a privacy-preserving K-means clustering method that can perform machine learning, concealing private information using homomorphic encryption.

• The Korean Journal of Applied Statistics
• /
• v.34 no.6
• /
• pp.905-922
• /
• 2021

Cluster analysis is one of unsupervised learning techniques used for discovering clusters when there is no prior knowledge of group membership. K-means, one of the commonly used cluster analysis techniques, may fail when the number of variables becomes large. In such high-dimensional cases, it is common to perform tandem analysis, K-means cluster analysis after reducing the number of variables using dimension reduction methods. However, there is no guarantee that the reduced dimension reveals the cluster structure properly. Principal component analysis may mask the structure of clusters, especially when there are large variances for variables that are not related to cluster structure. To overcome this, techniques that perform dimension reduction and cluster analysis simultaneously have been suggested. This study proposes probabilistic reduced K-means, the transition of reduced K-means (De Soete and Caroll, 1994) into a probabilistic framework. Simulation shows that the proposed method performs better than tandem clustering or clustering without any dimension reduction. When the number of the variables is larger than the number of samples in each cluster, probabilistic reduced K-means show better formation of clusters than non-probabilistic reduced K-means. In the application to a real data set, it revealed similar or better cluster structure compared to other methods.

• Research in Community and Public Health Nursing
• /
• v.16 no.4
• /
• pp.478-487
• /
• 2005

Purpose: This study was to examine the achievement rate of smoking cessation, to identify obstacles to smoking cessation, and to find means to achieve the goal of smoking cessation in college smokers. Method: This study was conducted from April 26th to September 13th 2004 and used a one-shot design. The subjects selected by convenient sampling were 29 college smokers who smoked over one cigarette a day, had a positive level of urine cotinine, participated in smoking cessation education 3 times. Thereafter, individual interaction was processed between the researcher and the subject using an interaction instrument. Data were analyzed based on frequencies.,percentages and means using SPSS/Win 10.0. Results: The achievement rate of smoking cessation was 20.7% (6 students). The biggest obstacles smoking cessation were smoking stimuli (29 students) and lack of control (25 students). Among detailed obstacles, the biggest one was smoking at regular times, which was followed by withdrawal symptoms, smoking on drinking, and company with other smokers. The most effective means of smoking cessation mentioned by the subjects were in order of avoiding drinking situations, taking deep breaths, and exercising. Conclusion: The results of this study, using King's theory, showed that individual interaction is effective in achieving smoking cessation. Therefore, it is suggested to make further study and broaden smoking cessation education for college smokers.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.8
• /
• pp.703-710
• /
• 2003

Because of their human-like synthesized speech quality, recently Corpus-Based Text-To-Speech(CB-TTS) have been actively studied worldwide. However, due to their large size speech database (DB), their application is very restricted. In this paper we propose and evaluate three DB reduction algorithms to which are designed to solve the above drawback. The first method is based on a K-means clustering approach, which selects k-representatives among multiple instances. The second method is keeping only those unit instances that are selected during synthesis, using a domain-restricted text as input to the synthesizer. The third method is a kind of hybrid approach of the above two methods and is using a large text as input in the system. After synthesizing the given sentences, the used unit instances and their occurrence information is extracted. As next step a modified K-means clustering is applied, which takes into account also the occurrence information of the selected unit instances, Finally we compare three pruning methods by evaluating the synthesized speech quality for the similar DB reduction rate, Based on perceptual listening tests, we concluded that the last method shows the best performance among three algorithms. More than this, the results show that the last method is able to reduce DB size without speech quality looses.

• Korean Journal of Remote Sensing
• /
• v.33 no.1
• /
• pp.89-95
• /
• 2017

Ship detection in synthetic aperture radar(SAR)imagery has long been an active research topic and has many applications. In this paper,we propose an efficient method for detecting ships from SAR imagery using filtering. This method exploits ship masking using a median filter that considers maximum ship sizes and detects ships from the reference image, to which a Non-Local means (NL-means) filter is applied for speckle de-noising and a differential image created from the difference between the reference image and the median filtered image. As the pixels of the ship in the SAR imagery have sufficiently higher values than the surrounding sea, the ship detection process is composed primarily of filtering based on this characteristic. The performance test for this method is validated using KOMPSAT-5 (Korea Multi-Purpose Satellite-5) SAR imagery. According to the accuracy assessment, the overall accuracy of the region that does not include land is 76.79%, and user accuracy is 71.31%. It is demonstrated that the proposed detection method is suitable to detect ships in SAR imagery and enables us to detect ships more easily and efficiently.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.1-7
• /
• 2015

This research is to develop a possible process to apply k-means clustering to an efficient vehicle routing process under time varying vehicle moving speeds. Time varying vehicle moving speeds are easy to find in metropolitan area. There is a big difference between the moving time requirements of two specific delivery points. Less delivery times are necessary if a delivery vehicle moves after or before rush hours. Various vehicle moving speeds make the efficient vehicle route search process extremely difficult to find even for near optimum routes due to the changes of required time between delivery points. Delivery area division is designed to simplify this complicated VRPs due to time various vehicle speeds. Certain divided area can be grouped into few adjacent divisions to assume that no vehicle speed change in each division. The vehicle speeds moving between two delivery points within this adjacent division can be assumed to be same. This indicates that it is possible to search optimum routes based upon the distance between two points as regular traveling salesman problems. This makes the complicated search process simple to attack since few local optimum routes can be found and then connects them to make a complete route. A possible method to divide area using k-means clustering is suggested and detailed examples are given with explanations in this paper. It is clear that the results obtained using the suggested process are more reasonable than other methods. The suggested area division process can be used to generate better area division promising improved vehicle route generations.

• Journal of Auto-vehicle Safety Association
• /
• v.13 no.3
• /
• pp.69-77
• /
• 2021

Although accident data from the National Police Agency and insurance companies do not know the vehicle safety, the damage level information can be obtained from the data managed by the bus credit association or the bus company itself. So the accident severity was analyzed based on the side impact accidents using accident repair cost. K-means clustering analysis separated the cost of accident repair into 'minor', 'moderate', 'severe', and 'very severe'. In addition, the side impact accident severity was analyzed by using an ordered logit model. As a result, it is appeared that the longer the repair period, the greater the impact on the severity of the side impact accident. Also, it is appeared that the higher the number of collision points, the greater the impact on the severity of the side impact accident. In addition, oblique collisions of the angle of impact were derived to affect the severity of the accident less than right angle collisions. Finally, the absence of opponent vehicle and large commercial vehicles involved accidents were shown to have less impact on the side impact accident severity than passenger cars.

• Smart Structures and Systems
• /
• v.15 no.3
• /
• pp.751-767
• /
• 2015

A new procedure is proposed for assessing probabilistic condition of structures considering effect of measured data uncertainty. In this procedure, multiple Finite Element (FE) models are identified by using weighting vectors that represent the uncertainty conditions of measured data. The distribution of structural parameters is analysed using a Principal Component Analysis (PCA) in relation to uncertainty conditions, and the identified models are classified into groups according to their similarity by using a K-means method. The condition of a structure is then assessed probabilistically using FE models in the classified groups, each of which represents specific uncertainty condition of measured data. Yeondae bridge, a steel-box girder expressway bridge in Korea, is used as an illustrative example. Probabilistic condition of the bridge is evaluated by the distribution of load rating factors obtained using multiple FE models. The numerical example shows that the proposed method can quantify uncertainty of measured data and subsequently evaluate efficiently the probabilistic condition of bridges.