• The Korean Journal of Applied Statistics
• /
• v.24 no.6
• /
• pp.1077-1094
• /
• 2011

We accomplish clustering analyses for yeast cell cycle microarray expression data. To reflect the characteristics of a time-course data, we screen the genes using the test statistics with Fourier coefficients applying a FDR procedure. We compare the results done by model-based clustering, K-means, PAM, SOM, hierarchical Ward method and Fuzzy method with the yeast data. As the validity measure for clustering results, connectivity, Dunn index and silhouette values are computed and compared. A biological interpretation with GO analysis is also included.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.56-63
• /
• 2015

Several fields of science have demanded large-scale workflow support, which requires thousands of CPU cores or more. In order to support such large-scale scientific workflows, high capacity parallel systems such as supercomputers are widely used. In order to increase the utilization of these systems, most schedulers use backfilling policy: Small jobs are moved ahead to fill in holes in the schedule when large jobs do not delay. Since an estimate of the runtime is necessary for backfilling, most parallel systems use user's estimated runtime. However, it is found to be extremely inaccurate because users overestimate their jobs. Therefore, in this paper, we propose a novel system for the runtime prediction based on workload-aware clustering with the goal of improving prediction performance. The proposed method for runtime prediction of parallel applications consists of three main phases. First, a feature selection based on factor analysis is performed to identify important input features. Then, it performs a clustering analysis of history data based on self-organizing map which is followed by hierarchical clustering for finding the clustering boundaries from the weight vectors. Finally, prediction models are constructed using support vector regression with the clustered workload data. Multiple prediction models for each clustered data pattern can reduce the error rate compared with a single model for the whole data pattern. In the experiments, we use workload logs on parallel systems (i.e., iPSC, LANL-CM5, SDSC-Par95, SDSC-Par96, and CTC-SP2) to evaluate the effectiveness of our approach. Comparing with other techniques, experimental results show that the proposed method improves the accuracy up to 69.08%.

• The Plant Pathology Journal
• /
• v.34 no.6
• /
• pp.544-554
• /
• 2018

