• The Journal of the Korea Contents Association
• /
• v.14 no.10
• /
• pp.32-40
• /
• 2014

While there is a great demand for malware classification to reduce the time required in malware analysis and find a new type of malware, various similarity measurement methods of malware to classify a lot of malwares have been proposed. But, the existing methods to measure similarity just represented the classification results by them and have not carried out performance comparison with other methods. This is because an evaluation model to compare the performance of similarity measurement methods is non-existent. In this paper, we propose a new performance evaluation model on similarity measurement methods of malware by using two indicators: success rate and degree of confidence. In addition, we compare and evaluate the performance of existing similarity measurement methods by using these two indicators.

• Korean Journal of Child Studies
• /
• v.33 no.5
• /
• pp.53-70
• /
• 2012

The purpose of this study was to investigate the effects of task conditions (physical similarity between the spatial product and the reference space, presentation place of the spatial product) on children's spatial representation. The participants consisted of 40 3-year-olds and 40 4-year-olds. The results of this study are as follows. Both 3-year-olds and 4-year-olds were capable of a greater degree of spatial representation when there was a high level of physical similarity between the spatial product and the reference space, and when the presentation place of the spatial product was in the reference space. 4-year-olds were capable of more accurate spatial representation than 3-year-olds. There was no significant difference in the children's spatial representation depending on the type of spatial product (scale model, map). The results revealed that the physical similarity between the spatial product and the reference space and the presentation place of the spatial product are essential in young children's spatial representation. Additionally, the results indicated that spatial representation of children develops gradually from when they are three to when they turn four.

• Journal of KIISE:Software and Applications
• /
• v.31 no.11
• /
• pp.1519-1533
• /
• 2004

When Web-based special retrieval systems for scientific field extremely restrict the expression of user's information request, the process of the information content analysis and that of the information acquisition become inconsistent. In this paper, we apply the fuzzy retrieval model to solve the high time complexity of the retrieval system by constructing a reduced term set for the term's relatively importance degree. Furthermore, we perform a cluster retrieval to reflect the user's Query exactly through the similarity relation matrix satisfying the characteristics of the fuzzy compatibility relation. We have proven the performance of a proposed re-ranking model based on the similarity union of the fuzzy retrieval model and the document cluster retrieval model.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.1
• /
• pp.1-8
• /
• 2018

It is not easy to learn simple expressions of moving picture data since it contains noise and a lot of information in addition to time-based information. In this study, we propose a similarity representation method and a deep learning method between sequential data which can express such video data abstractly and simpler. This is to learn and obtain a function that allow them to have maximum information when interpreting the degree of similarity between image data vectors constituting a moving picture. Through the actual data, it is confirmed that the proposed method shows better classification performance than the existing moving image classification methods.

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

In this paper, we propose a new technique of codification. The purpose of this method is to take in consideration the natural language nuances and the fuzziness that characterizes the human reasoning. So, we warranted a means of more flexible encoding that translates as well the linguistic descriptions. Its principle is simple and intuitive. It consists simply in replacing in ambiguous cases, a unique number by an interval. The introduction of the new codification necessitates the elaboration of metric or similarity in order to compare two intervals. This comparison must take in consideration the difference of their size, the remoteness of their center and the width of their intersection. In consequence, we defined three new fuzzy concepts : "fuzzy inclusion degree", "fuzzy resemblance degree," and " fuzzy curve".

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1439-1448
• /
• 2005

In this paper, after similarity of color information in above toro and geometry position analysis of important characteristic information in face and abstraction object that is inputted detects face area using comparison, describe about method to do user certification using ratio information and hair spring degree. Face abstraction algorithm that use color information has comparative advantages than face abstraction algorithm that use form information because have advantage that is not influenced facial degree or site etc. that tip. Because is based on color information, change of lighting or to keep correct performance because is sensitive about color such as background similar to complexion is difficult. Therefore, can be used more efficiently than method to use color information as that detect characteristic information of eye and lips etc. that is facial importance characteristic element except color information and similarity for each object achieves comparison. This paper proposes system that eye and mouth's similarity that calculate characteristic that is ratio red of each individual after divide face by each individual and is segmentalized giving weight in specification calculation recognize user confirming similarity through search. Could experiment method to propose and know that the awareness rate through analysis with the wave rises.

• Journal of Korea Game Society
• /
• v.4 no.1
• /
• pp.50-57
• /
• 2004

The copyright against the game which is successful to a performance, is increasing rapidly. The compute r game is sensitive to a popularity. Game from the hazard which it develops short time, the expense which is cheap, about lower the dispute with a copyright, a reproduction and the ticket paragraph increases with the insufficient back of technical power. It analyzes the quality of the tools comparison it will be able to analyze the source codes from the dissertation which it sees. It analyzed the game source code and against the method which produces the original program and the reproduction degree of reproduction program for it researched. The method which produces a reproduction degree game feature following function shares a module especially. After from each module separating a file in file structure, source pro gram and data structure form, it calculates a similarity measure. It followed in important degree of each function and weight it let and the fixed quantity reproduction degree of full game program it produced.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.5
• /
• pp.47-53
• /
• 2021

Sparse ratings data hinder reliable similarity computation between users, which degrades the performance of memory-based collaborative filtering techniques for recommender systems. Many works in the literature have been developed for solving this data sparsity problem, where the most simple and representative ones are the methods of utilizing Jaccard index. This index reflects the number of commonly rated items between two users and is mostly integrated into traditional similarity measures to compute similarity more accurately between the users. However, such integration is very straightforward with no consideration of the degree of data sparsity. This study suggests a novel idea of applying different similarity measures depending on the numeric value of Jaccard index between two users. Performance experiments are conducted to obtain optimal values of the parameters used by the proposed method and evaluate it in comparison with other relevant methods. As a result, the proposed demonstrates the best and comparable performance in prediction and recommendation accuracies.

• Journal of KIISE:Software and Applications
• /
• v.31 no.12
• /
• pp.1660-1671
• /
• 2004

This paper proposes a method for measuring document similarity between two documents. One of the most significant ideas of the method is to estimate the degree of similarity between two documents based on the frequencies of terms and term-pair, existing in both the two documents. In contrast to conventional methods which takes only one feature into account, the proposed method considers several features at the same time and meatures the similarity using a neural network. To prove the superiority of our method, two experiments have been conducted. One is to verify whether the two input documents are from the same document or not. The other is a problem of information retrieval with a document as the query against a large number of documents. In both the two experiments, the proposed method shows higher accuracy than two conventional methods, Cosine similarity measurement and a term-pair method.

• Journal of the Korean Society for Library and Information Science
• /
• v.31 no.1
• /
• pp.153-184
• /
• 1997

The importance of WWW search services is increasing as Internet information resources explode. An evaluation of current 9 search services was first conducted by comparing descriptively the features concerning indexing, searching, and ranking of search results. Secondly, a couple of search queries were used to evaluate search performance of those services by the measures of retrieval effectiveness. the degree of overlap in searching sites, and the degree of similarity between services. In this experiment, Alta Vista, HotBot and Open Text Index showed better results for the retrieval effectiveness. The level of similarity among the 9 search services was extremely low.