• Bulletin of the Korean Chemical Society
• /
• v.33 no.2
• /
• pp.613-619
• /
• 2012

We applied several machine learning methods for developing QSAR models for prediction of acute toxicity to fathead minnow. The multiple linear regression (MLR) and artificial neural network (ANN) method were applied to predict 96 h $LC_{50}$ (median lethal concentration) of 555 chemical compounds. Molecular descriptors based on 2D chemical structure were calculated by PreADMET program. The recursive partitioning (RP) model was used for grouping of mode of actions as reactive or narcosis, followed by MLR method of chemicals within the same mode of action. The MLR, ANN, and two RP-MLR models possessed correlation coefficients ($R^2$) as 0.553, 0.618, 0.632, and 0.605 on test set, respectively. The consensus model of ANN and two RP-MLR models was used as the best model on training set and showed good predictivity ($R^2$=0.663) on the test set.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.842-845
• /
• 2004

The aim of this study is to compare the classification results for choosing the fuzzy membership function within fuzzy rules. There are various methods of extracting rules from training data in the process of fuzzy rules generation. Pattern distribution characteristics are considered to produce fuzzy rules. The accuracy of classification results are depended on not only considering the characteristics of fuzzy subspaces but also choosing the fuzzy membership functions. This paper shows how to produce various type of fuzzy rules from the partitioning the pattern spaces and results of land cover classification in satellite remote sensing images by adopting various fuzzy membership functions. The experiments of this study is applied to Landsat TM image and the results of classification are compared by fuzzy membership functions.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.38-41
• /
• 2002

Many scientifc applications include manipulation of data points tying in a space. We describe a method, based on sector labeling to generate a space-filling curve for partitioning such given data points. Our method is straightforward and flexible, equipping a one-one correspondence between point-values on the curve and data points in space in more efficient than designated methods found in the literature. It is widely believed that the Hilbert curve achieves the desired properties on linear mappings due to the locality between data points. Therefore we focus on the Hilbert curve since, later on, we identify it as the most suitable for our application. We demonstrate on using our method for the data particles of an n-body simulation that based on Barnes-Hut algorithm.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.10
• /
• pp.13-26
• /
• 1993

Motion picture algorithms are realized on the multiprocessor system presented in the Study I. For the most efficient processing of the algorithms, pipelining and geometrical parallel processing methods are employed, and processing time, communication load and efficiency of each algorithm are compared. The performance of the implemented system is compared and analysed with reference to MPEG coding algorithm. Theoretical calculations and experimental results both shows that geometrical partitioning is a more suitable parallel processing algorithm for moving picture coding having the advantage of easy algorithm modification and expansion, and the overall efficiency is higher than pipelining.

• Communications for Statistical Applications and Methods
• /
• v.22 no.6
• /
• pp.625-637
• /
• 2015

We develop a Bayesian clustering procedure based on a Dirichlet process prior with cluster specific random effects. Gibbs sampling of a normal mixture of linear mixed regressions with a Dirichlet process was implemented to calculate posterior probabilities when the number of clusters was unknown. Our approach (unlike its counterparts) provides simultaneous partitioning and parameter estimation with the computation of the classification probabilities. A Monte Carlo study of curve estimation results showed that the model was useful for function estimation. We find that the proposed Dirichlet process mixture model with cluster specific random effects detects clusters sensitively by combining vague edges into different clusters. Examples are given to show how these models perform on real data.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.157-160
• /
• 2000

In the generally a voice conversion has used VQ(Vector Quantization) for partitioning the spectral feature and has performed by adding an appropriate offset vector to the source speaker's spectral vector. But there is not represented the target speaker's various characteristics because of discrete characteristics of transformed parameter. In this paper, these problems are solved by using the LMR(Linear Multivariate Regression) instead of the mapping codebook which is determined to the relationship of source and target speaker vocal tract characteristics. Also we propose the method for solved the discontinuity which is caused by applying to time aligned parameters using Dynamic Time Warping the time or pitch-scale modified speech. In our proposed algorithm for overcoming the transitional discontinuities, first of all, we don't change time or pitch scale and by using the LMR change a speaker's vocal tract characteristics in speech with non-modified time or pitch. Compared to existed methods based on VQ and LMR, we have much better voice quality in the result of the proposed algorithm.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.330-333
• /
• 2003

Initial cluster size for clustering of partitioning methods is very important to the clustering result. In K-means algorithm, the result of cluster analysis becomes different with optimal cluster size K. Usually, the initial cluster size is determined by prior and subjective information. Sometimes this may not be optimal. Now, more objective method is needed to solve this problem. In our research, we propose a hybrid genetic algorithm, a tree induction based evolution algorithm, for determination of optimal cluster size. Initial population of this algorithm is determined by the number of terminal nodes of tree induction. From the initial population based on decision tree, our optimal cluster size is generated. The fitness function of ours is defined an inverse of dissimilarity measure. And the bagging approach is used for saying computational time cost.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.12
• /
• pp.1966-1973
• /
• 2001

The Jacobian matrix of the equations of motion of a system using velocity transformation technique is derived via variation methods to apply the implicit integration algorithm, DASSL. The concept of generalized coordinate partitioning is used to parameterize the constraint set with independent generalized coordinates. DASSL is applied to determine independent generalized coordinates and velocities. Dependent generalized coordinates, velocities, accelerations and Lagrange multipliers are explicitly retained in the formulation to satisfy all of the governing kinematic and dynamic equations. The derived Jacobian matrix of a system is proved to be valid and accurate both analytically and through solution of numerical examples.

• Communications for Statistical Applications and Methods
• /
• v.24 no.5
• /
• pp.457-480
• /
• 2017

We develop a random partition procedure based on a Dirichlet process prior with Laplace distribution. Gibbs sampling of a Laplace mixture of linear mixed regressions with a Dirichlet process is implemented as a random partition model when the number of clusters is unknown. Our approach provides simultaneous partitioning and parameter estimation with the computation of classification probabilities, unlike its counterparts. A full Gibbs-sampling algorithm is developed for an efficient Markov chain Monte Carlo posterior computation. The proposed method is illustrated with simulated data and one real data of the energy efficiency of Tsanas and Xifara (Energy and Buildings, 49, 560-567, 2012).

• Journal of the Korean Professional Engineers Association
• /
• v.20 no.1
• /
• pp.14-20
• /
• 1987

The development of the FHT (fast Hadamard transform) was presented and based on the derivation by Cooley-Tukey algorithm. Alternately, it can be derived by matrix partitioning or matrix factorization techniques. This paper proposes a simple sparse matrix technique by Kronecker product of successive lower Hadamard matrix. The following shows how the Kronecker product can be mathematically defined and efficiently implemented using a matrix factorization methods.