• 제목/요약/키워드: Fuzzy set classification

검색결과 116건 처리시간 0.029초

로빈스-몬로 확률 근사 알고리즘을 이용한 데이터 분류 (Data Classification Using the Robbins-Monro Stochastic Approximation Algorithm)

  • 이재국;고춘택;최원호
    • 전력전자학회:학술대회논문집
    • /
    • 전력전자학회 2005년도 전력전자학술대회 논문집
    • /
    • pp.624-627
    • /
    • 2005
  • This paper presents a new data classification method using the Robbins Monro stochastic approximation algorithm k-nearest neighbor and distribution analysis. To cluster the data set, we decide the centroid of the test data set using k-nearest neighbor algorithm and the local area of data set. To decide each class of the data, the Robbins Monro stochastic approximation algorithm is applied to the decided local area of the data set. To evaluate the performance, the proposed classification method is compared to the conventional fuzzy c-mean method and k-nn algorithm. The simulation results show that the proposed method is more accurate than fuzzy c-mean method, k-nn algorithm and discriminant analysis algorithm.

  • PDF

Classification of Arrhythmia Based on Discrete Wavelet Transform and Rough Set Theory

  • Kim, M.J.;J.-S. Han;Park, K.H.;W.C. Bang;Z. Zenn Bien
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2001년도 ICCAS
    • /
    • pp.28.5-28
    • /
    • 2001
  • This paper investigates a classification method of the electrocardiogram (ECG) into different disease categories. The features for the classification of the ECG are the coefficients of the discrete wavelet transform (DWT) of ECG signals. The coefficients are calculated with Haar wavelet, and after DWT we can get 64 coefficients. Each coefficient has morphological information and they may be good features when conventional time-domain features are not available. Since all of them are not meaningful, it is needed to reduce the size of meaningful coefficients set. The distributions of each coefficient can be the rules to classify ECG signal. The optimally reduced feature set is obtained by fuzzy c-means algorithm and rough set theory. First, the each coefficient is clustered by fuzzy c-means algorithm and the clustered ...

  • PDF

Improved Classification Algorithm using Extended Fuzzy Clustering and Maximum Likelihood Method

  • Jeon Young-Joon;Kim Jin-Il
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
    • /
    • pp.447-450
    • /
    • 2004
  • This paper proposes remotely sensed image classification method by fuzzy c-means clustering algorithm using average intra-cluster distance. The average intra-cluster distance acquires an average of the vector set belong to each cluster and proportionates to its size and density. We perform classification according to pixel's membership grade by cluster center of fuzzy c-means clustering using the mean-values of training data about each class. Fuzzy c-means algorithm considered membership degree for inter-cluster of each class. And then, we validate degree of overlap between clusters. A pixel which has a high degree of overlap applies to the maximum likelihood classification method. Finally, we decide category by comparing with fuzzy membership degree and likelihood rate. The proposed method is applied to IKONOS remote sensing satellite image for the verifying test.

  • PDF

퍼지의사결정을 이용한 RC구조물의 건전성평가 (Integrity Assessment for Reinforced Concrete Structures Using Fuzzy Decision Making)

  • 박철수;손용우;이증빈
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2002년도 봄 학술발표회 논문집
    • /
    • pp.274-283
    • /
    • 2002
  • This paper presents an efficient models for reinforeced concrete structures using CART-ANFIS(classification and regression tree-adaptive neuro fuzzy inference system). a fuzzy decision tree parttitions the input space of a data set into mutually exclusive regions, each of which is assigned a label, a value, or an action to characterize its data points. Fuzzy decision trees used for classification problems are often called fuzzy classification trees, and each terminal node contains a label that indicates the predicted class of a given feature vector. In the same vein, decision trees used for regression problems are often called fuzzy regression trees, and the terminal node labels may be constants or equations that specify the Predicted output value of a given input vector. Note that CART can select relevant inputs and do tree partitioning of the input space, while ANFIS refines the regression and makes it everywhere continuous and smooth. Thus it can be seen that CART and ANFIS are complementary and their combination constitutes a solid approach to fuzzy modeling.

  • PDF

Fuzzy 밀집기법을 이용한 맞춤형 부픔 분류법의 개발 (Development of a Company-Tailored Part Classification & Coding System Using fuzzy clustering Techniques)

  • 박진우
    • 한국경영과학회지
    • /
    • 제13권1호
    • /
    • pp.31-38
    • /
    • 1988
  • This paper presents a methodology for the development of a part classification and coding system suited to each individual company. When coding a group of parts for a specific company by a general purpose part classification & coding system like OPITZ system, it is frequently observed that we use only a small subset of total available code numbers. Such sparsity in the actual occurrences of code numbers implies that we can design a better system which uses digits of the system more parsimoniously. A 2-dimensional fuzzy ISODATA algorithm is developed to extract the important characteristics for the classification from the set of given parts. Based on the extracted characteristics nd the distances between fuzzy clustering cenetroids, a company-unique classification and coding system can be developed. An example case study for a medium sized machine shop is presented.

  • PDF

