• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.83-88
• /
• 2013

This paper proposes a recommending system of the similar blogs gathered with similarities between blogs according to the similarity, dividing words, for each frequency, that individual blogs have. It improved the algorithm of k-means, using the model of the habits of white ants for better performance of clustering, and showed better performance of clustering as a result of evaluating and comparing with the existing algorithm of k-means as the improved algorithm. The recommending system of similar blog was designed and embodied, using the improved algorithm. TCA can reduce clustering time and the number of moving time for clustering compare with K-means algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.11
• /
• pp.2102-2107
• /
• 2008

This paper demonstrates a enhanced FCM to identify the causes of ground faults in power distribution systems. The discrimination scheme which can automatically recognize the fault causes is proposed using Fuzzy RBF networks. By using the actual fault data, it is shown that the proposed method provides satisfactory results for identifying the fault causes.

• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.1
• /
• pp.23-26
• /
• 2005

This paper describes the algorithm for deciding the status of the operating machines in the power plants. It is very important to decide whether the status of the operating machines is good or not in the industry to protect the accidents of machines and improve the operation efficiency of the plants. There are two steps to analyze the status of the running machines. First, we extract the features from the input original data. Second, we classify those features into normal/abnormal condition of the machines using the wavelet transform and the input RMS vector through the K-means algorithm. In this paper we developed the algorithm to detect the fault operation using the K-means method from the sound of the operating machines.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.491-493
• /
• 2011

Traffic sign detection is the domain of automatic driver assistant systems. There are literatures for traffic sign detection using color information, however, color-based method contains ill-posed condition and to extract the region of interest is difficult. In our work, we propose a method for traffic sign detection using k-means clustering method, back-propagation neural network, and projection histogram features that yields the robustness for ill-posed condition. Using the color information of traffic signs enables k-means algorithm to cluster the region of interest for the detection efficiently. In each step of clustering, a cluster is verified by the neural network so that the cluster exactly represents the location of a traffic sign. Proposed method is practical, and yields robustness for the unexpected region of interest or for multiple detections.

• Journal of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.503-520
• /
• 2023

In this paper, using the theory of majorization, we discuss the Schur m power convexity for L-conjugate means of n variables and the Schur convexity for weighted L-conjugate means of n variables. As applications, we get several inequalities of general mean satisfying Schur convexity, and a few comparative inequalities about n variables Gini mean are established.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.4
• /
• pp.853-861
• /
• 2003

An improved K-means document clustering method has been presented, where a concept vector is manipulated for each cluster on the basis of cosine similarity of text documents. The concept vectors are unit vectors that have been normalized on the n-dimensional sphere. Because the standard K-means method is sensitive to initial starting condition, our improvement focused on starting condition for estimating the modes of a distribution. The improved K-means clustering algorithm has been applied to a set of text documents, called Classic3, to test and prove efficiency and correctness of clustering result, and showed 7% improvements in its worst case.

• Journal of information and communication convergence engineering
• /
• v.6 no.4
• /
• pp.434-438
• /
• 2008

Massive data are continuously produced with a data rate of over several terabytes every day. These applications need effective clustering algorithms to achieve an overall high performance computation. In this paper, we propose ancestor as cluster center based approach to clustering, the K-means algorithm using ancestor. We modify the K-means algorithm. We present a clustering architecture and a clustering algorithm that minimize of I/Os and show a performance with excellent. In our experimental performance evaluation, we present that our algorithm can improve the I/O speed and the query processing time.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.2
• /
• pp.167-172
• /
• 2007

Long gene sequences and their products have been studied by many methods. The use of DNA(Deoxyribonucleic acid) microarray technology has resulted in an enormous amount of data, which has been difficult to analyze using typical research methods. This paper proposes that mass data be analyzed using division clustering with the K-means clustering algorithm. To demonstrate the superiority of the proposed method, it was used to analyze the microarray data from rice DNA. The results were compared to those of the existing K-meansmethod establishing that the proposed method is more useful in spite of the effective reduction of performance time.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.19 no.4
• /
• pp.1-11
• /
• 2023

Clustering analysis is used in various fields including customer segmentation and clustering methods such as k-means are actively applied in the credit card customer segmentation. In this paper, we summarized the input features selection method of k-means clustering for the case of the credit card customer segmentation problem, and evaluated its feasibility through the analysis results. By using the label values of k-means clustering results as target features of a decision tree classification, we composed a method for prioritizing input features using the information gain of the branch. It is not easy to determine effectiveness with the clustering effectiveness index, but in the case of the CH index, cluster effectiveness is improved evidently in the method presented in this paper compared to the case of randomly determining priorities. The suggested method can be used for effectiveness of actively used clustering analysis including k-means method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.3
• /
• pp.205-209
• /
• 2004

The K-means algorithm is the most widely used method among the codebook generation algorithms in vector quantization. In this paper, we propose a codebook generation algorithm using a new updating condition to enhance the codebook performance. The conventional K-means algorithm uses a fixed weight of the distance for all training iterations, but the proposed method uses different weights according to the updating condition from the new codevectors for training iterations. Then, different weights can be applied to generate codevectors at each iteration according to this condition, and it can have a similar effect to variable weights. Experimental results show that the proposed algorithm has the better codebook performance than that of K-means algorithm.