• Title/Summary/Keyword: fuzzy partition

Search Result 106, Processing Time 0.03 seconds

Fuzzy discretization with spatial distribution of data and Its application to feature selection (데이터의 공간적 분포를 고려한 퍼지 이산화와 특징선택에의 응용)

  • Son, Chang-Sik;Shin, A-Mi;Lee, In-Hee;Park, Hee-Joon;Park, Hyoung-Seob;Kim, Yoon-Nyun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.2
    • /
    • pp.165-172
    • /
    • 2010
  • In clinical data minig, choosing the optimal subset of features is such important, not only to reduce the computational complexity but also to improve the usefulness of the model constructed from the given data. Moreover the threshold values (i.e., cut-off points) of selected features are used in a clinical decision criteria of experts for differential diagnosis of diseases. In this paper, we propose a fuzzy discretization approach, which is evaluated by measuring the degree of separation of redundant attribute values in overlapping region, based on spatial distribution of data with continuous attributes. The weighted average of the redundant attribute values is then used to determine the threshold value for each feature and rough set theory is utilized to select a subset of relevant features from the overall features. To verify the validity of the proposed method, we compared experimental results, which applied to classification problem using 668 patients with a chief complaint of dyspnea, based on three discretization methods (i.e., equal-width, equal-frequency, and entropy-based) and proposed discretization method. From the experimental results, we confirm that the discretization methods with fuzzy partition give better results in two evaluation measures, average classification accuracy and G-mean, than those with hard partition.

