• Journal of Industrial Technology
• /
• v.28 no.A
• /
• pp.185-189
• /
• 2008

Practical pattern recognition systems should overcome very large class problem. Sometimes it is almost impossible to build every model for every class due to memory and time constraints. For this case, grouping similar models will be helpful. In this paper, we propose GMC(Group Model Clustering) to build a large class Chinese character recognition system. We built hidden Markov models for 10% of total classes, then classify the rest of classes into already trained group classes. Finally group models are trained using group model clustered data. Recognition is performed using only group models, in order to achieve reduced model size and improved recognition speed.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.4991-4996
• /
• 2010

Clustering method in wireless sensor network is the technique that forms the cluster to aggregate the data and transmit them at the same time that they can use the energy efficiently. Even though cluster group model is based on clustering, it differs from previous method that reducing the total energy consumption by separating energy overload to cluster group head and cluster head. In this thesis, I calculate the optimal cluster group number and cluster number in this kind of cluster group model according to threshold of energy consumption model. By using that I can minimize the total energy consumption in sensor network and maximize the network lifetime. I also show that proposed cluster group model is better than previous clustering method at the point of network energy efficiency.

• Journal of Korean Library and Information Science Society
• /
• v.40 no.2
• /
• pp.491-514
• /
• 2009

The supply of public libraries in Korea has been rapidly improving because of the recent increase for cultural demands and revitalization of the local culture. This paper aims to analyze the efficiency about 565 public libraries using Clustering DEA/AHP(CDA) model. This model is employed the efficiency analysis in order to incorporate project irreversibility and division due to the limit of resources spending. The results shows that the public libraries are divided into three groups which are large size libraries(Group 1), middle size libraries(Group 2) and small size libraries(Group 3). Their average efficiency was found as 0.89, 0.72 and 0.60 each.

• Communications for Statistical Applications and Methods
• /
• v.29 no.6
• /
• pp.695-708
• /
• 2022

Recently, several studies have been conducted using state space model. In this study, a dynamic linear model with state space model form is applied to stock data. The monthly returns for 135 Korean stocks are fitted to a dynamic linear model, to obtain an estimate of the time-varying 𝛽-coefficient time-series. The model formula used for the return is a capital asset pricing model formula explained in economics. In particular, the transition equation of the state space model form is appropriately modified to satisfy the assumptions of the error term. k-shape clustering is performed to classify the 135 estimated 𝛽 time-series into several groups. As a result of the clustering, four clusters are obtained, each consisting of approximately 30 stocks. It is found that the distribution is different for each group, so that it is well grouped to have its own characteristics. In addition, a common pattern is observed for each group, which could be interpreted appropriately.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.6
• /
• pp.2815-2822
• /
• 2011

Clustering method in wireless sensor networks is the technique that forms the cluster to aggregate the data and transmit them at the same time that they can use the energy efficiently. In this paper, I propose the hierarchical unequal clustering method using cluster group model. This divides the entire network into two layers. The data aggregated from layer 2 consisted of cluster group is sent to layer 1, after re-aggregation the total data is sent to base station. This method decreases whole energy consumption by using cluster group model with multi-hop communication architecture. Hot spot problem can be solved by establishing unequal cluster. I also show that proposed hierarchical unequal clustering method is better than previous clustering method at the point of network energy efficiency.

• Earthquakes and Structures
• /
• v.23 no.6
• /
• pp.549-580
• /
• 2022

This paper assesses the influences of modeling assumptions and uncertainties on the performance of the non-linear finite element (FE) model updating procedure and model clustering method. The results of a shaking table test on a four-story steel moment-resisting frame are employed for both calibrations and clustering of the FE models. In the first part, simple to detailed non-linear FE models of the test frame is calibrated to minimize the difference between the various data features of the models and the structure. To investigate the effect of the specified data feature, four of which include the acceleration, displacement, hysteretic energy, and instantaneous features of responses, have been considered. In the last part of the work, a model-based clustering approach to group models of a four-story frame with similar behavior is introduced to detect abnormal ones. The approach is a composition of property derivation, outlier removal based on k-Nearest neighbors, and a K-means clustering approach using specified data features. The clustering results showed correlations among similar models. Moreover, it also helped to detect the best strategy for modeling different structural components.

