• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.83-93
• /
• 2012

This paper proposes an image segmentation framework that modifies the objective function of Fuzzy C-Means (FCM) to improve the performance and computational efficiency of the conventional FCM-based image segmentation. The proposed image segmentation framework includes a locally weighted fuzzy c-means (LWFCM) algorithm that takes into account the influence of neighboring pixels on the center pixel by assigning weights to the neighbors. Distance between a center pixel and a neighboring pixels are calculated within a window and these are basis for determining weights to indicate the importance of the memberships as well as to improve the clustering performance. We analyzed the segmentation performance of the proposed method by utilizing four eminent cluster validity functions such as partition coefficient ($V_{pc}$), partition entropy ($V_{pe}$), Xie-Bdni function ($V_{xb}$) and Fukuyama-Sugeno function ($V_{fs}$). Experimental results show that the proposed LWFCM outperforms other FCM algorithms (FCM, modified FCM, and spatial FCM, FCM with locally weighted information, fast generation FCM) in the cluster validity functions as well as both compactness and separation.

• Journal of the Korea Convergence Society
• /
• v.10 no.11
• /
• pp.159-164
• /
• 2019

Recent developments in ICT technology have increased interest in the care and health of pets such as dogs and cats. In this paper, cluster analysis was performed based on the component data of pet food to be used in various fields of the pet industry. For cluster analysis, the similarity was analyzed by analyzing the correlation between components of 300 dogs and cats in the market. In this paper, clustering techniques such as Hierarchical, K-Means, Partitioning around medoids (PAM), Density-based, Mean-Shift are clustered and analyzed. We also propose a personalized recommendation system for pets. The results of this paper can be used for personalized services such as feed recommendation system for pets.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.3
• /
• pp.127-136
• /
• 2024

This study explores the correlation between system anomalies and large-scale logs within the Spark cluster environment. While research on anomaly detection using logs is growing, there remains a limitation in adequately leveraging logs from various components of the cluster and considering the relationship between anomalies and the system. Therefore, this paper analyzes the distribution of normal and abnormal logs and explores the potential for anomaly detection based on the occurrence of log templates. By employing Hadoop and Spark, normal and abnormal log data are generated, and through t-SNE and K-means clustering, templates of abnormal logs in anomalous situations are identified to comprehend anomalies. Ultimately, unique log templates occurring only during abnormal situations are identified, thereby presenting the potential for anomaly detection.

• Journal of Internet Computing and Services
• /
• v.19 no.2
• /
• pp.17-26
• /
• 2018

Recently, through the emergence and convergence of Internet services, the unified Internet of thing(IoT) service platform have been researched. Currently, the IoT service is constructed as an independent system according to the purpose of the service provider, so information exchange and module reuse are impossible among similar services. In this paper, we propose a operation based service classification algorithm for various services in order to provide an environment of unfied Internet platform. In implementation, we classify and cluster more than 100 commercial IoT services. Based on this, we evaluated the performance of the proposed algorithm compared with the K-means algorithm. In order to prevent a single clustering due to the lack of sample groups, we re-cluster them using K-means algorithm. In future study, we will expand existing service sample groups and use the currently implemented classification system on Apache Spark for faster and more massive data processing.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.1
• /
• pp.175-184
• /
• 2007

LOD scores and a permutation test for detecting and locating quantitative trait loci (QTL) from the Hanwoo economic trait have been described and we selected a considerable major BMS1167 locus for further analysis. K-means clustering analysis, for the major DNA marker mining of BMS1167 microsatellite loci in Hanwoo chromosome17, has been tried and three cluster groups divide four traits. The three cluster groups are classified according to eight DNA marker bps. Finally, we employed the bootstrap test method to calculate confidence intervals using the resampling method to find major DNA markers. We conclude that the major marker of BMS1167 locus in Hanwoo chromosome17 is only DNA marker 100bp.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.1
• /
• pp.21-39
• /
• 2016

Although the demand for IT outsourcing (ITO) has increased recently because of the recent recession, concerns about business discontinuity in the transition phase cause companies to hesitate to adopt ITO. Therefore, a guideline to improve the prospects is needed. However, studies on the success factors of the transition phase in ITO are lacking. In this study, we develop an expert hierarchical value map (HVM) of the success of the transition phase in ITO by using cognition scientific methodologies. We empirically verify how success factors affect the success of the transition phase. Specifically, we derive an HVM of main stakeholders by using in-depth interviews and approaches, such as repertory grid technique (RGT) and laddering, based on means-end chain theory. We validate the success factors empirically through a bipolar analysis of RGT. Finally, we determine the most important cluster of success factors through cluster analysis.

• Proceedings of the Korean Institute of Surface Engineering Conference
• /
• 2015.11a
• /
• pp.242-243
• /
• 2015

Fault detection using optical emission spectra with modified K-means cluster analysis and principal component anal ysis are demonstrated for inductive coupl ed pl asma cl eaning processes. The optical emission spectra from optical emission spectroscopy (OES) are used for measurement. Furthermore, Principal component analysis and K-means cluster analysis algorithm is modified and applied to real-time detection and sensitivity enhancement for fluorocarbon cleaning processes. The proposed techniques show clear improvement of sensitivity and significant noise reduction when they are compared with single wavelength signals measured by OES. These techniques are expected to be applied to various plasma monitoring applications including fault detections as well as chamber cleaning endpoint detection.

• International Journal of Computer Science & Network Security
• /
• v.21 no.6
• /
• pp.237-244
• /
• 2021

Clustering is a most powerful un-supervised machine learning techniques for division of instances into homogenous group, which is called cluster. This Clustering is mainly used for generating a good quality of cluster through which we can discover hidden patterns and knowledge from the large datasets. It has huge application in different field like in medicine field, healthcare, gene-expression, image processing, agriculture, fraud detection, profitability analysis etc. The goal of this paper is to explore both hierarchical as well as partitioning clustering and understanding their problem with various approaches for their solution. Among different clustering K-means is better than other clustering due to its linear time complexity. Further this paper also focused on data mining that dealing with high-dimensional datasets with their problems and their existing approaches for their relevancy

• Journal of IKEEE
• /
• v.23 no.2
• /
• pp.419-424
• /
• 2019

The FCM algorithm finds the optimal solution through iterative optimization technique. In particular, there is a difference in execution time depending on the initial center of clustering, the location of noise, the location and number of crowded densities. However, this method gradually updates the center point, and the center of the initial cluster is shifted to one side. In this paper, we propose a TI-FCM(Triangular Inequality-Fuzzy C-Means) clustering algorithm that determines the cluster center density by maximizing the distance between clusters using triangular inequality. The proposed method is an effective method to converge to real clusters compared to FCM even in large data sets. Experiments show that execution time is reduced compared to existing FCM.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.5
• /
• pp.967-973
• /
• 2017

Clustering is one of the most well-known unsupervised learning methods that clusters data into homogeneous groups. Clustering has been used in various applications and FCM is one of the representative methods. In Fuzzy C-Means(FCM), however, cluster centers tend leaning to high density areas because the Euclidean distance measure forces high density clusters to make more contribution to clustering result. Previously proposed was density-independent clustering method, where cluster centers were made not to be close each other and relived the center deviation problem. Density-independent clustering method has a limitation that it is difficult to specify the position of the cluster centers. In this paper, an enhanced density-independent clustering method with an additional term that makes cluster centers to be placed around dense region is proposed. The proposed method converges more to real centers compared to FCM and density-independent clustering, which can be verified with experimental results.