• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.463-468
• /
• 2001

We propose a new similarity measure based on relative membership function (RMF). In this paper, the RMF is suggested to represent the relativity between fuzzy subsets easily. Since the shape of the RMF is determined according to the values of its parameters, we can easily represent the relativity between fuzzy subsets by adjusting only the values of its parameters. Hence, we can easily reflect the relativity among individuals or cultural differences when we represent the subjectivity by using the fuzzy subsets. In this case, these parameters may be regarded as feature points for determining the structure of fuzzy subset. In the sequel, the degree of similarity between fuzzy subsets can be quickly computed by using the parameters of the RMF. We use Euclidean distance to compute the degree of similarity between fuzzy subsets represented by the RMF. In the meantime, we present a new linguistic approximation method as an application area of the proposed similarity measure and show its numerical example.

• The Korean Journal of Applied Statistics
• /
• v.1 no.1
• /
• pp.45-56
• /
• 1987

본 논문은 선거구 劃定을 서로 연관된 전체와 均等比例라는 制約條件이 있는 경우의 群集方法이라는 측면에서 관찰한다. 두 지역의 類似性을 측정할 수 있는 새로운 測度가 개발되며 이는 하나의 선거구가 되기 위해 중요시 되는 몇가지 기준에 대해 두 지역이 일치한 횟수로 정의된다. 이러한 유사성 측도를 기초로 해서 선거구 劃定을 위한 새로운 階層群集方法이 제시된다. 새로운 유사성 측도와 계측군집방법을 경기도내 29개 市 $\cdot$ 郡에 적응하여 얻어진 결과는 경기도의 현행 국회의원 선거구와 비교 설명되어 진다.

• Journal of Information Technology and Architecture
• /
• v.9 no.3
• /
• pp.333-344
• /
• 2012

This paper proposes a system which recommends movies using information from social network services containing personal interest and taste. Method for establishing data is as follows. The system gathers movies' information from web sites and user's information from social network services such as Facebook and twitter. The data from social network services is categorized into six steps of emotion level for more accurate processing following users' emotional states. Gathered data will be established into vector space model which is ideal for analyzing and deducing the information with the system which is suggested in this paper. The existing similarity measurement method for movie recommendation is presentation of vector information about emotion level and similarity measuring method on the coordinates using Cosine measure. The deducing method suggested in this paper is two-phase arithmetic operation as follows. First, using general cosine measurement, the system establishes movies list. Second, using similarity measurement, system decides recommendable movie list by vector operation from the coordinates. After Comparative Experimental Study on the previous recommendation systems and new one, it turned out the new system from this study is more helpful than existing systems.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.1
• /
• pp.39-51
• /
• 2012

Cluster analysis has proven to be a useful tool for investigating the association structure among genes and samples in a microarray data set. We applied several cluster validation measures to evaluate the performance of clustering algorithms for analyzing microarray gene expression data, including hierarchical clustering, K-means, PAM, SOM and model-based clustering. The available validation measures fall into the three general categories of internal, stability and biological. The performance of clustering algorithms is evaluated using simulated and SRBCT microarray data. Our results from simulated data show that nearly every methods have good results with same result as the number of classes in the original data. For the SRBCT data the best choice for the number of clusters is less clear than the simulated data. It appeared that PAM, SOM, model-based method showed similar results to simulated data under Silhouette with of internal measure as well as PAM and model-based method under biological measure, while model-based clustering has the best value of stability measure.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.389-391
• /
• 2003

