• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.345-350
• /
• 1999

The effectiveness of software error compensation for thermally induced machine tool errors relies on the prediction accuracy of the pre-established thermal error models. The selection of optimal sensor locations is the most important in establishing these empirical models. In this paper, a methodology for the selection of optimal sensor locations is proposed to establish a robust linear model which is not subjected to collinearity. Correlation coefficient and time delay are used as thermal parameters for optimal sensor location. Firstly, thermal deformation and temperatures are measured with machine tools being excited by sinusoidal heat input. And then, after correlation coefficient and time delays are calculated from the measured data, the optimal sensor location is selected through hard c-means clustering and sequential selection method. The validity of the proposed methodology is verified through the estimation of thermal expansion along Z-axis by spindle rotation.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.311-320
• /
• 2003

The Optimal filter yielding optimal texture feature separation is a most effective technique for extracting the texture objects from multiple textures images. But, most optimal filter design approaches are restricted to the issue of supervised problems. No full-unsupervised method is based on the recognition of texture objects in image. We propose a novel approach that uses unsupervised learning schemes for efficient texture image analysis, and the band-pass feature of Gabor-filter is used for the optimal filter design. In our approach, the self-organizing neural network for multiple texture image identification is based on block-based clustering. The optimal frequency of Gabor-filter is turned to the optimal frequency of the distinct texture in frequency domain by analyzing the spatial frequency. In order to show the performance of the designed filters, after we have attempted to build a various texture images. The texture objects extraction is achieved by using the designed Gabor-filter. Our experimental results show that the performance of the system is very successful.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.3D
• /
• pp.347-356
• /
• 2009

This paper is described clustering analysis of traffic characteristics-based highway classification in order to deviate from methodologies of existing highway functional classification. This research focuses on comparing the clustering techniques performance based on the total within-group errors and deriving the optimal number of cluster. This research analyzed statistical clustering method (Hierarchical Ward's minimum-variance method, Nonhierarchical K-means method) and Kohonen self-organizing maps clustering method for highway characteristic classification. The outcomes of cluster techniques compared for the number of samples and traffic characteristics from subsets derived by the optimal number of cluster. As a comprehensive result, the k-means method is superior result to other methods less than 12. For a cluster of more than 20, Kohonen self-organizing maps is the best result in the cluster method. The main contribution of this research is expected to use important the basic road attribution information that produced the highway characteristic classification.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.2
• /
• pp.92-98
• /
• 2017

Data clustering determines a group of patterns using similarity measure in a dataset and is one of the most important and difficult technique in data mining. Clustering can be formally considered as a particular kind of NP-hard grouping problem. K-means algorithm which is popular and efficient, is sensitive for initialization and has the possibility to be stuck in local optimum because of hill climbing clustering method. This method is also not computationally feasible in practice, especially for large datasets and large number of clusters. Therefore, we need a robust and efficient clustering algorithm to find the global optimum (not local optimum) especially when much data is collected from many IoT (Internet of Things) devices in these days. The objective of this paper is to propose new Hybrid Simulated Annealing (HSA) which is combined simulated annealing with K-means for non-hierarchical clustering of big data. Simulated annealing (SA) is useful for diversified search in large search space and K-means is useful for converged search in predetermined search space. Our proposed method can balance the intensification and diversification to find the global optimal solution in big data clustering. The performance of HSA is validated using Iris, Wine, Glass, and Vowel UCI machine learning repository datasets comparing to previous studies by experiment and analysis. Our proposed KSAK (K-means+SA+K-means) and SAK (SA+K-means) are better than KSA(K-means+SA), SA, and K-means in our simulations. Our method has significantly improved accuracy and efficiency to find the global optimal data clustering solution for complex, real time, and costly data mining process.

• Journal of Korean Society for Quality Management
• /
• v.18 no.1
• /
• pp.48-54
• /
• 1990

The purpose of this study is to design effective working systems which adapt to change in human needs by developing an method which forms into optimal groups using the measure of cohesion. Two main results can be derived from the study as follows : First, the clustering method based on the entropic measure of cohesion is predominant with respect to any other methods proposed in designing the work groups, since this clustering criterion includes symmetrical relations of total work groups and the dissimilarity as well as the similarity relations of predicate value, the clustering method based on this criterion is suitable for designing the new work structure. Second, total work group is clustered as the workers who have the equal predicate value and then clustering results are produced through the combinatorial agglomerative hierarchical clustering method. This clustering method present more economic results than the method that clustering the total work group do.

• Communications for Statistical Applications and Methods
• /
• v.25 no.3
• /
• pp.263-274
• /
• 2018

One of the common issues in large dataset analyses is to detect and construct homogeneous groups of objects in those datasets. This is typically done by some form of clustering technique. In this study, we present a divisive hierarchical clustering method for two monothetic characteristics of histogram data. Unlike classical data points, a histogram has internal variation of itself as well as location information. However, to find the optimal bipartition, existing divisive monothetic clustering methods for histogram data consider only location information as a monothetic characteristic and they cannot distinguish histograms with the same location but different internal variations. Thus, a divisive clustering method considering both location and internal variation of histograms is proposed in this study. The method has an advantage in interpreting clustering outcomes by providing binary questions for each split. The proposed clustering method is verified through a simulation study and applied to a large U.S. house property value dataset.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.79-86
• /
• 2009

In this paper, we propose a new clustering scheme that provides optimal data aggregation effect and reduces energy consumption of nodes by considering the density of nodes when forming clusters. Since the size of the cluster is determined to ensure optimal data aggregation rate, our scheme reduces transmission range and minimizes interference between clusters. Moreover, by clustering using locally adjacent nodes and aggregating data received from cluster members, we reduce energy consumption of nodes. Through simulation, we confirmed that energy consumption of the whole network is minimized and the sensor network life-time is extended. Moreover, we show that the proposed clustering scheme improves the performance of network compared to previous LEACH clustering scheme.

• Communications for Statistical Applications and Methods
• /
• v.6 no.1
• /
• pp.53-68
• /
• 1999

To improve the slow convergence property of the steepest ascent type algorithm for continuous D-optimal design problems. we develop a new algorithm. We apply the nonlinear system of equations as the necessary condition of optimality and develop the two-point algorithm that solves the problem of clustering. Because of the nature of the steepest coordinate ascent algorithm avoiding the problem of clustering itself helps the improvement of convergence speed. The numerical examples show the performances of the new method is better than those of various steepest ascent algorithms.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.45 no.3
• /
• pp.73-83
• /
• 2003

Methods of fuzzy C-means have been used to characterize geotechnical information from static cone penetration data. As contrary with traditional classification methods such as Robertson classification chart, the FCM expresses classes not conclusiveness but fuzzy. The results show that the FCM is useful to characterize ground information that can not be easily found by using normal classification chart. But optimal number of classes may not be easily defined. So, the optimal number of classes should be determined considering not only technical measures but engineering aspects.

• Communications for Statistical Applications and Methods
• /
• v.11 no.2
• /
• pp.369-380
• /
• 2004

Clustering algorithms with different similarity measures are commonly used to find an optimal clustering or close to original clustering. The recovery level of using Euclidean distance and distances transformed from correlation coefficients is evaluated and compared using Rand's (1971) C statistic. The C values present how the resultant clustering is close to the original clustering. In simulation study, the recovery level is improved by applying the correlation coefficients between objects. Using the data set from Spellman et al. (1998), the recovery levels with different similarity measures are also presented. In general, the recovery level of true clusters was increased by using the correlation coefficients.