Comparative Study of Knowledge Extraction on the Industrial Applications

  • Woo, Young-Kwang;Bae, Hyeon;Kim, Sung-Shin;Woo, Kwang-Bang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1338-1343
    • /
    • 2003
  • Data is the expression of the language or numerical values that show some characteristics. And information is extracted from data for the specific purposes. The knowledge is utilized as information to construct rules that recognize patterns and make decisions. Today, knowledge extraction and application of the knowledge are broadly accomplished to improve the comprehension and to elevate the performance of systems in several industrial fields. The knowledge extraction could be achieved by some steps that include the knowledge acquisition, expression, and implementation. Such extracted knowledge can be drawn by rules. Clustering (CU, input space partition (ISP), neuro-fuzzy (NF), neural network (NN), extension matrix (EM), etc. are employed for expression the knowledge by rules. In this paper, the various approaches of the knowledge extraction are examined by categories that separate the methods by the applied industrial fields. Also, the several test data and the experimental results are compared and analysed based upon the applied techniques that include CL, ISP, NF, NN, EM, and so on.

  • PDF

Character Extraction Using Wavelet Transform and Fuzzy Clustering (웨이브렛 변환과 퍼지 군집화를 활용한 문자추출)

  • Hwang, Jung-Won;Hwang, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.4 s.316
    • /
    • pp.93-100
    • /
    • 2007
  • In this paper, a novel approach based on wavelet transform is proposed to process the scraped character which is represented on digital image. The basis idea is that the scraped character is described by its textured neighborhood, and it is decomposed into multiresolution features at different levels with its background region. The image is first decomposed into sub bands by applying Daubechies wavelets. Character features are extracted from the low frequency sub-bands by partition, FCM clustering and area-based region process. High frequency ones are activated by applying local energy density over a moving mask. Features are synthesized in order to reconstruct the original image state through inverse wavelet transform Background region is eliminated and character is extracted. The experimental results demonstrate the effectiveness of the proposed method.

Performance Improvement on MFCM for Nonlinear Blind Channel Equalization Using Gaussian Weights (가우시안 가중치를 이용한 비선형 블라인드 채널등화를 위한 MFCM의 성능개선)

  • Han, Soo-Whan;Park, Sung-Dae;Woo, Young-Woon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.407-412
    • /
    • 2007
  • 본 논문에서는 비선형 블라인드 채널등화기의 구현을 위하여 가우시안 가중치(gaussian weights)를 이용한 개선된 퍼지 클러스터(Modified Fuzzy C-Means with Gaussian Weights: MFCM_GW) 알고리즘을 제안한다. 제안된 알고리즘은 기존 FCM 알고리즘의 유클리디언 거리(Euclidean distance) 값 대신 Bayesian Likelihood 목적함수(fitness function)와 가우시안 가중치가 적용된 멤버쉽 매트릭스(partition matrix)를 이용하여, 비선형 채널의 출력으로 수신된 데이터들로부터 최적의 채널 출력 상태 값(optimal channel output states)들을 직접 추정한다. 이렇게 추정된 채널 출력 상태 값들로 비선형 채널의 이상적 채널 상태(desired channel states) 벡터들을 구성하고, 이를 Radial Basis Function(RBF) 등화기의 중심(center)으로 활용함으로써 송신된 데이터 심볼을 찾아낸다. 실험에서는 무작위 이진 신호에 가우시안 잡음이 추가된 데이터를 사용하여 기존의 Simplex Genetic Algorithm(GA), 하이브리드 형태의 GASA(GA merged with simulated annealing (SA)), 그리고 과거에 발표되었던 MFCM 등과 그 성능을 비교 분석하였으며, 가우시안 가중치가 적용된 MFCM_GW를 이용한 채널등화기가 상대적으로 정확도와 속도 면에서 우수함을 보였다.

  • PDF

An Efficient Pattern Partitioning Method in Multi-dimensional Feature Space (다차원 특징 공간에서의 효울적 패턴 분할 기법)

  • Kim, Jin-Il
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.3
    • /
    • pp.833-841
    • /
    • 1998
  • The ann of this study is 10 propose all eff'tcient mclhod for partition of multi-dimensIOnal feature space into pattern subspace for automated generation of fuzzy rule. The suggested mclhod predicates on sequential subdivision of the fuzzy subspacc. and the size of construc1cd pattern space is variable. Under this procedure, n-dimensional pattern space, after considering the distributional characteristic patterns, is partitioned into two different pattern subspaces. From the two subspaces, the pattern space for further subdivision is chosen; then, this subdivision procedure recursively repeats itself until the stopping condition is fulfilled. The result of this study is applied to 2, 4, 7 band of satellite Landsat TM and satisfac10ry result is acquired.

  • PDF

The application of fuzzy spatial overlay method to the site selection using GSIS (GSIS를 이용한 입지선정에 있어 퍼지공간중첩기법의 적용에 관한 연구)

  • 임승현;조기성
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.17 no.2
    • /
    • pp.177-187
    • /
    • 1999
  • Up to date, in many application fields of GSIS, we usually have used vector-based spatial overlay or grid-based spatial algebra for extraction and analysis of spatial data. But, because these methods are based on traditional crisp set, concept which is used these methods. shows that many kinds of spatial data are partitioned with sharp boundary. That is not agree with spatial distribution pattern of data in the real world. Therefore, it has a error that a region or object is restricted within only one attribution (One-Entity-one-value). In this study, for improving previous methods that deal with spatial data based on crisp set, we are suggested to apply into spatial overlay process the concept of fuzzy set which is good for expressing the boundary vagueness or ambiguity of spatial data. two methods be given. First method is a fuzzy interval partition by fuzzy subsets in case of spatially continuous data, and second method is fuzzy boundary set applied on categorical data. with a case study to get a land suitability map for the development site selection of new town, we compared results between Boolean analysis method and fuzzy spatial overlay method. And as a result, we could find out that suitability map using fuzzy spatial overlay method provide more reasonable information about development site of new town, and is more adequate type in the aspect of presentation.

  • PDF

A Watershed-based Texture Segmentation Method Using Marker Clustering (마커 클러스터링을 이용한 유역변환 기반의 질감 분할 기법)

  • Hwang, Jin-Ho;Kim, Won-Hee;Moon, Kwang-Seok;Kim, Jong-Nam
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.4
    • /
    • pp.441-449
    • /
    • 2007
  • In clustering for image segmentation, large amount of computation and typical segmentation errors have been important problems. In the paper, we suggest a new method for minimizing these problems. Markers in marker-controlled watershed transform represent segmented areas because they are starting-points of extending areas. Thus, clustering restricted by marker pixels can reduce computational complexity. In our proposed method, the markers are selected by Gabor texture energy, and cluster information of them are generated by FCM (fuzzy c-mean) clustering. Generated areas from watershed transform are merged by using cluster information of markers. In the test of Brodatz' texture images, we improved typical partition-errors obviously and obtained less computational complexity compared with previous FCM clustering algorithms. Overall, it also took regular computational time.

  • PDF

An Optimal Design of Neuro-Fuzzy Logic Controller Using Lamarckian Co-adaptation of Learning and Evolution (학습과 진화의 Lamarckian 상호 적응에 의한 뉴로-퍼지 제어기의 최적 설계)

  • 김대진;이한별;강대성
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.12
    • /
    • pp.85-98
    • /
    • 1998
  • This paper proposes a new design method of neuro-FLC by the Lamarckian co-adaptation scheme that incorporates the backpropagation learning into the GA evolution in an attempt to find optimal design parameters (fuzzy rule base and membership functions) of application-specific FLC. The design parameters are determined by evolution and learning in a way that the evolution performs the global search and makes inter-FLC parameter adjustments in order to obtain both the optimal rule base having high covering value and small number of useful fuzzy rules and the optimal membership functions having small approximation error and good control performance while the learning performs the local search and makes intra-FLC parameter adjustments by interacting each FLC with its environment. The proposed co-adaptive design method produces better approximation ability because it includes the backpropagation learning in every generation of GA evolution, shows better control performance because the used COG defuzzifier computes the crisp value accurately, and requires small workspace because the optimization procedure of fuzzy rule base and membership functions is performed concurrently by an integrated fitness function on the same fuzzy partition. Simulation results show that the Lamarckian co-adapted FLC produces the most superior one among the differently generated FLCs in all aspects such as the number of fuzzy rules, the approximation ability, and the control performance.

  • PDF

A Fuzzy Decision Tree to Partition Feature Space with Oblique Planes (특징 공간을 사선 분할하는 퍼지 결정 트리)

  • 이우항;이건명
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10b
    • /
    • pp.21-23
    • /
    • 1999
  • 결정 트리는 실세계에서 얻어지는 많은 사례들로부터 분류 정보를 얻기 위해 사용되는 유용한 방법중의 하나이다. 분류를 목적으로 사용되는 사례, 즉 데이터들은 실제 현장에서 얻어지기 때문에 관측오류, 불확실성, 주관적인 판단 등의 원인으로 참 값이 아닌 근사 값으로써 기술되는 경우가 많으며, 이러한 잠재적 오류로 인해 잘못된 결정 트리가 생성될 수 있다. 한편, 트리를 생성하는 각각의 과정에서 하나의 특징 값만을 고려하지 않고 두 가지 이상의 특징 값을 동시에 고려하여 결정 트리를 생성할 경우 보다 정확한 분류 정보를 기대할 수 있다. 본 논문에서는 수치 특징 값으로 기술된 데이터로부터 보다 정확한 분류 정보를 얻을 수 있고, 작은 오류에 강건한 사선형 분할 퍼지 결정 트리를 제안한다. 또한 제안된 사선형 분할 퍼지 결정 트리의 생성 절차 및 생성된 결정 트리를 이용하여 새로운 데이터에 분류 정보를 부여하는 추론 과정을 소개한다.

  • PDF

A design of binary decision tree using genetic algorithms and its applications (유전 알고리즘을 이용한 이진 결정 트리의 설계와 응용)

  • 정순원;박귀태
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.6
    • /
    • pp.102-110
    • /
    • 1996
  • A new design scheme of a binary decision tree is proposed. In this scheme a binary decision tree is constructed by using genetic algorithm and FCM algorithm. At each node optimal or near-optimal feature subset is selected which optimizes fitness function in genetic algorithm. The fitness function is inversely proportional to classification error, balance between cluster, number of feature used. The binary strings in genetic algorithm determine the feature subset and classification results - error, balance - form fuzzy partition matrix affect reproduction of next genratin. The proposed design scheme is applied to the tire tread patterns and handwriteen alphabetic characters. Experimental results show the usefulness of the proposed scheme.

  • PDF