• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.4
• /
• pp.203-210
• /
• 2017

Data clustering is one of the most difficult and challenging problems and can be formally considered as a particular kind of NP-hard grouping problems. The K-means algorithm is one of the most popular and widely used clustering method because it is easy to implement and very efficient. However, it has high possibility to trap in local optimum and high variation of solutions with different initials for the large data set. Therefore, we need study efficient computational intelligence method to find the global optimal solution in data clustering problem within limited computational time. The objective of this paper is to propose a combined artificial bee colony (CABC) with K-means for initialization and finalization to find optimal solution that is effective on data clustering optimization problem. The artificial bee colony (ABC) is an algorithm motivated by the intelligent behavior exhibited by honeybees when searching for food. The performance of ABC is better than or similar to other population-based algorithms with the added advantage of employing fewer control parameters. Our proposed CABC method is able to provide near optimal solution within reasonable time to balance the converged and diversified searches. In this paper, the experiment and analysis of clustering problems demonstrate that CABC is a competitive approach comparing to previous partitioning approaches in satisfactory results with respect to solution quality. We validate the performance of CABC using Iris, Wine, Glass, Vowel, and Cloud UCI machine learning repository datasets comparing to previous studies by experiment and analysis. Our proposed KABCK (K-means+ABC+K-means) is better than ABCK (ABC+K-means), KABC (K-means+ABC), ABC, and K-means in our simulations.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.141-148
• /
• 2010

In mobile terminal recommend service system has general information restrictive recommend that individuality considering to user's information find and recommend. Also it has difficult of accurate information recommend bad points user's not offer individuality information preference recommend service. Therefore this paper is propose user's information individuality preference considering by user's individuality preference recommendation system using improved k-means algorithm. Propose method is correlation coefficients using user's information individuality preference when user's individuality preference recommendation using improved k-means algorithm. Restrictive information recommend to fix a problem, information of restrictive general recommend that user's information individuality preference offer to accurate information recommend. Performance experiment is existing service system as compared to evaluating the effectiveness of precision and recall, performance experiment result is appear to precision 85%, recall 68%.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.43-50
• /
• 2010

Fuzzy c-means (FCM) and possibilistic c-means (PCM) are the two most well-known clustering algorithms in fuzzy clustering area, and have been applied in many applications in their original or modified forms. However, FCM's noise sensitivity problem and PCM's overlapping cluster problem are also well known. Recently there have been several attempts to combine both of them to mitigate the problems and possibilistic fuzzy c-means (PFCM) showed promising results. In this paper, we proposed a modified PFCM using regularization to reduce noise sensitivity in PFCM further. Regularization is a well-known technique to make a solution space smooth and an algorithm noise insensitive. The proposed algorithm, PFCM with regularization (PFCM-R), can take advantage of regularization and further reduce the effect of noise. Experimental results are given and show that the proposed method is better than the existing methods in noisy conditions.

• Communications for Statistical Applications and Methods
• /
• v.2 no.1
• /
• pp.176-184
• /
• 1995

In an exponential distribution, the properties of the interior and exterior trimmed means will be introduced, and reliability estimators using the two trimmed means will be compared with the UMVUE of reliability function through simulations.

• Communications for Statistical Applications and Methods
• /
• v.6 no.3
• /
• pp.659-666
• /
• 1999

In comparing two population means, the test statistic depends on the sample means and the variances, which are very sensitive to the extremely large or small values. This paper aims at examining the behavior of such observations using proper criterion which can measure the influence of them. We derive a computationally feasible statistic which can detect influential observations on the two-sample t-statistic.

• East Asian mathematical journal
• /
• v.37 no.3
• /
• pp.289-293
• /
• 2021

In this paper, we investigate the degree of approximation of a function f belonging to the generalized Zygmund class Zyg^ω(α, γ) by Cesaro means of its Fourier series.

• Journal of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.549-570
• /
• 2022

In this paper, we study the Birkhoff's ergodic theorem on geodesic metric spaces, especially on Hadamard spaces, using the notion of weighted inductive means. Also, we study a deterministic weighted sequence for the weighted Birkhoff's ergodic theorem in Hadamard spaces.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.1
• /
• pp.43-52
• /
• 2016

Due to the characteristics of microwave signals, Radar satellite image has been used for flood detection without weather and time influence. The more methods of flood detection were developed, the more detection rate of flood area has been increased. Since flood causes a lot of damages, flooded area should be distinguished from non flooded area. Also, the detection of flood area should be accurate. Therefore, not only image resolution but also the filtering process is critical to minimize resolution degradation. Although a resolution of radar images become better as technology develops, there were a limited focused on a highly suitable filtering methods for flood detection. Thus, the purpose of this study is to find out the most appropriate filtering method for flood detection by comparing three filtering methods: Lee filter, Frost filter and NL-means filter. Therefore, to compare the filters to detect floods, each filters are applied to the radar image. Comparison was drawn among filtered images. Then, the flood map, results of filtered images are compared in that order. As a result, Frost and NL-means filter are more effective in removing the speckle noise compared to Lee filter. In case of Frost filter, resolution degradation occurred severly during removal of the noise. In case of NL-means filter, shadow effect which could be one of the main reasons that causes false detection were not eliminated comparing to other filters. Nevertheless, result of NL-means filter shows the best detection rate because the number of shadow pixels is relatively low in entire image. Kappa coefficient is scored 0.81 for NL-means filtered image and 0.55, 0.64 and 0.74 follows for non filtered image, Lee filtered image and Frost filtered image respectively. Also, in the process of NL-means filter, speckle noise could be removed without resolution degradation. Accordingly, flooded area could be distinguished effectively from other area in NL-means filtered image.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.115-118
• /
• 1999

One of the typical methods to design a codebook is K-means algorithm. This algorithm has the drawbacks that converges to a locally optimal codebook and its performance is mainly decided by an initial codebook. D. Lee's method is almost same as the K-means algorithm except for a modification of a distance value. Those methods have a fixed distance value during all iterations. After many iterations. because the distance between new codevectors and old codevectors is much shorter than the distance in the early stage of iterations, the new codevectors are not affected by distance value. But new codevectors decided in the early stage of learning iterations are much affected by distance value. Therefore it is not appropriate to fix the distance value during all iterations. In this paper, we propose a new algorithm using each different distance value between codevectors for a limited iterations in the early stage of learning iteration. In the experiment, the result show that the proposed method can design better codebooks than the conventional K-means algorithms.

• 한국데이터정보과학회:학술대회논문집
• /
• 2003.10a
• /
• pp.249-258
• /
• 2003

K-means clustering has been widely used in many applications, such that pattern analysis or recognition, data analysis, image processing, market research and so on. It can identify dense and sparse regions among data attributes or object attributes. But k-means algorithm requires many hours to get k clusters that we want, because it is more primitive, explorative. In this paper we propose a new method of k-means clustering using the grid-based sample. It is more fast than any traditional clustering method and maintains its accuracy.