Tomato (Solanum lycopersicum) production in Ghana is limited by the root-knot nematode (Meloidogyne incognita, and yield losses over 70% have been experienced in farmer fields. Major management strategies of the root-knot nematode (RKN), such as rotation and nematicide application, and crop rotation are either little efficient and harmful to environments, with high control cost, respectively. Therefore, this study aims to examine morphometric variations of RKN populations in Ghana, using principal component analysis (PCA), of which the information can be utilized for the development of tomato cultivars resistant to RKN. Ninety (90) second-stage juveniles (J2) and 16 adult males of M. incognita were morphometrically characterized. Six and five morphometric variables were measured for adult males and second-stage juveniles (J2) respectively. Morphological measurements showed differences among the adult males and second-stage juveniles (J2). A plot of PC1 and PC2 for M. incognita male populations showed clustering into three main groups. Populations from Asuosu and Afrancho (Group I) were more closely related compared to populations from Tuobodom and Vea (Group II). There was however a single nematode from Afrancho (AF4) that fell into Group III. Biplots for male populations indicate, body length, DEGO, greatest body width, and gubernaculum length serving as variables distinguishing Group 1 and Group 2 populations. These same groupings from the PCA were reflected in the dendogram generated using Agglomerative Hierarchical Clustering (AHC). This study provides the first report on morphometric characterisation of M. incognita male and juvenile populations in Ghana showing significant morphological variation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.1040-1057
• /
• 2014

In this paper, a new bit rate estimation scheme is proposed to determine the bit rate for each subclass in an MPEG-2 TS to H.264/AVC transcoder after dividing an input MPEG-2 TS sequence into several subclasses. Video format transcoding in conventional IPTV and Smart TV services is a time-consuming process since the input sequence should be fully transcoded several times with different bit-rates to decide the bit-rate suitable for a service. The proposed scheme can automatically decide the bit-rate for the transcoded video sequence in those services which can be stored on a video streaming server as small as possible without losing any subject quality loss. In the proposed scheme, an input sequence to the transcoder is sub-classified by hierarchical clustering using a parameter value extracted from each frame. The candidate frames of each subclass are used to estimate the bit rate using a statistical analysis and a mathematical model. Experimental results show that the proposed scheme reduces the bit rate by, on an average approximately 52% in low-complexity video and 6% in high-complexity video with negligible degradation in subjective quality.

• The Korea Journal of Herbology
• /
• v.31 no.3
• /
• pp.29-35
• /
• 2016

Objectives : Ijung-tang (IJT) is a traditional herbal formula and has been used to treat digestive diseases such as abdominal pain, vomiting, and diarrhea. IJT consists of four herbal medicines, Ginseng radix, Atractylodis rhizoma alba, Zingiberis rhizoma, and Glycyrrhizae radix et rhizoma, containing various bioactive compounds. Quality assesment of IJT preparations was performed by analytical method for determining marker compounds.Methods : Determination of seven marker compounds in IJT preparations was quantitatively conducted by high-performance liquid chromatography equipped with a diode-array detector. The marker compounds were separated on a reversed-phase C18 column and the analytical method was successfully validated. Chemometric analysis was performed to compare IJT water extracts and commercial IJT granules.Results : Limit of detection and limit of quantification values were in the ranges of 0.093-2.649 μg/mL and 0.283-8.027 μg/mL, respectively. Precisions were 0.30-3.87% within a day and 0.23-2.35% over three consecutive days. Recoveries of the marker compounds ranged from 87.35-107.05%, with relative standard deviation (RSD) values < 6.15%. Repeatabilities were < 1.20% and < 1.71% of RSD value for retention time and absolute peak area, respectively. The results from quantitative analysis showed that the quantities of seven marker compounds of IJT samples varied, as were found in principal component analysis and hierarchical clustering analysis.Conclusions : The analytical method developed in the present study was precise and reliable to simultaneously determine marker compounds of IJT. Therefore, it can be used for the quality assessment of IJT preparations.

• 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 Korea Port Economic Association
• /
• v.34 no.3
• /
• pp.17-52
• /
• 2018

The purpose of this paper is to measure the clustering change and analyze empirical results. Additionally, by using k-means, hierarchical, and mixed models on Asian container ports over the period 2006-2015, the study aims to form a cluster comprising Busan, Incheon, and Gwangyang ports. The models consider the number of cranes, depth, birth length, and total area as inputs and container twenty-foot equivalent units(TEU) as output. Following are the main empirical results. First, ranking order according to the increasing ratio during the 10 years analysis shows that the value for average linkage(AL), mixed ward, rule of thumb(RT)& elbow, ward, and mixed AL are 42.04% up, 35.01% up, 30.47%up, and 23.65% up, respectively. Second, according to the RT and elbow models, the three Korean ports can be clustered with Asian ports in the following manner: Busan Port(Hong Kong, Guangzhou, Qingdao, and Singapore), Incheon Port(Tokyo, Nagoya, Osaka, Manila, and Bangkok), and Gwangyang Port(Gungzhou, Ningbo, Qingdao, and Kasiung). Third, optimal clustering numbers are as follows: AL(6), Mixed Ward(5), RT&elbow(4), Ward(5), and Mixed AL(6). Fourth, empirical clustering results match with those of questionnaire-Busan Port(80%), Incheon Port(17%), and Gwangyang Port(50%). The policy implication is that related parties of Korean seaports should introduce port improvement plans like the benchmarking of clustered seaports.

• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.189-194
• /
• 2017

In this study, we propose a method which is based on "Image segmentation by histogram thresholding using hierarchical cluster analysis"/HCA/ and "A nonparametric approach for histogram segmentation"/NHS/. HCA method uses that all histogram bins are one cluster then it reduces cluster numbers by using distance metric. Because this method has too many clusters, it is more computation. In order to eliminate disadvantages of "HCA" method, we used "NHS" method. NHS method finds all local minima of histogram. To reduce cluster number, we use NHS method which is fast. In our approach, we combine those two methods to eliminate disadvantages of Arifin method. The proposed method is not only less computational than "HCA" method because combined method has few clusters but also it uses local minima of histogram which is computed by "NHS".

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.5
• /
• pp.941-949
• /
• 2011

In this paper, 72 weather stations in Korea are clustered by the hierarchical agglomerative procedure based on the average linkage method. We compare our clusters and stations divided by mountain chains which are applied to study on the impact analysis of foodborne disease outbreak due to climate change.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.65-65
• /
• 2002

In remote sensing, images are acquired over the same area by sensors of different spectral ranges (from the visible to the microwave) and/or with different number, position, and width of spectral bands. These images are generally partially redundant, as they represent the same scene, and partially complementary. For many applications of image classification, the information provided by a single sensor is often incomplete or imprecise resulting in misclassification. Fusion with redundant data can draw more consistent inferences for the interpretation of the scene, and can then improve classification accuracy. The common approach to the classification of multisensor data as a data fusion scheme at pixel level is to concatenate the data into one vector as if they were measurements from a single sensor. The multiband data acquired by a single multispectral sensor or by two or more different sensors are not completely independent, and a certain degree of informative overlap may exist between the observation spaces of the different bands. This dependence may make the data less informative and should be properly modeled in the analysis so that its effect can be eliminated. For modeling and eliminating the effect of such dependence, this study employs a strategy using self and conditional information variation measures. The self information variation reflects the self certainty of the individual bands, while the conditional information variation reflects the degree of dependence of the different bands. One data set might be very less reliable than others in the analysis and even exacerbate the classification results. The unreliable data set should be excluded in the analysis. To account for this, the self information variation is utilized to measure the degrees of reliability. The team of positively dependent bands can gather more information jointly than the team of independent ones. But, when bands are negatively dependent, the combined analysis of these bands may give worse information. Using the conditional information variation measure, the multiband data are split into two or more subsets according the dependence between the bands. Each subsets are classified separately, and a data fusion scheme at decision level is applied to integrate the individual classification results. In this study. a two-level algorithm using hierarchical clustering procedure is used for unsupervised image classification. Hierarchical clustering algorithm is based on similarity measures between all pairs of candidates being considered for merging. In the first level, the image is partitioned as any number of regions which are sets of spatially contiguous pixels so that no union of adjacent regions is statistically uniform. The regions resulted from the low level are clustered into a parsimonious number of groups according to their statistical characteristics. The algorithm has been applied to satellite multispectral data and airbone SAR data.