• Korean Management Science Review
• /
• v.24 no.2
• /
• pp.177-196
• /
• 2007

For better predictions and classifications in customer recommendation, this study proposes an integrative model that efficiently combines the currently-in-use statistical and artificial intelligence models. In particular, by integrating the models such as Association Rule, Frequency Matrix, and Rule Induction, this study suggests an integrative prediction model. Integrated models consist of four models: ASFM model which combines Association Rule(A) and Frequency Matrix(B), ASRI model which combines Association Rule(A) and Rule Induction(C), FMRI model which combines Frequency Matrix(B) and Rule Induction(C), and ASFMRI model which combines Association Rule(A), Frequency Matrix(B), and Rule Induction(C). The data set for the tests is collected from a convenience store G, which is the number one in its brand in S. Korea. This data set contains sales information on customer transactions from September 1, 2005 to December 7, 2005. About 1,000 transactions are selected for a specific item. Using this data set. it suggests an integrated model predicting whether a customer buys or not buys a specific product for target marketing strategy. The performance of integrated model is compared with that of other models. The results from the experiments show that the performance of integrated model is superior to that of all other models such as Association Rule, Frequency Matrix, and Rule Induction.

• The Korean Journal of Applied Statistics
• /
• v.28 no.2
• /
• pp.211-219
• /
• 2015

Generalized linear mixed models are used to analyze longitudinal categorical data. Random effects specify the serial dependence of repeated outcomes in these models; however, the estimation of a random effects covariance matrix is challenging because of many parameters in the matrix and the estimated covariance matrix should satisfy positive definiteness. Several approaches to model the random effects covariance matrix are proposed to overcome these restrictions: modified Cholesky decomposition, moving average Cholesky decomposition, and partial autocorrelation approaches. We review several approaches and present potential future work.

• Kyungpook Mathematical Journal
• /
• v.57 no.2
• /
• pp.211-222
• /
• 2017

In this paper, we consider three inverse eigenvalue problems for a special type of acyclic matrices. The acyclic matrices considered in this paper are described by a graph called a broom on n + m vertices, which is obtained by joining m pendant edges to one of the terminal vertices of a path on n vertices. The problems require the reconstruction of such a matrix from given partial eigen data. The eigen data for the first problem consists of the largest eigenvalue of each of the leading principal submatrices of the required matrix, while for the second problem it consists of an eigenvalue of each of its trailing principal submatrices. The third problem has an eigenvalue and a corresponding eigenvector of the required matrix as the eigen data. The method of solution involves the use of recurrence relations among the leading/trailing principal minors of ${\lambda}I-A$, where A is the required matrix. We derive the necessary and sufficient conditions for the solutions of these problems. The constructive nature of the proofs also provides the algorithms for computing the required entries of the matrix. We also provide some numerical examples to show the applicability of our results.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.67-74
• /
• 2015

The heat conduction equation, a type of a Poisson equation which can be applied in various areas of engineering is calculating its value with the iteration method in general. The equation which had difference discretization of the heat conduction equation is the simultaneous equation, and each line has the characteristic of expressing in sparse matrix of the equivalent number of none-zero elements with neighboring grids. In this paper, we propose a data structure for sparse matrix that can calculate the value faster with less memory use calculate the heat conduction equation. To verify whether the proposed data structure efficiently calculates the value compared to the other sparse matrix representations, we apply the representative iteration method, CG (Conjugate Gradient), and presents experiment results of time consumed to get values, calculation time of each step and relevant time consumption ratio, and memory usage amount. The results of this experiment could be used to estimate main elements of calculating the value of the general heat conduction equation, such as time consumed, the memory usage amount.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.4
• /
• pp.646-651
• /
• 2012

Meaningful logos or random sequences have been used in the current digital watermarking techniques of 2D bar code. The meaningful logos can not only be created by copyright holders based on their unique information, but are also very effective when representing their copyrights. The random sequences enhance the security of the watermark for verifying one's copyrights against intentional or unintentional attacks. In this paper, we propose a new watermarking technique taking advantage of Data Matrix as well as encryption keys. The Data Matrix not only recovers the original data by an error checking and correction algorithm, even when its high-density data storage and barcode are damaged, but also encrypts the copyright verification information by randomization of the barcode, including ownership keys. Furthermore, the encryption keys and the patterns are used to localize the watermark, and make the watermark robust against attacks, respectively. Through the comparison experiments of the copyright information extracted from the watermark, we can verify that the proposed method has good quality and is robust to various attacks, such as JPEG compression, filtering and resizing.

