• Journal of the Korean Data and Information Science Society
• /
• 제15권3호
• /
• pp.617-624
• /
• 2004

In this article the fuzzy number rank and the fuzzy rank transformation method are introduced in order to analyse the non-parametric fuzzy regression model which cannot be described as a specific functional form such as the crisp data and fuzzy data as a independent and dependent variables respectively. The effectiveness of fuzzy rank transformation methods is compared with other methods through the numerical examples.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제14권2호
• /
• pp.98-104
• /
• 2014

Locality-sensitive hashing techniques have been developed to efficiently handle nearest neighbor searches and similar pair identification problems for large volumes of high-dimensional data. This study proposes a locality-sensitive hashing method that can be applied to nearest neighbor search problems for data sets containing both numerical and categorical attributes. The proposed method makes use of dual hashing functions, where one function is dedicated to numerical attributes and the other to categorical attributes. The method consists of creating indexing structures for each of the dual hashing functions, gathering and combining the candidates sets, and thoroughly examining them to determine the nearest ones. The proposed method is examined for a few synthetic data sets, and results show that it improves performance in cases of large amounts of data with both numerical and categorical attributes.

• 감성과학
• /
• 제10권3호
• /
• pp.289-297
• /
• 2007

칼라 이미지 스케일은 칼라 전문가들의 지식에 의해 획득되고, 형용사와 대응되는 칼라(들)을 선택하기 위해 동일한 형용사 이미지 스케일들에서 형용사들과 칼라를 표현한다. 이들은 이미지 스케일을 얻기 위한 실험과 통계분석의 어려움 때문에 일반적으로, 단지 제한된 수의 칼라들만이 이미지 스케일에 위치한다. 이는 칼라를 선택하는 과정을 비전문가에게 어렵게 만든다. 본 논문에서는 이미지 스케일에 따라 연속적인 칼라를 제공하는 퍼지 K-근접 이웃 보간 방법에 기초를 둔 칼라 이미지 스케일의 보간 방법을 제안한다. 실험의 결과들은 보간된 이미지 스케일은 칼라 선택 과정에 있어 실용적으로 유용하게 사용될 수 있을 것이라 본다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제14권4호
• /
• pp.240-248
• /
• 2014

We present a robust speaker identification algorithm that uses novel features based on soft bag-of-word representation and a simple Naive Bayes classifier. The bag-of-words (BoW) based histogram feature descriptor is typically constructed by summarizing and identifying representative prototypes from low-level spectral features extracted from training data. In this paper, we define a generalization of the standard BoW. In particular, we define three types of BoW that are based on crisp voting, fuzzy memberships, and possibilistic memberships. We analyze our mapping with three common classifiers: Naive Bayes classifier (NB); K-nearest neighbor classifier (KNN); and support vector machines (SVM). The proposed algorithms are evaluated using large datasets that simulate medical crises. We show that the proposed soft bag-of-words feature representation approach achieves a significant improvement when compared to the state-of-art methods.

• 대한전자공학회논문지SP
• /
• 제48권2호
• /
• pp.125-133
• /
• 2011

WLAN 환경하에서 알고리즘 기반의 패턴 매칭을 위해 training 단계에서는 여러 개의 AP에서 신호 잡음비의 특성값을 데이터베이스에 만들어 활용하고 estimation 단계에서는 단말기(MU)의 2차원 좌표값을 단말기로부터 새롭게 얻은 SNR과 데이터베이스에 저장된 fingerprint을 비교함으로써 추정한다. Fingerprinting 방식에서 KNN은 WLAN 기반 실내 측위에 가장 많이 적용되고 있지만 KNN의 성능은 k 개의 이웃 수와 RP의 수에 따라 민감하다. 논문에서는 KNN 성능을 향상시키기 위해 PFCM 군집화를 적용한 KNN과 PFCM을 혼합한 알고리즘을 제안하였다. 제안한 알고리즘은 신호잡음비 데이터를 KNN 방법에 적용하여 k개의 RP을 선택한 후 선택된 RP의 신호잡음비를 PFCM에 적용하여 k개의 RP를 군집하여 분류한다. 실험 결과에서는 위치 오차가 2m 이내에서 KNN/IFCM 알고리즘이 KNN, KNN/FCM, KNN/PFCM 알고리즘보다 성능이 우수하다.

