• Title/Summary/Keyword: Intelligent machine

Search Result 1,068, Processing Time 0.02 seconds

THE CONSTRUCTIVE METHOD OF FUZZY RULES OF A CLASS OF DATA

  • Liang, Zhisan;Zhang, Huaguang;Zeungnam, Bien
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.568-572
    • /
    • 1998
  • This paper defines Fuzzy Logic Units(FLUs) which are piece wise finite elements in multidimension Euclidean space, and redefines triangular membership functions which are different from those defined in traditional literature. By analyzing FLUs, this paper gives a constructive method of fuzzy rules in fuzzy logic systems based on finite element method. The simulation results of single machine to infinite bus system show the effectiveness of the proposed method in this paper.

  • PDF

Autonomous Optical Thinking Machine Dealing with Impression of Pictures

  • TAMANO, KazuHo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.423-425
    • /
    • 1998
  • An optical system which can autonomously form and display an impression of a picture made up by many figures has been developed. This system consists of optical fuzzy-neurons which calculate the correlation between the input picture and the reference image by incoherent optics. The calculated signal is applied to an amplifier whereby the output signal increases, then decreases according to increase of the input signal . These outputs are synthesized, and are used for changing the position where the system gaze on a part of the input picture by light beam. In this system, the light intensity used for gazing changes chaotically, The attractor drawn from the change of light intensity corresponds to the impression of the picture. This paper shows the results that are calculated by the numerical simulation. The system has been simulated to express the impression for a picture formed by 4figures.

  • PDF

Structure Preserving Dimensionality Reduction : A Fuzzy Logic Approach

  • Nikhil R. Pal;Gautam K. Nandal;Kumar, Eluri-Vijaya
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.426-431
    • /
    • 1998
  • We propose a fuzzy rule based method for structure preserving dimensionality reduction. This method selects a small representative sample and applies Sammon's method to project it. The input data points are then augmented by the corresponding projected(output) data points. The augmented data set thus obtained is clustered with the fuzzy c-means(FCM) clustering algorithm. Each cluster is then translated into a fuzzy rule for projection. Our rule based system is computationally very efficient compared to Sammon's method and is quite effective to project new points, i.e., it has good predictability.

  • PDF

A distance metric of nominal attribute based on conditional probability (조건부 확률에 기반한 범주형 자료의 거리 측정)

  • 이재호;우종하;오경환
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09b
    • /
    • pp.53-56
    • /
    • 2003
  • 유사도 혹은 자료간의 거리 개념은 많은 기계학습 알고리즘에서 사용되고 있는 중요한 측정개념이다 하지만 입력되는 자료의 속성들중 순서가 정의되지 않은 범주형 속성이 포함되어 있는 경우, 자료간의 유사도나 거리 측정에 어려움이 따른다. 비거리 기반의 알고리즘들의 경우-C4.5, CART-거리의 측정없이 작동할 수 있지만, 거리기반의 알고리즘들의 경우 범주형 속성의 거리 정보 결여로 효과적으로 적용될 수 없는 문제점을 갖고 있다. 본 논문에서는 이러한 범주형 자료들간 거리 측정을 자료 집합의 특성을 충분히 고려한 방법을 제안한다. 이를 위해 자료 집합의 선험적인 정보를 필요로 한다. 이런 선험적 정보인 조건부 확률을 기반으로한 거리 측정방법을 제시하고 오류 피드백을 통해서 속성 간 거리 측정을 최적화 하려고 노력한다. 주어진 자료 집합에 대해 서로 다른 두 범주형 값이 목적 속성에 대해서 유사한 분포를 보인다면 이들 값들은 비교적 가까운 거리로 결정한다 이렇게 결정된 거리를 기반으로 학습 단계를 진행하며 이때 발생한 오류들에 대해 피드백 작업을 진행한다. UCI Machine Learning Repository의 자료들을 이용한 실험 결과를 통해 제안한 거리 측정 방법의 우수한 성능을 확인하였다.

  • PDF

Automatic Clustering Agent using PCA and SOM (PCA와 SOM을 이용한 자동 군집화 에이전트)

  • 박정은;김병진;오경환
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09b
    • /
    • pp.67-70
    • /
    • 2003
  • 인터넷의 정보 홍수 속에서 원하는 정보를 정확하게 제시간에 얻기란 쉬운 일이 아니며, 따라서 이러한 작업을 대신해주는 에이전트의 역할이 점점 커지고 있다. 대부분의 이벤트들이 실시간에 발생되고 처리되어야 하는 인터넷 환경에서는 분석가가 군집화의 방법과 결과 해석에 지속적으로 관여하기 어렵기 때문에 이러한 분석가의 업무를 대신하는 지능화된 에이전트가 필요하게 된다. 본 논문에서는 특히 자율학습 군집화에 대한 자동화된 시스템으로서 자동 군집화 에이전트를 제안하며 이 시스템은 군집화 수행 에이전트와 군집화 성능 평가 에이전트로 이루어져 있다. 두 개의 에이전트가 서로 정보를 교환하면서 자동적으로 최적의 군집화를 수행한다. 군집화 과정에서는 데이터를 분석하는 분석가가 군집화의 방법과 결과 해석에 실시간으로 관여하기 어렵기 때문에 이러한 작업을 담당하는 지능화된 에이전트가 자동화된 군집화를 담당하면 효과적인 군집화 전략이 될 수 있다. 또한 UCI Machine Repository의 IRIS 데이터와 Microsoft Web Log Data를 이용한 실험을 통해 제안 시스템의 성능 평가를 수행하였다.

  • PDF