• Journal of information and communication convergence engineering
• /
• v.1 no.4
• /
• pp.209-212
• /
• 2003

In this paper, we proposed new speech feature parameter through parts-based feature extraction of speech spectrum using Non-Negative Matrix Factorization (NMF). NMF can effectively reduce dimension for multi-dimensional data through matrix factorization under the non-negativity constraints, and dimensionally reduced data should be presented parts-based features of input data. For speech feature extraction, we applied Mel-scaled filter bank outputs to inputs of NMF, than used outputs of NMF for inputs of speech recognizer. From recognition experiment result, we could confirm that proposed feature parameter is superior in recognition performance than mel frequency cepstral coefficient (MFCC) that is used generally.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.49-52
• /
• 2003

In this paper, we propose new speech feature parameter using NMf(Non-Negative Matrix Factorization). NMF can represent multi-dimensional data based on effective dimensional reduction through matrix factorization under the non-negativity constraint, and reduced data present parts-based features of input data. In this paper, we verify about usefulness of NMF algorithm for speech feature extraction applying feature parameter that is got using NMF in Mel-scaled filter bank output. According to recognition experiment result, we could confirm that proposal feature parameter is superior in recognition performance than MFCC(mel frequency cepstral coefficient) that is used generally.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2002.05a
• /
• pp.253-259
• /
• 2002

The rigid body characteristics (value of mass, Position of center of mass, moments and products of inertia) of mechanical systems can be identified from FRF data or vibration spectra of rigid body motion. Therefore the accuracy of rigid body characteristics is connected directly with the accuracy of measured data for rigid body motions. In this paper, a method of improving accuracy of measurement of rigid body motion is presented. Applying rigid body theory, ail translational and rotational displacements at a tentative point on the rigid body are calculated using the measured translational displacements for several points and transfer matrix. Then the estimated displacements for the identical points are calculated using the 6 displacements of the tentative Point and transfer matrix. By using correlation coefficient between measured and estimated displacements, we can detect the existence of errors that are contained in a certain measured displacement. Consequently, the improved rigid body motion with respect to a tentative point can be obtained by eliminating the contaminated data.

• International journal of advanced smart convergence
• /
• v.8 no.2
• /
• pp.39-46
• /
• 2019

Human mobility estimation plays a key factor in a lot of promising applications including location-based recommendation systems, urban planning, and disease outbreak control. We study the human mobility estimation problem in the case where recent locations of a person-of-interest are unknown. Since matrix decomposition is used to perform latent semantic analysis of multi-dimensional data, we propose a human location estimation algorithm based on matrix factorization to reconstruct the human movement patterns through the use of information of persons with correlated movements. Specifically, the optimization problem which minimizes the difference between the reconstructed and actual movement data is first formulated. Then, the gradient descent algorithm is applied to adjust parameters which contribute to reconstructed mobility data. The experiment results show that the proposed framework can be used for the prediction of human location and achieves higher predictive accuracy than a baseline model.

• The Korean Journal of Applied Statistics
• /
• v.33 no.3
• /
• pp.281-296
• /
• 2020

Repeated outcomes from the same subjects are referred to as longitudinal data. Analysis of the data requires different methods unlike cross-sectional data analysis. It is important to model the covariance matrix because the correlation between the repeated outcomes must be considered when estimating the effects of covariates on the mean response. However, the modeling of the covariance matrix is tricky because there are many parameters to be estimated, and the estimated covariance matrix should be positive definite. In this paper, we consider analysis of multivariate longitudinal data via two modeling methodologies for the covariance matrix for multivariate longitudinal data. Both methods describe serial correlations of multivariate longitudinal outcomes using a modified Cholesky decomposition. However, the two methods consider different decompositions to explain the correlation between simultaneous responses. The first method uses enhanced linear covariance models so that the covariance matrix satisfies a positive definiteness condition; in addition, and principal component analysis and maximization-minimization algorithm (MM algorithm) were used to estimate model parameters. The second method considers variance-correlation decomposition and hypersphere decomposition to model covariance matrix. Simulations are used to compare the performance of the two methodologies.