• Journal of The Korean Association of Information Education
• /
• v.17 no.4
• /
• pp.375-382
• /
• 2013

Collaborative filtering has been most widely used in commercial sites to recommend items based on the history of user preferences for items. The basic idea behind this method is to find similar users whose ratings for items are incorporated to make recommendations for new items. Hence, similarity calculation is most critical in recommendation performance. This paper presents a new similarity measure that takes each rating of a user relatively to his own ratings. Extensive experiments revealed that the proposed measure is more reliable than the classic measures in that it significantly decreases generation of extreme similarity values and its performance improves when consulting neighbors with high similarites only. In particular, the results show that the proposed measure is superior to the classic ones for datasets with large rating scales.

• Interdisciplinary Bio Central
• /
• v.3 no.4
• /
• pp.14.1-14.9
• /
• 2011

Protein homology detection is an important issue in comparative genomics. Because of the exponential growth of sequence databases, fast and efficient homology detection tools are urgently needed. Currently, for homology detection, sequence comparison methods using local alignment such as BLAST are generally used as they give a reasonable measure for sequence similarity. However, these methods have drawbacks in offering overall sequence similarity, especially in dealing with eukaryotic genomes that often contain many insertions and duplications on sequences. Also these methods do not provide the explicit models for speciation, thus it is difficult to interpret their similarity measure into homology detection. Here, we present a novel method based on Word Conservation Score (WCS) to address the current limitations of homology detection. Instead of counting each amino acid, we adopted the concept of 'Word' to compare sequences. WCS measures overall sequence similarity by comparing word contents, which is much faster than BLAST comparisons. Furthermore, evolutionary distance between homologous sequences could be measured by WCS. Therefore, we expect that sequence comparison with WCS is useful for the multiple-species-comparisons of large genomes. In the performance comparisons on protein structural classifications, our method showed a considerable improvement over BLAST. Our method found bigger micro-syntenic blocks which consist of orthologs with conserved gene order. By testing on various datasets, we showed that WCS gives faster and better overall similarity measure compared to BLAST.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.12
• /
• pp.203-210
• /
• 2020

Memory-based collaborative filtering is one of the representative types of the recommender system, but it suffers from the inherent problem of data sparsity. Although many works have been devoted to solving this problem, there is still a request for more systematic approaches to the problem. This study exploits distribution of user ratings given to items for computing similarity. All user ratings are utilized in the proposed method, compared to previous ones which use ratings for only common items between users. Moreover, for similarity computation, it takes a global view of ratings for items by reflecting other users' ratings for that item. Performance is evaluated through experiments and compared to that of other relevant methods. The results reveal that the proposed demonstrates superior performance in prediction and rank accuracies. This improvement in prediction accuracy is as high as 2.6 times more than that achieved by the state-of-the-art method over the traditional similarity measures.

• Journal of Korea Multimedia Society
• /
• v.12 no.4
• /
• pp.521-529
• /
• 2009

In this paper, we present a vision-based human primitive motion recognition method. It models the reference motion patterns, recognizes a user's motion, and measures the similarity between the reference action and the user's one. In order to recognize a motion, we provide a pattern modeling method based on the Hidden Markov Models. In addition, we provide a similarity measurement method between the reference motion and the user's one using the editing distance algorithm. Experimental results show that the recognition rate of ours is above 93%. Our method can be used in the motion recognizable games, the motion recognizable postures, and the rehabilitation training systems.

• Language and Information
• /
• v.12 no.1
• /
• pp.27-65
• /
• 2008

This paper presents a set of methodologies for aligning hypernym-hyponym noun pairs between Korean and English, based on the EuroWordNet approach. Following the methods conducted in EuroWordNet, our approach makes extensive use of WordNet in four steps of the building process: 1) Monolingual dictionaries have been used to extract proper hypernym-hyponym noun pairs, 2) bilingual dictionary has converted the extracted pairs, 3) Word Net has been used as a backbone of alignment criteria, and 4) WordNet has been used to select the most similar pair among the candidates. The importance of this study lies not only on enriching semantic links between two languages, but also on integrating lexical resources based on a language specific and dependent structure. Our approaches are aimed at building an accurate and detailed lexical resource with proper measures rather than at fast development of generic one using NLP technique.

• The Journal of Society for e-Business Studies
• /
• v.18 no.1
• /
• pp.97-105
• /
• 2013

In the e-business domain where data objects are quantitatively large, measuring similarity to find the same or similar objects is important. It basically requires comparing and computing the features of objects in pairs, and therefore takes longer time as the amount of data becomes bigger. Recent studies have shown various algorithms to efficiently perform it. Most of them show their performance superiority by empirical tests over some sets of data. In this paper, we introduce those data sets, present their characteristics and the meaningful threshold values that each of data sets contain in nature. The analysis on practical data sets with respect to their threshold values may serve as a referential baseline to the future experiments of newly developed algorithms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.2
• /
• pp.335-343
• /
• 2014

It is more important to ensure the credibility of internet media which influence the public opinion. However, there are vague suspicions in public from the examples of manipulation of online reviews with anonymity. In this study, we explore the possibility of manipulating public opinion in online web sites. We investigate the characteristics of comments posted by users on web sites and compare each comments by using the cosine similarity function. Our result shows followings. First, we found a correlation between the similarities of comments and the article ranks in the web sites. Second, it is possible to identify abnormal user activities indicating excessive multiple posting, double posting and astroturf activities.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.213-226
• /
• 2021

Given that most of the link prediction algorithms for signed social networks can only complete sign prediction, a novel algorithm is proposed aiming to achieve both link prediction and sign prediction in signed networks. Based on the structural balance theory, the local link tightness and global link tightness are defined respectively by using the structural information of paths with the step size of 2 and 3 between the two nodes. Then the total similarity of the node pair can be obtained by combining them. Its absolute value measures the possibility of the two nodes to establish a link, and its sign is the sign prediction result of the predicted link. The effectiveness and correctness of the proposed algorithm are verified on six typical datasets. Comparison and analysis are also carried out with the classical prediction algorithms in signed networks such as CN-Predict, ICN-Predict, and PSNBS (prediction in signed networks based on balance and similarity) using the evaluation indexes like area under the curve (AUC), Precision, improved AUC', improved Accuracy', and so on. Results show that the proposed algorithm achieves good performance in both link prediction and sign prediction, and its accuracy is higher than other algorithms. Moreover, it can achieve a good balance between prediction accuracy and computational complexity.

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

Representation and quantification of fuzziness are required for the uncertain system modelling and controller design. Conventional results show that entropy of fuzzy sets represent the fuzziness of fuzzy sets. In this literature, the relations of fuzzy enropy, distance measure and similarity measure are discussed, and distance measure is proposed. With the help of relations of fuzzy entropy, distance measure and similarity measure, fuzzy entropy is proposed by the distance measure. Finally, proposed entropy is applied to measure the fault signal of induction machine.

• Communications for Statistical Applications and Methods
• /
• v.13 no.3
• /
• pp.719-732
• /
• 2006

A set of clustering algorithms with proper weight on the formulation of distance which extend to mixed numeric and multiple binary values is presented. A simple matching and Jaccard coefficients are used to measure similarity between objects for multiple binary attributes. Similarities are converted to dissimilarities between i th and j th objects. The performance of clustering algorithms with balancing weight on different similarity measures is demonstrated. Our experiments show that clustering algorithms with application of proper weight give competitive recovery level when a set of data with mixed numeric and multiple binary attributes is clustered.