• Journal of the Korean Data and Information Science Society
• /
• v.25 no.5
• /
• pp.1107-1116
• /
• 2014

In this paper, we review recent developments in network analysis using the graph theory, and introduce ongoing research area with relevant theoretical results. In specific, we introduce basic notations in graph, and conditional and marginal approach in constructing the adjacency matrix. Also, we introduce the Marcenko-Pastur law, the Tracy-Widom law, the white Wishart distribution, and the spiked distribution. Finally, we mention the relationship between degrees and eigenvalues for the detection of hubs in a network.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.3
• /
• pp.169-180
• /
• 2013

The modification of conditional Fuzzy C-Means (CFCM) with Gaussian weights (CFCM_GW) is accomplished for blind equalization of channels in this paper. The proposed CFCM_GW can deal with both of linear and nonlinear channels, because it searches for the optimal desired states of an unknown channel in a direct manner, which is not dependent on the type of channel structure. In the search procedure of CFCM_GW, the Bayesian likelihood fitness function, the Gaussian weighted partition matrix and the conditional constraint are exploited. Especially, in contrast to the common Euclidean distance in conventional Fuzzy C-Means(FCM), the Gaussian weighted partition matrix and the conditional constraint in the proposed CFCM_GW make it more robust to the heavy noise communication environment. The selected channel states by CFCM_GW are always close to the optimal set of a channel even when the additive white Gaussian noise (AWGN) is heavily corrupted. These given channel states are utilized as the input of the Bayesian equalizer to reconstruct transmitted symbols. The simulation studies demonstrate that the performance of the proposed method is relatively superior to those of the existing conventional FCM based approaches in terms of accuracy and speed.

• International Journal of Oral Biology
• /
• v.34 no.2
• /
• pp.105-113
• /
• 2009

Dentin, a major component of teeth, is formed by odontoblasts which produce the dentin matrix beneath the dental epithelium and induce the mineralization of dentin. To date, the biochemical properties of dentin matrix proteins have been well characterized, but upstream regulators of these proteins are not yet well known. Recently in this regard, several transcription factors have been identified as potential regulators of matrix proteins. Most transcription factors are generally involved in diverse biological processes and it is essential to identify those that are odontoblast-specific transactivators to further understand the process of dentin formation. We thus analyzed the expression pattern of dentin matrix proteins and the activities of established transactivators containing a Cre-locus. Expression analyses using in situ hybridization showed that dentin matrix proteins are sequentially expressed in differentiating odontoblasts, including type-I collagen, Dmp-1 and Dspp. The activities of the transactivators were evaluated using ${\beta}$-galactosidase following the generation of double transgenic mice with each transactivator and the ROSA26R reporter line. The ${\beta}$-galactosidase activity of each transactivator paralled the expression of the matrix proteins. These results thus showed that these transactivators could be utilized for odontoblastspecific conditional gene targeting. In addition, time- and tissue-specific conditional gene targeting might also be achieved using a combination of these transactivators. Odontoblast-specific conditional gene targeting with these transactivators will likely also provide new insights into the molecular mechanisms underlying dentin formation.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.2
• /
• pp.166-175
• /
• 2002

In this paper. we predict tracking performance of the probabilistic strongest neighbor filter (PSNF). The PSNF is known to be consistent and superior to the probabilistic data association filter (PDAF) in both performance and computation. The PSNF takes into account the probability that the measurement with the strongest intensity in the neighborhood of the predicted target measurement location is not target-originated. The tracking performance of the PSNF is quantified in terms of its estimation error covariance matrix. The estimation error covariance matrix is approximately evaluated by using the hybrid conditional average approach (HYCA). We performed numerical experiments to show the validity of our performance prediction.

• Communications of the Korean Mathematical Society
• /
• v.21 no.2
• /
• pp.363-374
• /
• 2006

A new bivariate beta distribution based on the Appell function of the third kind is introduced. Various representations are derived for its product moments, marginal densities, marginal moments, conditional densities and conditional moments. The method of maximum likelihood is used to derive the associated estimation procedure as well as the Fisher information matrix.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.3
• /
• pp.155-159
• /
• 2013

In this paper, a nonlinear matrix inequality problem and a nonlinear optimization problem are proposed for obtaining a structured static output feedback controller. The proposed nonlinear optimization problem has LMI (Linear Matrix Inequality) constraints and a nonlinear objective function. Using the conditional gradient method, the nonlinear optimization problem can be solved. A numerical example shows the effectiveness of the proposed approach.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.1
• /
• pp.189-200
• /
• 2013

In this paper, it will be assumed that there are two distinct populations which are multivariate normal with equal covariance matrix. We also assume that the two populations are equally likely and the costs of misclassification are equal. The classification rule depends on the situation whether the training samples include missing values or not. We consider the conditional bootstrap confidence intervals for classification error rate when a block of observation is missing.

• Journal of Environmental Science International
• /
• v.25 no.4
• /
• pp.603-613
• /
• 2016

Fog may have a significant impact on road conditions. In an attempt to improve fog predictability in Jeju, we conducted machine learning with various data mining techniques such as tree models, conditional inference tree, random forest, multinomial logistic regression, neural network and support vector machine. To validate machine learning models, the results from the simulation was compared with the fog data observed over Jeju(184 ASOS site) and Gosan(185 ASOS site). Predictive rates proposed by six data mining methods are all above 92% at two regions. Additionally, we validated the performance of machine learning models with WRF (weather research and forecasting) model meteorological outputs. We found that it is still not good enough for operational fog forecast. According to the model assesment by metrics from confusion matrix, it can be seen that the fog prediction using neural network is the most effective method.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.2
• /
• pp.381-394
• /
• 2016

Graphical model represents conditional dependencies between variables as a graph with nodes and edges. It is widely used in various fields including physics, economics, and biology to describe complex association. Conditional dependencies can be estimated from a inverse covariance matrix, where zero off-diagonal elements denote conditional independence of corresponding variables. This paper proposes a efficient BCDR (block coordinate descent with random permutation) algorithm using graphics processing units and random permutation for the CONCORD (convex correlation selection method) based on the BCD (block coordinate descent) algorithm, which estimates a inverse covariance matrix based on pseudo-likelihood. We conduct numerical studies for two network structures to demonstrate the efficiency of the proposed algorithm for the CONCORD in terms of computation times.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.4
• /
• pp.338-343
• /
• 2015

We suggest a method to configure feature functions of continuous conditional random field (C-CRF). Regression tree and similarity analysis are introduced to construct the first and second feature functions of C-CRF, respectively. Rules from the regression tree are transformed to logic functions. If a logic in the set of rules is true for a data then it returns the corresponding value of leaf node and zero, otherwise. We build an Euclidean similarity matrix to define neighborhood, which constitute the second feature function. Using two feature functions, we make a C-CRF model and an illustrate example is provided.