FUZZY SELECTION AND EXISTENCE OF FUZZY FIXED POINT

  • Kim, Won-Kyu;Park, Kyoo-Hong;Lee, Kyoung-Hee
    • Journal of applied mathematics & informatics
    • /
    • 제2권1호
    • /
    • pp.17-24
    • /
    • 1995
  • In this paper we shall prove a new fuzzy continuous selec-tion theorem in a compact convex set and next a fixed point theorem for fuzzy mappings is established.

GA-Based Construction of Fuzzy Classifiers Using Information Granules

  • Kim Do-Wan;Lee Ho-Jae;Park Jin-Bae;Joo Young-Hoon
    • International Journal of Control, Automation, and Systems
    • /
    • 제4권2호
    • /
    • pp.187-196
    • /
    • 2006
  • A new GA-based methodology using information granules is suggested for the construction of fuzzy classifiers. The proposed scheme consists of three steps: selection of information granules, construction of the associated fuzzy sets, and tuning of the fuzzy rules. First, the genetic algorithm (GA) is applied to the development of the adequate information granules. The fuzzy sets are then constructed from the analysis of the developed information granules. An interpretable fuzzy classifier is designed by using the constructed fuzzy sets. Finally, the GA is utilized for tuning of the fuzzy rules, which can enhance the classification performance on the misclassified data (e.g., data with the strange pattern or on the boundaries of the classes). To show the effectiveness of the proposed method, an example, the classification of the Iris data, is provided.

A Construction of Fuzzy Model for Data Mining

  • Kim, Do-Wan;Joo, Young-Hoon;Park, Jin-Bae
    • 한국지능시스템학회논문지
    • /
    • 제13권2호
    • /
    • pp.209-215
    • /
    • 2003
  • A new GA-based methodology using information granules is suggested for the construction of fuzzy classifiers. The proposed scheme consists of three steps: selection of information granules, construction of the associated fuzzy sets, and tuning of the fuzzy rules. First, the genetic algorithm (GA) is applied to the development of the adequate information granules. The fuzzy sets are then constructed from the analysis of the developed information granules. An interpretable fuzzy classifier is designed by using the constructed fuzzy sets. Finally, the GA are utilized for tuning of the fuzzy rules, which can enhance the classification performance on the misclassified data (e.g., data with the strange pattern or on the boundaries of the classes). To show the effectiveness of the proposed method, an example, the classification of the Iris data, is provided.

Design of Fuzzy Model for Data Mining

  • Kim, Do-Wan;Joo, Young-Hoon;Park, Jin-Bae
    • 한국지능시스템학회논문지
    • /
    • 제13권1호
    • /
    • pp.107-113
    • /
    • 2003
  • A new GA-based methodology using information granules is suggested for the construction of fuzzy classifiers. The proposed scheme consists of three steps: selection of information granules, construction of the associated fuzzy sets, and tuning of the fuzzy rules. First, the genetic algorithm (GA) is applied to the development of the adequate information granules. The fuzzy sets are then constructed from the analysis of the developed information granules. An interpretable fuzzy classifier is designed by using the constructed fuzzy sets. Finally, the GA are utilized for tuning of the fuzzy rules, which can enhance the classification performance on the misclassified data (e.g., data with the strange pattern or on the boundaries of the classes). To show the effectiveness of the proposed method, an example, the classification of the Iris data, is provided.

Stacked Autoencoder를 이용한 특징 추출 기반 Fuzzy k-Nearest Neighbors 패턴 분류기 설계 (Design of Fuzzy k-Nearest Neighbors Classifiers based on Feature Extraction by using Stacked Autoencoder)

  • 노석범;오성권
    • 전기학회논문지
    • /
    • 제64권1호
    • /
    • pp.113-120
    • /
    • 2015
  • In this paper, we propose a feature extraction method using the stacked autoencoders which consist of restricted Boltzmann machines. The stacked autoencoders is a sort of deep networks. Restricted Boltzmann machines (RBMs) are probabilistic graphical models that can be interpreted as stochastic neural networks. In terms of pattern classification problem, the feature extraction is a key issue. We use the stacked autoencoders networks to extract new features which have a good influence on the improvement of the classification performance. After feature extraction, fuzzy k-nearest neighbors algorithm is used for a classifier which classifies the new extracted data set. To evaluate the classification ability of the proposed pattern classifier, we make some experiments with several machine learning data sets.