• Journal of the Korea Convergence Society
• /
• v.4 no.1
• /
• pp.43-48
• /
• 2013

Designing of similarity on high dimensional data was done. Similarity measure between high dimensional data was considered by analysing neighbor information with respect to data sets. Obtained result could be applied to big data, because big data has multiple characteristics compared to simple data set. Definitely, analysis of high dimensional data could be the pre-study of big data. High dimensional data analysis was also compared with the conventional similarity. Traditional similarity measure on overlapped data was illustrated, and application to non-overlapped data was carried out. Its usefulness was proved by way of mathematical proof, and verified by calculation of similarity for artificial data example.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.5
• /
• pp.462-475
• /
• 2022

Different from the field of electro-optical(EO) image analysis, there has been less interest in similarity metrics between synthetic aperture radar(SAR) target images. A reliable and objective similarity analysis for SAR target images is expected to enable the verification of the SAR measurement process or provide the guidelines of target CAD modeling that can be used for simulating realistic SAR target images. For this purpose, this paper presents a similarity analysis method based on the siamese network that quantifies the subjective assessment through the distance learning of similar and dissimilar SAR target image pairs. The proposed method is applied to MSTAR SAR target images of slightly different depression angles and the resultant metrics are compared and analyzed with qualitative evaluation. Since the image similarity is somewhat related to recognition performance, the capacity of the proposed method for target recognition is further checked experimentally with the confusion matrix.

• Journal of Software Assessment and Valuation
• /
• v.16 no.2
• /
• pp.37-44
• /
• 2020

As the information society develops, various cases of copyright infringement have occurred. In many disputes between companies, software similarity appraisal is dominated. This thesis is a study on the method of calculating the similarity of the standards subject to appraisal. In other words, it is a study to calculate the amount of revision and addition of the specification to be assessed. The analysis method compares the table of contents of both specifications and finds the same or similar part. The similarity weight is determined according to the degree of similarity. Weights identify and assign the degree of similarity between the expert's expertise and the specification. If it is completely newly added, the similarity weight is 1, if it is partially modified, the similarity weight is 0.4, and if it is almost the same as before, it is calculated by giving a weight of 0.05. Through this paper, it was found that the result of calculating the similarity to the specification is 21.2 pages.

• Language and Information
• /
• v.14 no.2
• /
• pp.131-157
• /
• 2010

This article reports an attempt to perform a similarity analysis on a collection of 25 culinary manuscripts in Chosun periods using a set of quantitative text analysis methods. Historical culinary texts are valuable resources for linguistic, historic, and cultural studies. We consider the similarity of two texts as the distributional similarities of the functional components of the texts. In the case of culinary texts, text elements such as food names, cooking methods, and ingredients are regarded as functional components. We derive the similarity information from the distributional characteristics of the two key functional components, cooking methods and ingredients. The results are also quantified and visualized to achieve a better understanding of the properties of the individual texts and the collection of the texts as a whole.

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

For a fuzzy system modeled by a fuzzy hypergraph, two fuzzy similarity measures are proposed : one for the fuzzy similarity between fuzzy sets and the other between elements in fuzzy sets. The propose measures can represent the realistic similarities which can not be given by the existing measures. With and example, it is shown that it can be used in the behavior analysis in an organization.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.3
• /
• pp.218-223
• /
• 2010

Discussion and analysis about relative mutual information has been carried out through fuzzy entropy and similarity measure. Fuzzy relative mutual information measure (FRIM) plays an important part as a measure of information shared between two fuzzy pattern vectors. This FRIM is analyzed and explained through similarity measure between two fuzzy sets. Furthermore, comparison between two measures is also carried out.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.3
• /
• pp.105-112
• /
• 2019

In this paper, we propose a technique to analyze similarity between SQL queries and to assist integrating similar tables. First, the table information was extracted from the SQL queries through the query structure analyzer, and the similarity between the tables was measured using the Jacquard index technique. Then, similar table clusters are generated through hierarchical cluster analysis method and the co-occurence probability of the table used in the query is calculated. The possibility of integrating similar tables is classified by using the possibility of co-occurence of similarity table and table, and classifying them into an integrable cluster, a cluster requiring expert review, and a cluster with low integration possibility. This technique analyzes the SQL query in practice and analyse the possibility of table integration independent of the existing business, so that the existing schema can be effectively reconstructed without interruption of work or additional cost.

• International Journal of Advanced Culture Technology
• /
• v.10 no.2
• /
• pp.240-245
• /
• 2022

Because of the importance of the information, encryption algorithms are heavily used. Raw data is encrypted and secure, but problems arise when the key for decryption is exposed. In particular, large-scale Internet sites such as Facebook and Amazon suffer serious damage when user data is exposed. Recently, research into a new fourth-generation encryption technology that can protect user-related data without the use of a key required for encryption is attracting attention. Also, data clustering technology using encryption is attracting attention. In this paper, we try to reduce key exposure by using homomorphic encryption. In addition, we want to maintain privacy through similarity measurement. Additionally, holistic similarity measurements are time-consuming and expensive as the data size and scope increases. Therefore, Min-Hash has been studied to efficiently estimate the similarity between two signatures Methods of measuring similarity that have been studied in the past are time-consuming and expensive as the size and area of data increases. However, Min-Hash allowed us to efficiently infer the similarity between the two sets. Min-Hash is widely used for anti-plagiarism, graph and image analysis, and genetic analysis. Therefore, this paper reports privacy using homomorphic encryption and presents a model for efficient similarity measurement using Min-Hash.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1158-1167
• /
• 2017

Many real-world applications information are organized and represented with graph structure which is often used for representing various ubiquitous networks, such as World Wide Web, social networks, and protein-protein interactive networks. In particular, similarity evaluation between graphs is a challenging issue in many fields such as graph searching, pattern discovery, neuroscience, chemical compounds exploration and so forth. There exist some algorithms which are based on vertices or edges properties, are proposed for addressing this issue. However, these algorithms do not take both vertices and edges similarities into account. Towards this end, this paper pioneers a novel approach for similarity evaluation between graphs based on formal concept analysis. The feature of this approach is able to characterize the relationships between nodes and further reveal the similarity between graphs. Therefore, the highlight of our approach is to take vertices and edges into account simultaneously. The proposed algorithm is evaluated using a case study for validating the effectiveness of the proposed approach on detecting and measuring the similarity between graphs.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.199-202
• /
• 2007

The similarity measure is constructed for non-convex fuzzy membership function using well known Hamming distance measure. Comparison with convex fuzzy membership function is carried out, furthermore characteristic analysis for non-convex function are also illustrated. Proposed similarity measure is proved and the usefulness is verified through example. In example, usefulness of proposed similarity is pointed out.