• Journal of Internet Computing and Services
• /
• v.6 no.1
• /
• pp.51-64
• /
• 2005

In this paper, we introduce a system for evaluating similarity of C program source code using method which compares syntax-trees each others. This method supposes two characteristic features as against other systems. It is not sensitive for program style such as indentation, white space, and comments, and changing order of control structure like sentences, code block, procedures, and so on. Another is that it can detect a syntax-error cause of using paring technique, We introduce algorithms for similarity evaluation method and grouping method that reduces the number of comparison, In the examination section, we show a test result of program similarity evaluation and its reduced iteration by grouping algorithm.

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

• International Journal of Advanced Culture Technology
• /
• v.8 no.2
• /
• pp.289-296
• /
• 2020

Software copyright are written in text form of documents and stored as files, so it is easy to expose on an illegal copyright. The IOT framework configuration and service environment are also evaluated in software structure and revealed to replication environments. Illegal copyright can be easily created by intelligently modifying the program code in the framework system. This paper deals with similarity comparison to determine the suspicion of illegal copying. In general, original source code should be provided for similarity comparison on both. However, recently, the suspected developer have refused to provide the source code, and comparative evaluation are performed only with executable code. This study dealt with how to analyze the similarity with the execution code and the circuit configuration and interface state of the system without the original source code. In this paper, we propose a method of analyzing the data of the object without source code and verifying the similarity comparison result through evaluation examples.

• The Journal of the Korea Contents Association
• /
• v.2 no.1
• /
• pp.59-67
• /
• 2002

This study pre-processed the characters, performed the feature extraction for the beauty evaluation, and then defined the similarity function. It suggested the definition of the similarity function, and the extraction of the features of character elements. it experimented how much the various input character patterns were similar with the standard character patterns, found their results were almost similar with the expected ones and the results of beauty evaluation on general people through the questionaire with the results of the methods suggested here.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.4
• /
• pp.259-262
• /
• 2010

Study about fuzzy entropy and similarity measure on intuitionistic fuzzy sets (IFSs) were proposed, and analyzed. Unlike fuzzy set, IFSs contains uncertainty named hesistancy, which is contained in fuzzy membership function itself. Hence, designing fuzzy entropy is not easy because of ununified entropy definition. By considering different fuzzy entropy definitions, fuzzy entropy is designed and discussed their relation. Similarity measure was also presented and verified its usefulness to evaluate degree of similarity.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.10
• /
• pp.1746-1754
• /
• 2016

In this paper, we provide a development and evaluation method for an archery posture analyzing system, using an inertial sensor. The system was developed using LabVIEW2014 by National Instruments and evaluated using the DTW algorithm. To convert the voltage value of the inertial sensor into a physical value, a coordinate transformation matrix bias was applied. To evaluate the similarity of movement in archery shooting, the DTW distance was calculated and similarity was confirmed based on simple mechanical movement, the same person's shooting movement, shooting movement with another person, and the noise signal. The average similarity comparison results were as follows: simple mechanical movement was 17.05%, the same person's shooting movement was 26.48%, shooting movement with another person was 62.8%, and the noise signal was 328.5%; a smaller value indicates a higher level of similarity. We confirmed the possibility of analyzing the archery posture using 3-axis acceleration of the inertial sensor. We inferred that the proposed method might be important means for assessing shooting skills, evaluation of archer's progress, and finding talented archers in advance.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.109-116
• /
• 2005

In this paper, we introduce the method that a user analyses the similarity of the two programs by using keyword from the syntactic tree, created after the syntax analysis, and its implementation. The main advantage of the method is the performance improvement through using only keyword of syntax tree. In the paper, we propose the similarity evaluation model and how we extract keyword from syntax tree. In addition, we also show the improvement in the performance in analysis and in the system's structure. We expect that our system will be utilized in the similarity evaluation in text and XML documents.

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

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.4
• /
• pp.275-280
• /
• 2010

Verification of efficiency in data management fuzzy entropy and similarity measure were discussed and verified by applying reliable data selection problem and numerical data similarity evaluation. In order to calculate the certainty or uncertainty fuzzy entropy and similarity measure are designed and proved. Designed fuzzy entropy and similarity are considered as dissimilarity measure and similarity measure, and the relation between two measures are explained through graphical illustration. Obtained measures are useful to the application of decision theory and mutual information analysis problem. Extension of data quantification results based on the proposed measures are applicable to the decision making and fuzzy game theory.

• Journal of Information Science Theory and Practice
• /
• v.8 no.2
• /
• pp.6-17
• /
• 2020

Word similarity is often measured to enhance system performance in the information retrieval field and other related areas. This paper reports on an experimental comparison of values for word similarity measures that were computed based on 50 intentionally selected words from a Reuters corpus. There were three targets, including (1) co-occurrence-based similarity measures (for which a co-occurrence frequency is counted as the number of documents or sentences), (2) context-based distributional similarity measures obtained from a latent Dirichlet allocation (LDA), nonnegative matrix factorization (NMF), and Word2Vec algorithm, and (3) similarity measures computed from the tf-idf weights of each word according to a vector space model (VSM). Here, a Pearson correlation coefficient for a pair of VSM-based similarity measures and co-occurrence-based similarity measures according to the number of documents was highest. Group-average agglomerative hierarchical clustering was also applied to similarity matrices computed by individual measures. An evaluation of the cluster sets according to an answer set revealed that VSM- and LDA-based similarity measures performed best.