• 한국융합학회논문지
• /
• 제4권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.

• 한국군사과학기술학회지
• /
• 제25권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.

• 한국소프트웨어감정평가학회 논문지
• /
• 제16권2호
• /
• pp.37-44
• /
• 2020

정보화 사회가 발전함으로써 다양한 저작권 침해 사례가 발생하고 있다. 기업간의 여러 분쟁은 소프트웨어 유사도 감정이 대부분을 차지하고 있다. 본 논문은 감정 대상 규격서의 유사도 산정 방법에 관한 연구이다. 즉, 감정 대상 규격서의 수정 및 추가 분량이 어느 정도 인지 산정하는 연구이다. 감정 분석 방법은 양측의 규격서 목차 비교하고 동일 또는 유사 부분을 찾아낸다. 유사 정도에 따라 유사도 가중치를 결정한다. 가중치는 전문가의 전문적 지식과 규격서의 유사 정도를 파악하고 부여한다. 완전히 새로 추가된 경우 유사도 가중치는 1, 일부 수정한 경우 유사도 가중치는 0.4, 기존과 거의 동일한 경우 가중치 0.05를 주어 산정한다. 본 논문을 통하여 규격서에 대한 동일 유사성 산출 결과 21.2 페이지임을 알 수 있었다.

• 한국언어정보학회지:언어와정보
• /
• 제14권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.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• 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
• /
• 제10권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.

• 한국컴퓨터정보학회논문지
• /
• 제24권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
• /
• 제10권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
• /
• 제13권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.

• 한국지능시스템학회:학술대회논문집
• /
• 한국지능시스템학회 2007년도 추계학술대회 학술발표 논문집
• /
• 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.