• 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.

• Journal of Plant Biotechnology
• /
• v.4 no.2
• /
• pp.67-70
• /
• 2002

The RAPD data were used to assess genetic similarity among f grape cultivars. Of the 100 random primers tested on genomic DNA, 10 primers could be selected for Benetic analysis, and the selected primers generated a total of 115 distinct amplification fragments. A similarity matrix was constructed on the basis of the presence or absence of bands. The 7 grape cultivars analyzed with UPGMA were clustered into two groups of A and B. The similarity coefficient value of cultivars was high. The mean similarity index for all pairwise comparisons was 0.851, and ranged from 0.714 ('Rosaki' and 'Black Olympia') to 0.988 ('Kyoho' and 'Daebong'). After due consideration of differences in cultural and morphological characteristics of these two theoretically identical cultivars, it could be deduced that 'Daebong' is a bud sport of 'Kyoho' cultivar.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1599-1607
• /
• 2015

Recently, researches have been developing efficient techniques for accessing, querying, and managing XML documents which are frequently used in the Internet. In this paper, we propose a parent-child matrix to cluster XML documents efficiently. A parent-child matrix analyzes both the content and structural features of an XML document. Each cell of a parent-child matrix has either the value of a node in an XML tree or the value of a child node, where a parent-child relationship exists in the XML tree. Then, the similarity between two XML documents can be measured by the similarity between two corresponding parent-child matrices. The experiment shows that our proposed method has good performance.

• The Korean Journal of Applied Statistics
• /
• v.26 no.2
• /
• pp.361-373
• /
• 2013

There are a wide variety of clustering algorithms; subsequently, we need a measure of similarity between two clustering methods. Such a measure can compare how well different clustering algorithms perform on a set of data. More numbers of compared clustering algorithms allow for more number of valuers for a measure of similarity between two clustering methods. Thus, we need a simple tool that presents the many values of a measure of similarity to compare many clustering methods. We suggest some graphical tools to compareg many clustering methods.

• Journal of information and communication convergence engineering
• /
• v.17 no.2
• /
• pp.135-141
• /
• 2019

Collaborative filtering algorithms often encounter data sparsity issues. To overcome this issue, auxiliary information of relevant items is analyzed and an item attribute matrix is derived. In this study, we combine the user-item attribute preference with the traditional similarity calculation method to develop an improved similarity calculation approach and use weights to control the importance of these two elements. A collaborative filtering algorithm based on user-item attribute preference is proposed. The experimental results show that the performance of the recommender system is the most optimal when the weight of traditional similarity is equal to that of user-item attribute preference similarity. Although the rating-matrix is sparse, better recommendation results can be obtained by adding a suitable proportion of user-item attribute preference similarity. Moreover, the mean absolute error of the proposed approach is less than that of two traditional collaborative filtering algorithms.

• The Journal of the Korea Contents Association
• /
• v.16 no.7
• /
• pp.667-680
• /
• 2016

As distributed computing platforms like Hadoop MapReduce have been developed, it is necessary to perform the conventional query processing techniques, which have been executed in a single computing machine, in distributed computing environments efficiently. Especially, studies on similarity join query processing in distributed computing environments have been done where similarity join means retrieving all data pairs with high similarity between given two data sets. But the existing similarity join query processing schemes for distributed computing environments have a problem of skewed computing load balance between clusters because they consider only the data transmission cost. In this paper, we propose Matrix-based Load-balancing Algorithm for efficient similarity join query processing in distributed computing environment. In order to uniform load balancing of clusters, the proposed algorithm estimates expected computing cost by using matrix and generates partitions based on the estimated cost. In addition, it can reduce computing loads by filtering out data which are not used in query processing in clusters. Finally, it is shown from our performance evaluation that the proposed algorithm is better on query processing performance than the existing one.

• The Journal of Korean Institute of Information Technology
• /
• v.16 no.12
• /
• pp.109-114
• /
• 2018

Collaborative filtering has been widely utilized in recommender systems as typical algorithm for outstanding performance. Since it depends on item rating history structurally, The more sparse rating matrix is, the lower its recommendation accuracy is, and sometimes it is totally useless. Variety of hybrid approaches have tried to combine collaborative filtering and content-based method for improving the sparsity issue in rating matrix. In this study, a new method is suggested for the same purpose, but with different perspective, it deals with no-match situation in person-person similarity evaluation. This method is called the transitive similarity model because it is based on relation graph of people, and it compares recommendation accuracy by applying to Movielens open dataset.

• Journal of the Korean Mathematical Society
• /
• v.59 no.5
• /
• pp.997-1013
• /
• 2022

In this paper we give conditions on a matrix which guarantee that it is similar to a centrosymmetric matrix. We use this conditions to show that some 4 × 4 and 6 × 6 Toeplitz matrices are similar to centrosymmetric matrices. Furthermore, we give conditions for a matrix to be similar to a matrix which has a centrosymmetric principal submatrix, and conditions under which a matrix can be dilated to a matrix similar to a centrosymmetric matrix.

• Journal of electromagnetic engineering and science
• /
• v.6 no.3
• /
• pp.155-159
• /
• 2006

An efficient method is presented to design filters without the similarity transform of their coupling coefficient matrix as circuit parameters, which is very tedious due to pivoting and deciding rotation angles needed during the iterations. The transfer function of a filter is directly used for the design and its desired form is derived by the optimized rational-function fitting technique. A 3rd order coaxial lowpass filter is taken as an example to validate the proposed method.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.637-657
• /
• 2021

In this paper, we decompose (under unitary similarity) the Kronecker sum A ⊞ A (= A ⊗ I + I ⊗ A) into a direct sum of irreducible matrices, when A is a 3×3 matrix. As a consequence we identify 𝒦(A⊞A) as the direct sum of several full matrix algebras as predicted by Artin-Wedderburn theorem, where 𝒦(T) is the unital algebra generated by Tand T^*.