• Journal of Intelligence and Information Systems
• /
• v.15 no.4
• /
• pp.37-51
• /
• 2009

One of the critical issues in the management of manufacturing companies is the efficient process of planning and operating service resources such as human, parts, and facilities, and it begins with the accurate service demand forecasting. In this research, service and sales data from the LCD monitor manufacturer is considered for an empirical study on Product Life Cycle (PLC) based service demand forecasting. The proposed PLC forecasting approach consists of four steps : understanding the basic statistics of data, clustering models using a self-organizing map, developing respective forecasting models for each segment, comparing the accuracy performance. Empirical experiments show that the PLC approach outperformed the traditional approaches in terms of root mean square error and mean absolute percentage error.

• Journal of KIISE:Software and Applications
• /
• v.27 no.4
• /
• pp.422-431
• /
• 2000

This paper proposes a new codebook generation method, called a PCA-Based VQ, that incorporates the PCA (Principal Component Analysis) technique into VQ (Vector Quantization) codebook design. The PCA technique reduces the data dimensions by transforming input image vectors into the feature vectors. The cluster of feature vectors in the transformed domain is bisectioned into two subclusters by an optimally chosen partitioning hyperplane. We expedite the searching of the optimal partitioning hyperplane that is the most time consuming process by considering that (1) the optimal partitioning hyperplane is perpendicular to the first principal axis of the feature vectors, (2) it is located on the equilibrium point of the left and right cluster's distortions, and (3) the left and right cluster's distortions can be adjusted incrementally. This principal axis bisectioning is successively performed on the cluster whose difference of distortion between before and after bisection is the maximum among the existing clusters until the total distortion of clusters becomes as small as the desired level. Simulation results show that the proposed PCA-based VQ method is promising because its reconstruction performance is as good as that of the SOFM (Self-Organizing Feature Maps) method and its codebook generation is as fast as that of the K-means method.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2007.11a
• /
• pp.203-204
• /
• 2007

This paper investigated the influence on partial discharge distribution of various defects at the model power cable joints interface using K-means clustering. As the result of analyzing discharge number distribution of ${\Phi}-n$ cluster, clusters shifted to $0^{\circ}\;and\;180^{\circ}$ with increasing applying voltage. It was confirmed that discharge quantity and euclidean distance between centroids were increased with applying voltage from the analyzing centroid distribution of ${\Phi}-q$ cluster. The degree of dispersion was increased with calculating standard deviation of ${\Phi}-q$ cluster centroid. The tendency both number of discharge and mean value of ${\Phi}-q$ cluster centroid were some different with defect types.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.29 no.1
• /
• pp.58-61
• /
• 2016

Degradation in power cables used in distribution lines to the material of the wire, manufacturing method, but also the line of the environment, generates a variety of degradation depending upon the type of load. The local wire deterioration weighted wire breakage accident can occur frequently, causing significant proprietary damage can lead to accidents and precious. In this study, the signal detected by the eddy current aim to develop algorithms capable of determining the signals for the top part and at least part of the signal by using a signal processing technique called K-means algorithm.

• Korean Journal of Ecology and Environment
• /
• v.52 no.4
• /
• pp.285-292
• /
• 2019

Our study was based on the long-term surveys with respect to the major reservoirs located in the Yeongsan and Seomjin river basins. A total of 45 survey sites have been surveyed four times a year from 2008 to 2017. We identified 166 zooplankton species, including 127 rotifers, 26 cladocerans, and 13 copepods. Mean population density and species number of small reservoirs were higher than those of mid and large reservoirs. Considering outliers exceeding the 90th percentile between species occupancy and mean abundance, 10 of 11 habitat generalists were rotifers, and Bosmina longirostris was the only cladoceran. Habitat specialist consisted of three species of rotifers and emerged from one to three survey sites. According to the modularity results, it was found that the survey sites covering the entire river basins were characterized into five groups, which was similar to the classification by maximum water surface areas(MWSA). The result of the eigenvector centrality showed that the size of MWSA had a greater impact on the similarity of zooplankton community structure between reservoirs than the difference in distance between reservoirs. In the case of survey points in near dam or estuary bank of Juam and Youngsan reservoirs, modularity class were separated from other internal survey points of those. Given that the zooplankton interactions may contribute to freshwater functions more than species diversity. These topological features provide new insight into studying zooplankton distribution patterns, their organization and impacts on freshwater-associated function.

