• Korean Journal of Cognitive Science
• /
• v.30 no.3
• /
• pp.133-156
• /
• 2019

To investigate how personality test items are understood by participants, their semantic representations were explored by Latent Semantic Analysis, In this thesis, Semantic Similarity Matrix was proposed, which contains cosine similarity of semantic representations between test items and personality traits. The matrix was compared to traditional factor loading matrix. In preliminary study, semantic space was constructed from the passages describing the five traits, collected from 154 undergraduate participants. In study 1, positive correlation was observed between the factor loading matrix of Korean shorten BFI and its semantic similarity matrix. In study 2, short personality test was constructed from semantic similarity matrix, and observed that its factor loading matrix was positively correlated with the semantic similarity matrix as well. In conclusion, the results implies that the factor structure of personality test can be inferred from semantic similarity between the items and factors.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.281-282
• /
• 2007

We address a new representation of DCT/DFT/Wavelet matrices via one hybrid architecture. Based on an element inverse matrix factorization algorithm, we show that the OCT, OFT and Wavelet which based on Haar matrix have the similarrecursive computational pattern, all of them can be decomposed to one orthogonal character matrix and a special sparse matrix. The special sparse matrix belongs to Jacket matrix, whose inverse can be from element-wise inverse or block-wise inverse. Based on this trait, we can develop a hybrid architecture.

• Communications for Statistical Applications and Methods
• /
• v.15 no.6
• /
• pp.837-842
• /
• 2008

Students taking linear model courses have difficulty in determining which parametric functions are estimable when the design matrix of a linear model is rank deficient. In this note a special form of estimable functions is presented with a linear combination of some orthogonal estimable functions. Here, the orthogonality means the least squares estimators of the estimable functions are uncorrelated and have the same variance. The number of the orthogonal estimable functions composing the special form is equal to the rank of the design matrix. The orthogonal estimable functions can be easily obtained through the singular value decomposition of the design matrix.

• Honam Mathematical Journal
• /
• v.28 no.2
• /
• pp.205-212
• /
• 2006

The Lie algebra of type $F_4$ has the 26 dimensional representation. Its matrix realization can be obtained via 26 by 26 matrices and has a direct useful application to degenerate principal series for p-adic groups of type $F_4$.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.81-96
• /
• 2004

The level-m scaled circulant factor matrix over the complex number field is introduced. Its diagonalization and spectral decomposition and representation are discussed. An explicit formula for the entries of the inverse of a level-m scaled circulant factor matrix is presented. Finally, an algorithm for finding the inverse of such matrices over the quaternion division algebra is given.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.4
• /
• pp.571-579
• /
• 2014

In this paper, we present new vector generators of a matrix subalgebra $L_{0,n}$, which is isomorphic to the Clifford algebra $C{\ell}_{0,n}$, and we obtain the matrix form of inverse of a vector in $L_{0,n}$. Moreover, we consider the solution of a linear equation $xg_2=g_2x$, where $g_2$ is a vector generator of $L_{0,n}$.

• Honam Mathematical Journal
• /
• v.33 no.3
• /
• pp.381-391
• /
• 2011

One of the main interesting things of a matroid theory is the representability by a matroid from a matrix over some field F. The representability of uniform matroid $U_{m,n}$ over some field are studied by many authors. In this paper we construct a matrix representing $U_{3,6}$ over the field GF(4). Also we find out matrix of the affine matroid AG(2, 3) over the field GF(4).

• Honam Mathematical Journal
• /
• v.44 no.2
• /
• pp.195-208
• /
• 2022

In this article, the matrix representation of commutative elliptic octonions and their properties are described. Firstly, definitions and theorems are given for the commutative elliptic octonion matrices using the elliptic quaternion matrices. Then the adjoint matrix, eigenvalue and eigenvector of the commutative elliptic octonions are investigated. Finally, α = -1 for the Gershgorin Theorem is proved using eigenvalue and eigenvector of the commutative elliptic octonion matrix.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1412-1417
• /
• 2004

Sparse coding or independent component analysis (ICA) which is a holistic representation, was successfully applied to elucidate early auditor${\gamma}$ processing and to the task of sound classification. In contrast, parts-based representation is an alternative way o) understanding object recognition in brain. In this thesis we employ the non-negative matrix factorization (NMF) which learns parts-based representation in the task of sound classification. Methods of feature extraction from the spectro-temporal sounds using the NMF in the absence or presence of noise, are explained. Experimental results show that NMF-based features improve the performance of sound classification over ICA-based features.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.358-363
• /
• 1998

An algorithm for representing the cubic spline interpolation of differentiable functions by a fuzzy system is presented in this paper. The cubic B-spline functions which form a basis for the interpolation function are used as the fuzzy sets for input fuzzification. The ordinal number of the coefficient cKL in the list of the coefficient cij's as sorted in increasing order, is taken to be the output fuzzy set number in the (k, l) th entry of the fuzzy rule table. Spike functions are used for the output fuzzy sets, with cij's as support boundaries after they are sorted. An algorithm to compute the support boundaries explicitly without solving the matrix equation involved is included, along with a few properties of the fuzzy rule matrix for the designed fuzzy system.