• 대한산업공학회지
• /
• 제40권4호
• /
• pp.382-387
• /
• 2014

Image retrieval is a procedure to find images based on the resemblance between query image and all images. In retrieving images, the crucial step that arises is how to define the similarity between images. In this paper, we propose a new similarity measure which is based on distribution of color. We apply the new measure to retrieving two different types of images, wallpaper images and the logo of automobiles, and compare its performance to other existing similarity measures.

• 응용통계연구
• /
• 제25권6호
• /
• pp.1027-1036
• /
• 2012

Among various biometrics recognition systems, statistical fingerprint recognition matching methods are considered using minutiae on fingerprints. We define similarity distance measures based on the coordinate and angle of the minutiae, and suggest a fingerprint recognition model following statistical distributions. We could obtain confidence intervals of similarity distance for the same and different persons, and optimal thresholds to minimize two kinds of error rates for distance distributions. It is found that the two confidence intervals of the same and different persons are not overlapped and that the optimal threshold locates between two confidence intervals. Hence an alternative statistical matching method can be suggested by using nonoverlapped confidence intervals and optimal thresholds obtained from the distributions of similarity distances.

• International Journal of Computer Science & Network Security
• /
• 제24권6호
• /
• pp.1-7
• /
• 2024

Comparing text features involves evaluating the "similarity" between texts. It is crucial to use appropriate similarity measures when comparing similarities. This study utilized various techniques to assess the similarities between newspaper articles, including deep learning and a previously proposed method: a combination of Pointwise Mutual Information (PMI) and Word Pair Matching (WPM), denoted as PMI+WPM. For performance comparison, law data from medical research in Japan were utilized as validation data in evaluating the PMI+WPM method. The distribution of similarities in text data varies depending on the evaluation technique and genre, as revealed by the comparative analysis. For newspaper data, non-deep learning methods demonstrated better similarity evaluation accuracy than deep learning methods. Additionally, evaluating similarities in law data is more challenging than in newspaper articles. Despite deep learning being the prevalent method for evaluating textual similarities, this study demonstrates that non-deep learning methods can be effective regarding Japanese-based texts.

• 정보관리학회지
• /
• 제23권3호
• /
• pp.147-165
• /
• 2006

이 연구에서는 전체 문헌집단으로부터 초기 질의어에 대한 연관용어 선정 시 사용할 수 있는 최적의 기법을 찾기 위해 연관규칙 마이닝과 용어 클러스터링 기법을 이용하여 연관용어 선정 실험을 수행하였다. 연관규칙 마이닝 기법에서는 Apriori 알고리즘을 사용하였으며, 용어 클러스터링 기법에서는 연관성 척도로 GSS 계수, 자카드계수, 코사인계수, 소칼 & 스니스 5, 상호정보량을사용하였다. 성능평가 척도로는 연관용어 정확률과 연관용어 일치율을 사용하였으며, 실험결과 Apriori 알고리즘과 GSS 계수가 가장 좋은 성능을 나타냈다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권2호
• /
• pp.538-561
• /
• 2020

Recommender Systems (RecSys) have a major role in e-commerce for recommending products, which they may like for every user and thus improve their business aspects. Although many types of RecSyss are there in the research field, the state of the art RecSys has focused on finding the user similarity based on sequence (e.g. purchase history, movie-watching history) analyzing and prediction techniques like Recurrent Neural Network in Deep learning. That is RecSys has considered as a sequence prediction problem. However, evaluation of similarities among the customers is challenging while considering temporal aspects, context and multi-component ratings of the item-records in the customer sequences. For addressing this issue, we are proposing a Deep Learning based model which learns customer similarity directly from the sequence to sequence similarity as well as item to item similarity by considering all features of the item, contexts, and rating components using Dynamic Temporal Warping(DTW) distance measure for dynamic temporal matching and 2D-GRU (Two Dimensional-Gated Recurrent Unit) architecture. This will overcome the limitation of non-linearity in the time dimension while measuring the similarity, and the find patterns more accurately and speedily from temporal and spatial contexts. Experiment on the real world movie data set LDOS-CoMoDa demonstrates the efficacy and promising utility of the proposed personalized RecSys architecture.

• 한국정보과학회논문지:데이타베이스
• /
• 제36권5호
• /
• pp.366-373
• /
• 2009