• Journal of IKEEE
• /
• v.15 no.3
• /
• pp.191-197
• /
• 2011

An image segmentation model using fuzzy c-means with intuition (FCM-I) model is proposed for the segmentation of magnetic resonance image in this paper. In FCM-I, a measurement called intuition level is adopted so that the intuition level helps to alleviate the effect of noises. A practical magnetic resonance image data set is used for image segmentation experiment and the performance is compared with those of some conventional algorithms. Results show that the segmentation method based on FCM-I compares favorably to several conventional clustering algorithms. Since FCM-I produces cluster prototypes less sensitive to noises and to the selection of involved parameters than the other algorithms, FCM-I is a good candidate for image segmentation problems.

• Proceedings of the KSPS conference
• /
• 2007.05a
• /
• pp.33-36
• /
• 2007

In this paper, we investigate a fast speaker adaptation method based on eigenvoice in several noisy environments. In order to overcome its weakness against noise, we propose a noisy environment clustering method which divides the noisy adaptation utterances into utterance groups with similar environments by the vector quantization based clustering using a cepstral mean as a feature vector. Then each utterance group is used for adaptation to make an environment dependent model. According to our experiment, we obtained 19-37 % relative improvement in error rate compared with the simultaneous speaker adaptation and environmental compensation method

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.61-69
• /
• 2011

This paper proposes a new algorithm that improve color component of compensated image using Retinex method for back-light image. A back-light image has two regions, one of the region is too bright and the other one is too dark. If an back-light image is improved contrast using Retinex method, it loses color information in the part of brightness of the image. In order to make up loss information, proposed algorithm adds color components from original image. The histogram can be divided three parts that brightness, darkness, midway using K-mean (k=3) algorithm. For the brightness, it is used color information of the original image. For the darkness, it is converted using by Retinex method. The midway region is mixed between original image and Retinex result image in the ratio of histogram. The ratio is determined by distance from dark area. The proposed algorithm was tested on nature back-light images to evaluate performance, and the experimental result shows that proposed algorithm is more robust than original Retinex algorithm.

• The Journal of the Korea Contents Association
• /
• v.7 no.10
• /
• pp.19-26
• /
• 2007

Since collaborative filtering has used the nearest-neighborhood method based on item preference it cannot only reflect exact contents but also has the problem of sparsity and scalability. The item-based collaborative filtering has been practically used improve these problems. However it still does not reflect attributes of the item. In this paper, we propose the method of associative group using the FP-Tree to solve the problem of existing recommendation system. The proposed makes frequent item and creates association rule by using FP-Tree without occurrence of candidate set. We made the efficient item group using $\alpha-cut$ according to the confidence of the association rule. To estimate the performance, the suggested method is compared with Gibbs Sampling, Expectation Maximization, and K-means in the MovieLens dataset.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.4
• /
• pp.301-307
• /
• 2016

This paper proposes a lyric search method to consider the characteristics of the user query. According to the fact that queries for the lyric search are derived from highlight parts of the music, this paper uses the hierarchical agglomerative clustering to find the highlight and proposes a Gaussian weighting to consider the neighbor of the highlight as well as highlight. By setting the mean of a Gaussian weighting at the highlight, this weighting function has higher weights near the highlight and the lower weights far from the highlight. Then, this paper constructs a index of lyrics with the gaussian weighting. According to the experimental results on a data set obtained from 5 real users, the proposed method is proved to be effective.