• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.51-54
• /
• 2005

Clustering analysis is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. In this paper we propose a new algorithm for K-medoids clustering which runs like the K-means algorithm. The new algorithm calculates distance matrix once and uses it for finding new medoids at every iterative step. We evaluate the proposed method using real and synthetic data and compare with the results of other algorithms. The proposed algorithm takes reduced time in computation and better performance than others.

• KIISE Transactions on Computing Practices
• /
• v.21 no.7
• /
• pp.494-499
• /
• 2015

As the size of data increases, it becomes important to identify properties by analyzing big data. In this paper, we propose a k-Means based efficient clustering technique, called MCSKMeans (Multi centroid set k-Means), using distributed parallel processing framework MapReduce. A problem with the k-Means algorithm is that the accuracy of clustering depends on initial centroids created randomly. To alleviate this problem, the MCSK-Means algorithm reduces the dependency of initial centroids using sets consisting of k centroids. In addition, we apply the agglomerative hierarchical clustering technique for creating k centroids from centroids in m centroid sets which are the results of the clustering phase. In this paper, we implemented our MCSK-Means based on the MapReduce framework for processing big data efficiently.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.6-9
• /
• 2012

In this study, we compare two image denoising methods which are the Rudin-Osher-Fatemi total variation (TV) model and the nonlocal means (NLM) algorithm on medical images. To evaluate those methods, we used two well known measuring metrics. The methods are tested with a CT image, one X-Ray image, and three MRI images. Experimental result shows that the NML algorithm can give better results than the ROF TV model, but computational complexity is high.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.148-152
• /
• 1998

Gustafson and Kessel proposed a modified fuzzy c-Means algorithm based of the Mahalanobis distance. Though the algorithm appears more natural through the use of a fuzzy covariance matrix, it needs to calculate determinants and inverses of the c-fuzzy scatter matrices. This paper proposes a fuzzy clustering algorithm using pseudo mahalanobis distance, which is more easy to use and flexible than the Gustafson and Kessel's fuzzy c-Means.

• Journal of Korean Society for Quality Management
• /
• v.45 no.1
• /
• pp.25-38
• /
• 2017

Purpose: Hot strip rolling mill consists of a lot of mechanical and electrical units. In condition monitoring and diagnosis phase, various units could be failed with unknown reasons. In this study, we propose an effective method to detect early the units with abnormal status to minimize system downtime. Methods: The early warning problem with various units is defined. K-means and PAM algorithm with Euclidean and Manhattan distances were performed to detect the abnormal status. In addition, an performance of the proposed algorithm is investigated by field data analysis. Results: PAM with Manhattan distance(PAM_ManD) showed better results than K-means algorithm with Euclidean distance(K-means_ED). In addition, we could know from multivariate field data analysis that the system reliability of hot strip rolling mill can be increased by detecting early abnormal status. Conclusion: In this paper, clustering-based monitoring and fault detection algorithm using Manhattan distance is proposed. Experiments are performed to study the benefit of the PAM with Manhattan distance against the K-means with Euclidean distance.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.113-116
• /
• 1994

In this paper. we suggest new fuzzy modeling algorithm, which can be easily implemented, by combining HPC-MEANS Algorithm and Genetic Algorithm. HPC-MEANS used to cluster the sample data in input-output space will hyper planes and to make structure identification roughly and Genetic Algorithm is used to nine the premise and consequent parameters. For the validity of suggested methods we model the system with I/O data from known system. and then compare two systems.

• 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%.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.596-602
• /
• 2010

This paper proposes a computationally efficient learning-based super-resolution algorithm using k-means clustering. Conventional learning-based super-resolution requires a huge dictionary for reliable performance, which brings about a tremendous memory cost as well as a burdensome matching computation. In order to overcome this problem, the proposed algorithm significantly reduces the size of the trained dictionary by properly clustering similar patches at the learning phase. Experimental results show that the proposed algorithm provides superior visual quality to the conventional algorithms, while needing much less computational complexity.

• Journal of the Korean Society for Precision Engineering
• /
• v.24 no.4 s.193
• /
• pp.84-92
• /
• 2007

Dynamic process planning requires not only more flexible capabilities of a CAPP system but also higher utility of the generated process plans. In order to meet the requirements, this paper develops an algorithm that can select machines for the machining operations by calculating the machine loads. The developed algorithm is based on the multi-objective genetic algorithm that gives rise to a set of optimal solutions (in general, known as the Pareto-optimal solutions). The objective is to satisfy both the minimization number of part movements and the maximization of machine utilization. The algorithm is characterized by a new and efficient method for nondominated sorting through K-means algorithm, which can speed up the running time, as well as a method of two stages for genetic operations, which can maintain a diverse set of solutions. The performance of the algorithm is evaluated by comparing with another multiple objective genetic algorithm, called NSGA-II and branch and bound algorithm.

• KIEE International Transaction on Systems and Control
• /
• v.12D no.1
• /
• pp.17-26
• /
• 2002

In this paper, a new design methodology of the fuzzy controller is presented. The performance of the fuzzy controller is sensitive to the variety of scaling factors. The design procedure is based on evolutionary computing (more specifically, a genetic algorithm) and estimation algorithm to adjust and estimate scaling factors respectively. The tuning of the soiling factors of the fuzzy controller is essential to the entire optimization process. And then we estimate scaling factors of the fuzzy controller by means of two types of estimation algorithms such as HCM (Hard C-Means) and Neuro-Fuzzy model[7]. The validity and effectiveness of the proposed estimation algorithm for the fuzzy controller are demonstrated by the inverted pendulum system.