• Proceedings of the Korean Statistical Society Conference
• /
• 2002.11a
• /
• pp.293-298
• /
• 2002

We propose an improved version of Kim (2000) to the effect that in principle we may deal with a graphical model of any size. Kim (2000) proposed a method of estimating parameters for a model of categorical variables which is too large to handle as a single model. We applied the proposed method to a simulated data of 158 binary variables.

• Journal of Haehwa Medicine
• /
• v.18 no.1
• /
• pp.1-8
• /
• 2009

This study analyzed the contents of the research papers of Complementary Medicine concerning the inhalation drug for asthma published in Pubmed during lately 10 years. As a result, the following conclusion was drawn. 1. There were 5 papers concerning 2 review articles, 2 experimental studies and 1 clinical study. 2. Interventions of research papers are glutathione, microorganism fermentation extract (EM-X), ginkgolide and compound Chinese herbal monomer recipe (ligustrazin, baicalin, ginkgolide). 3. There is no controlled study for effect of inhaled glutathione, on the contrary it induced bronchial constriction in sulfites sensitive asthmatics. 4. Inhalation of EM-X reduced airway hyper-reactivity and level of IL-4, IL-5 and IL-13 in OVA challenged asthmatic mice. 5. Ginkgolide nebulized inhalation reduced symptomatic scorings and eosinophil cationic protein, improved FEV1 and PEF. 6. Compound Chinese herbal monomer (CHM) recipe reduced blood eosinophil count, eosinophil count and total cell cound in BALF, depressed airway hyper-responsiveness and airway inflammation.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.333-342
• /
• 2014

Most hyper-ellipsoidal clustering (HEC) approaches use the Mahalanobis distance as a distance metric. It has been proven that HEC, under this condition, cannot be realized since the cost function of partitional clustering is a constant. We demonstrate that HEC with a modified Gaussian kernel metric can be interpreted as a problem of finding condensed ellipsoidal clusters (with respect to the volumes and densities of the clusters) and propose a practical HEC algorithm that is able to efficiently handle clusters that are ellipsoidal in shape and that are of different size and density. We then try to refine the HEC algorithm by utilizing ellipsoids defined on the kernel feature space to deal with more complex-shaped clusters. The proposed methods lead to a significant improvement in the clustering results over K-means algorithm, fuzzy C-means algorithm, GMM-EM algorithm, and HEC algorithm based on minimum-volume ellipsoids using Mahalanobis distance.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.4
• /
• pp.202-208
• /
• 2015

In this study, we propose a new inference algorithm for a multiclass Gaussian process classification model using a variational EM framework and the Laplace approximation (LA) technique. This is performed in two steps, called expectation and maximization. First, in the expectation step (E-step), using Bayes' theorem and the LA technique, we derive the approximate posterior distribution of the latent function, indicating the possibility that each observation belongs to a certain class in the Gaussian process classification model. In the maximization step, we compute the maximum likelihood estimators for hyper-parameters of a covariance matrix necessary to define the prior distribution of the latent function by using the posterior distribution derived in the E-step. These steps iteratively repeat until a convergence condition is satisfied. Moreover, we conducted the experiments by using synthetic data and Iris data in order to verify the performance of the proposed algorithm. Experimental results reveal that the proposed algorithm shows good performance on these datasets.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.1
• /
• pp.59-66
• /
• 2013

In this paper, we propose a probabilistic framework for model-based clustering of direction of arrival (DOA) data to obtain stable sound source localization (SSL) estimates. Model-based clustering has been shown capable of handling highly overlapped and noisy datasets, such as those involved in DOA detection. Although the Gaussian mixture model is commonly used for model-based clustering, we propose use of the von Mises mixture model as more befitting circular DOA data than a Gaussian distribution. The EM framework for the von Mises mixture model in a unit hyper sphere is degenerated for the 2D case and used as such in the proposed method. We also use a histogram of the dataset to initialize the number of clusters and the initial values of parameters, thereby saving calculation time and improving the efficiency. Experiments using simulated and real-world datasets demonstrate the performance of the proposed method.

• Journal of KIISE:Software and Applications
• /
• v.36 no.11
• /
• pp.936-946
• /
• 2009

A graph cuts method has recently attracted a lot of attentions for image segmentation, as it can globally minimize energy functions composed of data term that reflects how each pixel fits into prior information for each class and smoothness term that penalizes discontinuities between neighboring pixels. In previous approaches to graph cuts-based automatic image segmentation, GMM(Gaussian mixture models) is generally used, and means and covariance matrixes calculated by EM algorithm were used as prior information for each cluster. However, it is practicable only for clusters with a hyper-spherical or hyper-ellipsoidal shape, as the cluster was represented based on the covariance matrix centered on the mean. For arbitrary-shaped clusters, this paper proposes graph cuts-based image segmentation using mean shift analysis. As a prior information to estimate the data term, we use the set of mean trajectories toward each mode from initial means randomly selected in $L^*u^*{\upsilon}^*$ color space. Since the mean shift procedure requires many computational times, we transform features in continuous feature space into 3D discrete grid, and use 3D kernel based on the first moment in the grid, which are needed to move the means to modes. In the experiments, we investigate the problems of mean shift-based and normalized cuts-based image segmentation methods that are recently popular methods, and the proposed method showed better performance than previous two methods and graph cuts-based automatic image segmentation using GMM on Berkeley segmentation dataset.