컴퓨터 학습의 군집화는 주어진 데이터를 서로 유사한 몇 개의 집단으로 묶는 작업을 수행한다. 군집화를 위한 유사도 결정을 위한 측도는 많은 기법들에서 매우 다양한 측도들이 사용되고 또한 연구되어 왔다. 하지만 군집화의 결과에 대한 성능측정에 대한 객관적인 기준 설정이 어렵기 때문에 군집화 결과에 대한 해석은 매우 주관적이고 애매한 경우가 많다. 퍼지 군집화는 이러한 애매한 군집화 문제에 있어서 융통성 있는 군집 결정 방안을 제시해 준다. 각 개체들이 특정 군집에 속하게 될 퍼지 멤버 함수값을 원소로 하는 유사도 행렬을 통하여 군집화를 수행한다. 본 논문에서는 베이지안 학습을 통하여 군집화를 위한 퍼지 멤버 함수값을 구하였다. 본 연구에서는 최적의 퍼지 군집화 수행을 위하여 베이지안 학습 기반의 퍼지 규칙을 추출하였다. 인공적으로 만든 데이터와 기존의 기계 학습 데이터를 이용한 실험을 통하여 제안 방법의 성능을 확인하였다.

• The Korean Journal of Applied Statistics
• /
• v.34 no.5
• /
• pp.807-822
• /
• 2021

Various accuracy measures that can be explained on the odds curve are discussed, and an alternative accuracy measure, the maximum square, is proposed based on the characteristics of the odds curve. Thresholds corresponding to these accuracy measures are obtained by considering various probability distribution functions and an illustrative example. Their characteristics are discussed while comparing many kinds of statistics measuring thresholds. Therefore, we can conclude that optimal thresholds could be explored from the odds curve, similar to the ROC curve, and that the maximum square measure can be used as a good accuracy measure that can improve the performance of the binary classification model.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.1
• /
• pp.97-106
• /
• 2014

The development of big data technology was to more accurately predict diversified contemporary society and to more efficiently operate it, and to enable impossible technique in the past. This technology can be utilized in various fields such as the social science, economics, politics, cultural sector, and science technology at the national level. It is a prerequisite to find valuable information by data mining techniques in order to analyze big data. Data mining techniques associated with big data involve text mining, opinion mining, cluster analysis, association rule mining, and so on. The most widely used data mining technique is to explore association rules. This technique has been used to find the relationship between each set of items based on the association thresholds such as support, confidence, lift, similarity measures, etc.This paper proposed cosine net confidence as association thresholds, and checked the conditions of interestingness measure proposed by Piatetsky-Shapiro, and examined various characteristics. The comparative studies with basic confidence and cosine similarity, and cosine net confidence were shown by numerical example. The results showed that cosine net confidence are better than basic confidence and cosine similarity because of the relevant direction.

• Proceedings of the Korean Statistical Society Conference
• /
• 2000.11a
• /
• pp.261-266
• /
• 2000

이변량 반복측정자료에서 Chinchilli 등(1996)이 제안한 가중일치상관계수는 두 변수의 일치성을 나타내는 측도이다. 기존에 제안된 가중일치상관계수 추정법은 변동효과 및 측정오차의 분산성분을 각각 최소제곱법으로 비편향 추정하여 구하는 것이다. 본 연구에서는 반복측정자료의 주변 우도함수를 설정한 후, 우도함수에 기초한 분산성분을 구하여 가중일치상관계수를 추정하는 방법을 제안한다. 이때, 각 분산성분은 유사/의사 우도함수 및 사후 분포에서 반복시행을 통하여 구해진다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.200-205
• /
• 2008

For data analysis, fuzzy entropy is introduced as the measure of fuzziness, similarity measure is also constructed to represent similarity between data. Similarity measure between fuzzy membership functions is constructed through distance measure, and the proposed similarity measure are proved. Application of proposed similarity measure to the example of reliable data selection is also carried out. Application results are compared with the previous results that is obtained through fuzzy entropy and statistical knowledge.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.147-152
• /
• 2007

Face detection is a crucial part of the face recognition system. It determines the performance of the whole recognition system. Hausdorff distance metric has been used in face detection and recognition with good results. It defines the distance metric based only on the geometric similarity between two sets or points. However, not only the geometry but also the local patterns around the points are available in most cases. In this paper a new Hausdorff distance measure is proposed that makes hybrid use of the similarity of the geometry and the local patterns around the points. Several experiments shows that the new method outperforms the conventional method.