이 논문은 이미지 데이터베이스를 위한 유사도 순위 매김 알고리즘을 제시한다. 이미지 검색의 문제점 중 하나가 이미지로부터 자동적으로 계산한 하위 레벨 특성과 인간 지각과의 의미 차이이며, 검색시에 이미지 유사도 측정을 위해 많은 알고리즘에서는 민코프스키 측정법($L_p$-norm)을 사용하고 있다. 그러나 민코프스키 측정법은 인간 시각 시스템의 비선형적 특성과 문맥 정보를 반영하지 못한다. 본 알고리즘에서는 인간 지각의 비선형성과 문맥 정보를 반영하는 유사도와 탐색 알고리즘을 통해 이 문제를 해결한다. 본 알고리즘을 필기체 숫자 이미지 데이터베이스에 적용하여 성능의 우수성과 효과를 증명하였다.

• International Journal of Contents
• /
• 제13권4호
• /
• pp.70-79
• /
• 2017

Images are an important element in patents and many experts use images to analyze a patent or to check differences between patents. However, there is little research on image analysis for patents partly because image processing is an advanced technology and typically patent images consist of visual parts as well as of text and numbers. This study suggests two methods for using image processing; the Scale Invariant Feature Transform(SIFT) algorithm and Optical Character Recognition(OCR). The first method which works with SIFT uses image feature points. Through feature matching, it can be applied to calculate the similarity between documents containing these images. And in the second method, OCR is used to extract text from the images. By using numbers which are extracted from an image, it is possible to extract the corresponding related text within the text passages. Subsequently, document similarity can be calculated based on the extracted text. Through comparing the suggested methods and an existing method based only on text for calculating the similarity, the feasibility is achieved. Additionally, the correlation between both the similarity measures is low which shows that they capture different aspects of the patent content.

• 한국지능시스템학회논문지
• /
• 제19권5호
• /
• pp.603-608
• /
• 2009

본 논문에서는 구간값 모호집합 사이의 유사척도를 제안한다. 구간값 모호집합에서는 모호집합의 상한과 하한을 각각 구간값 퍼지집합의 구간으로 표현한다. 제안한 유사척도는 구간값 모호집합 사이의 유사척도를 평가하기 위해 기하학적 거리와 구간값 모호집합 사이의 중심점 개념을 결합한다. 우리는 제안한 유사척도에 대한 세 가지 속성도 증명한다. 제안한 방법은 구간값 모호집합 사이의 유사정도를 측정하는 유용한 방법을 제공한다.

• 한국정보기술학회논문지
• /
• 제17권12호
• /
• pp.29-38
• /
• 2019

라이프로그를 이용한 경로 예측 기법은 정확한 경로 예측을 위하여 많은 양의 학습 데이터를 요구하며, 학습 데이터가 부족할 경우 경로 예측 성능이 저하된다. 학습 데이터 부족은 사용자의 이동 패턴이 유사한 다른 사용자의 데이터를 이용하여 해결이 가능하다. 따라서 이 논문은 사용자 유사도 기반 경로 예측 알고리즘을 제안한다. 이를 위하여 제안 알고리즘은 경로를 3단 그리드 패턴으로 학습하고 코사인 유사도 기법을 이용하여 사용자 간 유사도를 측정한다. 이후, 측정된 유사도를 학습된 모델에 적용하여 경로를 예측한다. 평가를 위하여 기존 경로 예측 기법들과 제안 기법의 경로 예측 정확도를 측정 및 비교한다. 그 결과, 제안 기법의 정확도는 66.6%로 다른 기법들에 비해 평균 1.8% 더 높은 정확도를 가진 것으로 평가된다.

• 국제학술발표논문집
• /
• The 6th International Conference on Construction Engineering and Project Management
• /
• pp.597-598
• /
• 2015

In order to improve the reliability of cost estimation results using CBR, there has been a continuous issue on similarity measurement to accurately compute the distance among attributes and cases to retrieve the most similar singular or plural cases. However, these existing similarity measures have limitations in taking the covariance among attributes into consideration and reflecting the effects of covariance in computation of distances among attributes. To deal with this challenging issue, this research examines the weighted Mahalanobis distance based similarity measure applied to CBR cost estimation and carries out the comparative study on the existing distance measurement methods of CBR. To validate the suggest CBR cost model, leave-one-out cross validation (LOOCV) using two different sets of simulation data are carried out. Consequently, this research is expected to provide an analysis of covariance effects in similarity measurement and a basis for further research on the fundamentals of case retrieval.