• Journal of Korea Port Economic Association
• /
• v.29 no.1
• /
• pp.143-175
• /
• 2013

The purpose of this paper is to show the clustering trend by using the variable group benchmarking(VGB) and categorical variable(CV) models for 38 Asian ports during 9 years(2001-2009) with 4 inputs(birth length, depth, total area, and number of crane) and 1 output(container TEU). The main empirical results of this paper are as follows. First, clustering results by using VGB show that Shanghai, Qingdao, and Ningbo ports took the core role for clustering. Second, CV analysis focusing on the container throughputs indicated that Singapore, Keelong, Dubai, and Kaosiung ports except Chinese ports are appeared as the center ports of clustering. Third, Aqaba, Dubai, Hongkong, Shanghai, Guangzhou, and Ningbo ports are recommended as the efficient ports for the target of clustering. Fourth, when the ports are classified by the regional location, Dubai, Khor Fakkan, Shanghai, Hongkong, Keelong, Ningbo, and Singapore ports are the core ports for clustering. On the whole, other ports located in Asia should be clustered to Dubai, Khor Fakkan, Shanghai, Hongkong, Ningbo, and Singapore ports. The policy implication of this paper is that Korean port policy planner should introduce the VGB model, and CV model for clustering among the international ports for enhancing the efficiency of inputs and outputs.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.2
• /
• pp.160-166
• /
• 2002

In this paper, we implement a new vocabulary-independent speech recognition system that uses CV, VCCV, VC recognition unit. Since these recognition units are extracted in the trowel region of syllable, the segmentation is easy and robust. And in the case of not existing VCCV unit, the units are replaced by combining VC and CV semi-syllable model. Clustering of vowel group and applying combination rule to the substitution model in the case of not existing of VCCV model lead to 5.2% recognition performance improvement from 90.4% (Model A) to 95.6% (Model C) in the first candidate. The recognition results that is 98.8% recognition rate in the second candidate confirm the effectiveness of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.11
• /
• pp.3913-3934
• /
• 2021

Real-time prediction of Web service of quality (QoS) provides more convenience for web services in cloud environment, but real-time QoS prediction faces severe challenges, especially under the cold-start situation. Existing literatures of real-time QoS predicting ignore that the QoS of a user/service is related to the QoS of other users/services. For example, users/services belonging to the same group of category will have similar QoS values. All of the methods ignore the group relationship because of the complexity of the model. Based on this, we propose a real-time Matrix Factorization based Clustering model (MFC), which uses category information as a new regularization term of the loss function. Specifically, in order to meet the real-time characteristic of the real-time prediction model, and to minimize the complexity of the model, we first map the QoS values of a large number of users/services to a lower-dimensional space by the PCA method, and then use the K-means algorithm calculates user/service category information, and use the average result to obtain a stable final clustering result. Extensive experiments on real-word datasets demonstrate that MFC outperforms other state-of-the-art prediction algorithms.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.555-576
• /
• 2016

In the conventional clustering algorithms, an object could be assigned to only one group. However, this is sometimes not the case in reality, there are cases where the data do not belong to one group. As against, the fuzzy clustering takes into consideration the degree of fuzzy membership of each pixel relative to different classes. In order to overcome some shortcoming with traditional clustering methods, such as slow convergence and their sensitivity to initialization values, we have used the Harmony Search algorithm. It is based on the population metaheuristic algorithm, imitating the musical improvisation process. The major thrust of this algorithm lies in its ability to integrate the key components of population-based methods and local search-based methods in a simple optimization model. We propose in this paper a new unsupervised clustering method called the Fuzzy Harmony Search-Fourier Transform (FHS-FT). It is based on hybridization fuzzy clustering and the harmony search algorithm to increase its exploitation process and to further improve the generated solution, while the Fourier transform to increase the size of the image's data. The results show that the proposed method is able to provide viable solutions as compared to previous work.