• 대한전자공학회논문지SP
• /
• 제47권6호
• /
• pp.146-153
• /
• 2010

무선 네트워크 기반 실내 측위는 측위를 위한 특수 장비를 필요로 하지 않고, Fingerprinting 방식은 무선 네트워크 기반 측위를 위한 기술 중에서 가장 정확도가 높기 때문에 무선 네트워크 Fingerprinting 방식이 가장 적당한 실내 측위 방법이다. Fingerprinting 방식에서 KNN은 WLAN 기반 실내 측위에 가장 많이 적용되고 있지만 KNN의 성능은k개의 이웃 수와 RP의 수에 따라 민감하다. 논문에서는 KNN 성능을 향상시키기 위해 PFCM 군집화를 적용한 KNN과 PFCM을 혼합한 알고리즘을 제안하였다. 제안한 알고리즘은 신호잡음비 데이터를 KNN 방법에 적용하여k개의 RP을 선택한 후 선택된 RP의 신호잡음비를 PFCM에 적용하여k개의 RP를 군집하여 분류한다. 실험 결과에서는 위치 오차가 2m 이내에서 KNN/PFCM 알고리즘이 KNN과 KNN/FCM 알고리즘보다 성능이 우수하다.

• 반도체디스플레이기술학회지
• /
• 제12권3호
• /
• pp.53-57
• /
• 2013

Human emotions are expressed in various ways. It can be expressed through language, facial expression and gestures. In particular, the facial expression contains many information about human emotion. These vague human emotion appear not in single emotion, but in combination of various emotion. This paper proposes a emotional expression algorithm using Active Appearance Model(AAM) and Fuzz k- Nearest Neighbor which give facial expression in similar with vague human emotion. Applying Mahalanobis distance on the center class, determine inclusion level between center class and each class. Also following inclusion level, appear intensity of emotion. Our emotion recognition system can recognize a complex emotion using Fuzzy k-NN classifier.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제12권1호
• /
• pp.1-5
• /
• 2012

Data reduction has been used widely in data mining for convenient analysis. Principal component analysis (PCA) and factor analysis (FA) methods are popular techniques. The PCA and FA reduce the number of variables to avoid the curse of dimensionality. The curse of dimensionality is to increase the computing time exponentially in proportion to the number of variables. So, many methods have been published for dimension reduction. Also, data augmentation is another approach to analyze data efficiently. Support vector machine (SVM) algorithm is a representative technique for dimension augmentation. The SVM maps original data to a feature space with high dimension to get the optimal decision plane. Both data reduction and augmentation have been used to solve diverse problems in data analysis. In this paper, we compare the strengths and weaknesses of dimension reduction and augmentation for classification and propose a classification method using data reduction for classification. We will carry out experiments for comparative studies to verify the performance of this research.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제8권1호
• /
• pp.1-5
• /
• 2008

Generally the analytical tools of data mining have two learning types which are supervised and unsupervised learning algorithms. Classification and prediction are main analysis tools for supervised learning. In this paper, we perform a comparison study of classification algorithms in data mining. We make comparative studies between popular classification algorithms which are LDA, QDA, kernel method, K-nearest neighbor, naive Bayesian, SVM, and CART. Also, we use almost all classification data sets of UCI machine learning repository for our experiments. According to our results, we are able to select proper algorithms for given classification data sets.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제14권4호
• /
• pp.313-321
• /
• 2014

In the current era of data-intensive services, the handling of big data is a crucial issue that affects almost every discipline and industry. In this study, we propose a classification method for large volumes of numeric data, which is implemented in a distributed programming framework, i.e., MapReduce. The proposed method partitions the data space into a grid structure and it then models the probability distributions of classes for grid cells by collecting sufficient statistics using distributed MapReduce tasks. The class labeling of new data is achieved by k-nearest neighbor classification based on Bayesian inference.