Multi-Modal Biometrics Recognition Method of Face Recognition using Fuzzy-EBGM and Iris Recognition using Fuzzy LDA (Fuzzy-EBGM을 이용한 얼굴인식과 Fuzzy-LDA를 이용한 홍채인식의 다중생체인식 기법 연구)

  • Go Hyoun-Joo;Kwon Mann-Jun;Chun Myung-Ceun
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2005.11a
    • /
    • pp.299-301
    • /
    • 2005
  • 본 연구는 생체정보를 이용하여 개인을 인증하고 확인하기 위한 방법으로 기존 단일 생체인식 기법의 단점을 보완하기 위해 홍채와 얼굴을 이용한 다중생체인식(Multi-Modal Biometrics Recognition)기법을 연구하였다. 중국 홍채 데이터베이스 CASIA(Chinese Academy of Science)에 Gabor Wavelet과 FLDA(Fuzzy Linear Discriminant Analysis)를 사용하여 특징벡터를 획득하였으며, FERET(FERET(Face Recognition Technology) 얼굴영상데이터를 사용하여 FERET 연구에서 매우 우수한 성능을 보인 EBGM알고리듬으로 특징벡터를 획득하였다. 이로부터 얻어진 두 score 값에 대하여 다양한 균등화 과정을 시도해 보았으며, 등록자와 침입자를 구분하기 위한 Fusion Algorithm으로 Bayesian Classifier, Support vector machine, Fisher's linear discriminant를 사용하였다. 또한, 널리 사용되는 방법 중 Weighted Summation을 이용하여 다중생체인식의 성능을 비교해 보았다.

  • PDF

Sparse Data Cleaning using Multiple Imputations

  • Jun, Sung-Hae;Lee, Seung-Joo;Oh, Kyung-Whan
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.4 no.1
    • /
    • pp.119-124
    • /
    • 2004
  • Real data as web log file tend to be incomplete. But we have to find useful knowledge from these for optimal decision. In web log data, many useful things which are hyperlink information and web usages of connected users may be found. The size of web data is too huge to use for effective knowledge discovery. To make matters worse, they are very sparse. We overcome this sparse problem using Markov Chain Monte Carlo method as multiple imputations. This missing value imputation changes spare web data to complete. Our study may be a useful tool for discovering knowledge from data set with sparseness. The more sparseness of data in increased, the better performance of MCMC imputation is good. We verified our work by experiments using UCI machine learning repository data.

An Adaptive Goal-Based Model for Autonomous Multi-Robot Using HARMS and NuSMV

  • Kim, Yongho;Jung, Jin-Woo;Gallagher, John C.;Matson, Eric T.
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.2
    • /
    • pp.95-103
    • /
    • 2016
  • In a dynamic environment autonomous robots often encounter unexpected situations that the robots have to deal with in order to continue proceeding their mission. We propose an adaptive goal-based model that allows cyber-physical systems (CPS) to update their environmental model and helps them analyze for attainment of their goals from current state using the updated environmental model and its capabilities. Information exchange approach utilizes Human-Agent-Robot-Machine-Sensor (HARMS) model to exchange messages between CPS. Model validation method uses NuSMV, which is one of Model Checking tools, to check whether the system can continue its mission toward the goal in the given environment. We explain a practical set up of the model in a situation in which homogeneous robots that has the same capability work in the same environment.

Robust Algorithms for Combining Multiple Term Weighting Vectors for Document Classification

  • Kim, Minyoung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.2
    • /
    • pp.81-86
    • /
    • 2016
  • Term weighting is a popular technique that effectively weighs the term features to improve accuracy in document classification. While several successful term weighting algorithms have been suggested, none of them appears to perform well consistently across different data domains. In this paper we propose several reasonable methods to combine different term weight vectors to yield a robust document classifier that performs consistently well on diverse datasets. Specifically we suggest two approaches: i) learning a single weight vector that lies in a convex hull of the base vectors while minimizing the class prediction loss, and ii) a mini-max classifier that aims for robustness of the individual weight vectors by minimizing the loss of the worst-performing strategy among the base vectors. We provide efficient solution methods for these optimization problems. The effectiveness and robustness of the proposed approaches are demonstrated on several benchmark document datasets, significantly outperforming the existing term weighting methods.

A Comparison Study of Classification Algorithms in Data Mining

  • Lee, Seung-Joo;Jun, Sung-Rae
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.8 no.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.